Sciweavers

274 search results - page 40 / 55
» Variants of the Event Calculus
Sort
View
RTA
2005
Springer
14 years 2 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
14 years 2 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy
KI
1999
Springer
14 years 28 days ago
On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics
Among the formalisms for qualitative spatial reasoning, the Region Connection Calculus and its variant, the constraint algebra RCC8, have received particular attention recently. A...
Werner Nutt
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 10 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 8 months ago
Separability in the Ambient Logic
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
Daniel Hirschkoff, Étienne Lozes, Davide Sa...