Sciweavers

211 search results - page 5 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
POPL
2011
ACM
12 years 10 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
JAR
2010
98views more  JAR 2010»
13 years 2 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Classical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...
James Brotherston, Cristiano Calcagno
TLCA
2007
Springer
14 years 1 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
JSYML
2008
86views more  JSYML 2008»
13 years 7 months ago
On Skolemization in constructive theories
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...
Matthias Baaz, Rosalie Iemhoff