Sciweavers

271 search results - page 27 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
121
Voted
LICS
2007
IEEE
15 years 6 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
87
Voted
RR
2007
Springer
15 years 6 months ago
A Semantic Framework for Language Layering in WSML
Abstract. WSML presents a framework encompassing different language variants, rooted in Description Logics and (F-)Logic Programming. So far, the precise relationships between thes...
Jos de Bruijn, Stijn Heymans
CADE
2008
Springer
16 years 25 days ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
103
Voted
FSEN
2009
Springer
15 years 4 months ago
Executable Interface Specifications for Testing Asynchronous Creol Components
We propose and explore a formal approach for black-box testing asynchronously communicating components in open environments. Asynchronicity poses a challenge for validating and tes...
Immo Grabe, Marcel Kyas, Martin Steffen, Arild B. ...
RTA
2009
Springer
15 years 7 months ago
YAPA: A Generic Tool for Computing Intruder Knowledge
Reasoning about the knowledge of an attacker is a necessary step in many formal analyses of security protocols. In the framework of the applied pi calculus, as in similar languages...
Mathieu Baudet, Véronique Cortier, St&eacut...