2291 search results - page 134 / 459 » Logic Programming and Model Checking |
130
Voted
IFM
2009
Springer
15 years 9 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
131
click to vote
PLDI
2006
ACM
15 years 8 months ago
2006
ACM
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
117
click to vote
LPNMR
2007
Springer
15 years 8 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...
120
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
147
click to vote
CAV
2004
Springer
15 years 6 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...