Sciweavers

290 search results - page 37 / 58
» Theorem Proving Using Lazy Proof Explication
Sort
View
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 3 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
DBPL
1997
Springer
133views Database» more  DBPL 1997»
15 years 4 months ago
Automatic Verification of Transactions on an Object-Oriented Database
Abstract. In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead...
David Spelt, Herman Balsters
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
15 years 5 months ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
ESOP
2005
Springer
15 years 5 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
JUCS
2006
104views more  JUCS 2006»
14 years 11 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...