نتایج جستجو برای: trace constraint

تعداد نتایج: 144250  

2009
Antons Rebguns Derek Green Diana Spears Geoffrey Levine Ugur Kuter

We present a Bayesian approach to learning flexible safety constraints and subsequently verifying whether plans satisfy these constraints. Our approach, called the Safety Constraint Learner/Checker (SCLC), is embedded within the Generalized Integrated Learning Architecture (GILA), which is an integrated, heterogeneous, multi-agent ensemble architecture designed for learning complex problem solv...

2003
Xi Chen Harry Hsieh Felice Balarin Yosinori Watanabe

System design methodology is poised to become the next big enabler for highly sophisticated electronic products. Design verification continues to be a major challenge and simulation will remain an important tool for making sure that implementations perform as they should. In this paper we present algorithms to automatically generate C++ checkers from any formula written in the formal quantitati...

1995
Livio Colussi Elena Marchiori Massimo Marchiori

This paper introduces an alternative operational model for constraint logic programs First a transition system is introduced which is used to de ne a trace semantics T Next an equivalent xpoint se mantics F is de ned a data ow graph is assigned to a program and a consequence operator on tuples of sets of constraints is given whose least xpoint determines one set of constraints for each node of ...

1995
Giampiero Esposito

We study a R 2 model of gravity with torsion in a closed Friedmann-Robertson-Walker universe. The model is cast in Hamiltonian form subtracting from the original Lagrangian the total time derivative of f K f R , where f K is proportional to the trace of the extrinsic curvature tensor, and f R is obtained differentiating the Lagrangian with respect to the highest derivative. Torsion is found to ...

1995
Livio Colussi Elena Marchiori Massimo Marchiori

This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to deene a trace semantics T. Next, an equivalent xpoint semantics F is deened: a dataaow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least xpoint determines one set of constraints for each no...

2017
Shiyou Huang Bowen Cai Jeff Huang

We present a new technique, H3, for reproducing Heisenbugs in production runs on commercial hardware. H3 integrates the hardware control flow tracing capability provided in recent Intel processors with symbolic constraint analysis. Compared to a state-of-the-art solution, CLAP, this integration allows H3 to reproduce failures with much lower runtime overhead and much more compact trace. Moreove...

1995
Livio Colussi Elena Marchiori Massimo Marchiori

This paper introduces an alternative operational model for constraint logic programs. First, a transition system is introduced, which is used to define a trace semantics 7-. Next, an equivalent fixpoint semantics F is defined: a dataflow graph is assigned to a program, and a consequence operator on tuples of sets of constraints is given whose least fixpoint determines one set of constraints for...

2000
Maritta Heisel Jeanine Souquières

We present a heuristic algorithm to systematically detect feature interactions in requirements, which are expressed as constraints on system event traces. The algorithm is part of a broader methodology for requirements elicitation and formal specification. Given a new constraint and a set of already accepted constraints, it computes a set of candidate constraints that possibly interact with the...

2001
Yong Cao Thomas S. Gruca

Recent studies suggest that satisfaction with price affects overall customer satisfaction. In the internet market, customer satisfaction is determined by two separate measures: satisfaction with the pre-purchase experience (e.g. ease of use, selection) and satisfaction with the post-purchase experience (e.g., delivery, order tracking, customer service). Using data collected by a commercial web ...

2001
Alexander Pretschner Heiko Lötzbeyer

We summarize our continuing efforts at model based testing of reactive systems on the grounds of Constraint Logic Programming. First experimental results give rise to optimism w.r.t. scalability of our approach, point at necessary improvements, and they help identify future areas of research. Among others, these include search strategies more powerful than backtracking alone, appropriate (graph...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید