76 search results - page 14 / 16 » A Tabulation Proof Procedure for Residuated Logic Programmin... |
FSTTCS
1999
Springer
14 years 10 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
135
click to vote
CADE
2011
Springer
13 years 6 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
VMCAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
ILP
2003
Springer
14 years 11 months ago
2003
Springer
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
137
click to vote
POPL
2009
ACM
15 years 6 months ago
2009
ACM
This paper describes a compositional shape analysis, where each procedure is analyzed independently of its callers. The analysis uses an abstract domain based on a restricted frag...