Sciweavers

884 search results - page 69 / 177
» A Proof Theory for DL-Lite
Sort
View
CADE
2002
Springer
16 years 6 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
ENTCS
2006
103views more  ENTCS 2006»
15 years 6 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström
MSCS
2006
53views more  MSCS 2006»
15 years 6 months ago
Random reals and Lipschitz continuity
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
Andrew E. M. Lewis, George Barmpalias
TAP
2008
Springer
153views Hardware» more  TAP 2008»
15 years 6 months ago
Bounded Relational Analysis of Free Data Types
Abstract. In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of ...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
FAC
1998
111views more  FAC 1998»
15 years 5 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink