Sciweavers

1894 search results - page 42 / 379
» A TLA Proof System
Sort
View
IJAIT
2006
106views more  IJAIT 2006»
13 years 10 months ago
An Empirical Evaluation of Automated Theorem Provers in Software Certification
We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof obligatio...
Ewen Denney, Bernd Fischer 0002, Johann Schumann
FOSSACS
2010
Springer
14 years 5 months ago
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building in...
Andrei Popescu, Elsa L. Gunter
IGPL
2007
107views more  IGPL 2007»
13 years 10 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...
Marcelo Finger, Dov M. Gabbay
FOCS
1999
IEEE
14 years 3 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
Amit Sahai
CRYPTO
1991
Springer
144views Cryptology» more  CRYPTO 1991»
14 years 2 months ago
Interactive Proofs with Space Bounded Provers
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
Joe Kilian, Ronitt Rubinfeld