172 search results - page 30 / 35 » Automatic Termination Analysis of Logic Programs |
102
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
109
click to vote
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
116
click to vote
CADE
2009
Springer
16 years 5 days ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
IOR
2006
14 years 11 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
CAV
2008
Springer
15 years 1 months ago
2008
Springer
We describe Thor (Tool for Heap-Oriented Reasoning), a tool based on separation logic that is capable of reasoning automatically about heap-manipulating programs. There are several...