Sciweavers

456 search results - page 6 / 92
» A Proof System for Abstract Non-interference
Sort
View
IANDC
2010
141views more  IANDC 2010»
13 years 6 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
ASIACRYPT
2000
Springer
13 years 11 months ago
Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
Danny Gutfreund, Michael Ben-Or
EUROCAST
2001
Springer
189views Hardware» more  EUROCAST 2001»
13 years 12 months ago
Assertion-Based Analysis of Hybrid Systems with PVS
Abstract. Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safe...
Erika Ábrahám-Mumm, Ulrich Hannemann...
ENTCS
2007
96views more  ENTCS 2007»
13 years 7 months ago
A List-machine Benchmark for Mechanized Metatheory: (Extended Abstract)
ed Metatheory (Extended Abstract) Andrew W. Appel Princeton University and INRIA Rocquencourt Xavier Leroy INRIA Rocquencourt We propose a benchmark to compare theorem-proving sys...
Andrew W. Appel, Xavier Leroy
CADE
2007
Springer
14 years 7 months ago
System for Automated Deduction (SAD): A Tool for Proof Verification
In this paper, a proof assistant, called SAD, is presented. SAD deals with mathematical texts that are formalized in the ForTheL language (brief description of which is also given)...
Konstantin Verchinine, Alexander V. Lyaletski, And...