76 search results - page 4 / 16 » A Tabulation Proof Procedure for Residuated Logic Programmin... |
99
Voted
PLDI
2009
ACM
15 years 6 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
115
Voted
AMAI
1999
Springer
14 years 11 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
106
click to vote
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a Hoare logic for a simple imperative whilelanguage with stored commands, ie. stored parameterless procedures. Stores that may contain procedures are called hi...
118
Voted
CADE
2005
Springer
15 years 12 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
187
Voted
ICFP
2009
ACM
16 years 9 days ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...