Sciweavers

783 search results - page 121 / 157
» Compositional Reasoning in Model Checking
Sort
View
LICS
2003
IEEE
14 years 3 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
AGENTCL
2003
Springer
14 years 3 months ago
Resolving Commitments among Autonomous Agents
Commitments are a powerful representation for modeling multiagent interactions. Previous approaches have considered the semantics of commitments and how to check compliance with th...
Ashok U. Mallya, Pinar Yolum, Munindar P. Singh
FSTTCS
2001
Springer
14 years 2 months ago
Computability and Complexity Results for a Spatial Assertion Language for Data Structures
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
Cristiano Calcagno, Hongseok Yang, Peter W. O'Hear...
CP
2004
Springer
14 years 1 months ago
Unary Resource Constraint with Optional Activities
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
Petr Vilím, Roman Barták, Ondrej Cep...
ACSD
2001
IEEE
134views Hardware» more  ACSD 2001»
14 years 1 months ago
Embedding Imperative Synchronous Languages in Interactive Theorem Provers
We present a new way to define the semantics of imperative synchronous languages by means of separating the control and the data flow. The control flow is defined by predicates th...
Klaus Schneider