Sciweavers

92 search results - page 18 / 19
» Formal Modelling and Verification of an Asynchronous Extensi...
Sort
View
JCS
2010
80views more  JCS 2010»
13 years 3 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
ENTCS
2006
138views more  ENTCS 2006»
13 years 8 months ago
Variables as Resource in Separation Logic
Separation logic [20,21,14] began life as an extended formalisation of Burstall's treatment of list-mutating programs [8]. It rapidly became clear that there was more that it...
Richard Bornat, Cristiano Calcagno, Hongseok Yang
RTSS
1998
IEEE
14 years 24 days ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
AC
2000
Springer
14 years 27 days ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier
ICFP
2006
ACM
14 years 8 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...