Sciweavers

26 search results - page 4 / 6
» Infinite Traces
Sort
View
NHM
2010
100views more  NHM 2010»
13 years 2 months ago
A 2-adic approach of the human respiratory tree
We propose here a general framework to address the question of trace operators on a dyadic tree. This work is motivated by the modeling of the human bronchial tree which, thanks t...
Frédéric Bernicot, Bertrand Maury, D...
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
BIRTHDAY
2008
Springer
13 years 9 months ago
From Monadic Logic to PSL
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
Moshe Y. Vardi
DCC
2005
IEEE
14 years 7 months ago
New Constructions for IPP Codes
Identifiable parent property (IPP) codes are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we consider explicit constru...
Tran van Trung, Sosina Martirosyan
CSFW
2010
IEEE
13 years 10 months ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson