Sciweavers

446 search results - page 35 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
93
Voted
POPL
2010
ACM
15 years 10 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
114
Voted
KR
2004
Springer
15 years 5 months ago
A First-Order Theory of Communicating First-Order Formulas
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
Ernest Davis
FROCOS
2007
Springer
15 years 4 months ago
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
Roberto Sebastiani
CSL
2006
Springer
15 years 4 months ago
On Rational Trees
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Arnaud Carayol, Christophe Morvan
97
Voted
CSL
2001
Springer
15 years 5 months ago
Uniform Derivation of Decision Procedures by Superposition
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
Alessandro Armando, Silvio Ranise, Michaël Ru...