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...

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...

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...

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 ...

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...

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...

Study of a simple single-trace transmission example shows how an extended source formulation full-waveform inversion can produce optimization problem without spurious local minima ("cycle skipping"), hence efficiently solvable via Newton-like methods. The data consist single trace extracted from causal pressure field, propagating in homogeneous fluid according to linear acoustics, and recorded ...

The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision Diagram (AOMDD) augments well known decision diagrams (OBDDs, MDDs) with AND nodes, in order to capture function decomposition structure. The AOMDD is based on a pseudo tree of the network, rather than a linear order...

Modern geometric constraint solvers use combinatorial graph algorithms to recursively decompose the system of polynomial constraint equations into generically rigid subsystems and then solve the overall system by solving subsystems, from the leave nodes up, to be able to access any and all solutions. Since the overall algebraic complexity of the solution task is dominated by the size of the lar...

Starting with Perlmutter (1971) and the filter proposed in Chomsky and Lasnik (1977), that-trace effects have been mainly conceived as a ban on subject extraction out of an embedded clause introduced by a complementizer. In this paper, we propose an alternative perspective based on the observation that that-trace (like) effects arise not only in sentences involving subject extraction but also i...