700 search results - page 60 / 140 » On Termination of Constraint Logic Programs |
129
click to vote
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
VLC
2011
14 years 6 months ago
2011
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams...
112
click to vote
AADEBUG
2000
Springer
15 years 3 months ago
2000
Springer
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
168
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
An invariance assertion for a program location is a statement that always holds at during execution of the program. Program invariance analyses infer invariance assertions that ca...
144
click to vote
PSSE
2004
Springer
15 years 4 months ago
2004
Springer
“demonic” nondeterminism, representing abstraction from (or ignorance of) which of two program fragments will be executed. By introducing probabilistic nondeterminism into GCL,...