Sciweavers

1461 search results - page 40 / 293
» Analysis of Constraint Logic Programs
Sort
View
CADE
2001
Springer
14 years 11 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager
CORR
2004
Springer
136views Education» more  CORR 2004»
13 years 10 months ago
Automatic Generation of CHR Constraint Solvers
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tab...
Slim Abdennadher, Christophe Rigotti
CADE
2010
Springer
13 years 11 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 10 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij
ICLP
2011
Springer
13 years 2 months ago
Constraints in Non-Boolean Contexts
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...