Sciweavers

82 search results - page 2 / 17
» Inductive Proofs of Computational Secrecy
Sort
View
ESOP
2005
Springer
14 years 2 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 8 months ago
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
Frédéric Blanqui, Jean-Pierre Jouann...
ENTCS
2006
169views more  ENTCS 2006»
13 years 8 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
BIRTHDAY
2005
Springer
13 years 10 months ago
History and Future of Implicit and Inductionless Induction: Beware the Old Jade and the Zombie!
Abstract. In this survey on implicit induction I recollect some memories on the history of implicit induction as it is relevant for future research on computer-assisted theorem pro...
Claus-Peter Wirth
FATES
2003
Springer
14 years 1 months ago
Using a Software Testing Technique to Improve Theorem Proving
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
Reiner Hähnle, Angela Wallenburg