120 search results - page 4 / 24 » Experimenting with Deduction Modulo |
CADE
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
TLCA
2007
Springer
14 years 3 months ago
2007
Springer
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...
TLCA
2005
Springer
14 years 3 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...