Sciweavers

LPAR
2007
Springer
14 years 5 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
LPAR
2007
Springer
14 years 5 months ago
Extending a Resolution Prover for Inequalities on Elementary Functions
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
Behzad Akbarpour, Lawrence C. Paulson
LPAR
2007
Springer
14 years 5 months ago
One-Pass Tableaux for Computation Tree Logic
Pietro Abate, Rajeev Goré, Florian Widmann
LPAR
2007
Springer
14 years 5 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
LPAR
2007
Springer
14 years 5 months ago
Why Would You Trust B ?
Abstract. The use of formal methods provides confidence in the correctness of developments. Yet one may argue about the actual level of confidence obtained when the method itself...
Éric Jaeger, Catherine Dubois
LPAR
2007
Springer
14 years 5 months ago
Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap
Operational models of (security) protocols, on one hand, are readable and conveniently match their implementation (at a certain abstraction level). Epistemic models, on the other h...
Francien Dechesne, Mohammad Reza Mousavi, Simona O...
LPAR
2007
Springer
14 years 5 months ago
HORPO with Computability Closure: A Reconstruction
Abstract. This paper provides a new, decidable definition of the higherorder recursive path ordering in which type comparisons are made only when needed, therefore eliminating the...
Frédéric Blanqui, Jean-Pierre Jouann...
LPAR
2007
Springer
14 years 5 months ago
Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Richard Bonichon, David Delahaye, Damien Doligez
LPAR
2007
Springer
14 years 5 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
LPAR
2007
Springer
14 years 5 months ago
Preferential Description Logics
In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC ...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...