Sciweavers

329 search results - page 5 / 66
» Automatic Proofs for Scalecharts
Sort
View
AISC
1998
Springer
14 years 20 days ago
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
Brigitte Pientka, Christoph Kreitz
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
CRYPTO
2006
Springer
125views Cryptology» more  CRYPTO 2006»
14 years 4 days ago
Automated Security Proofs with Sequences of Games
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
Bruno Blanchet, David Pointcheval
IPL
2006
92views more  IPL 2006»
13 years 8 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
LISP
2008
165views more  LISP 2008»
13 years 8 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind