Sciweavers

1633 search results - page 192 / 327
» On the Verification of Temporal Properties
Sort
View
TACAS
2004
Springer
135views Algorithms» more  TACAS 2004»
14 years 3 months ago
Liveness with Incomprehensible Ranking
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
MEMOCODE
2003
IEEE
14 years 3 months ago
Methods for exploiting SAT solvers in unbounded model checking
— Modern SAT solvers have proved highly successful in finding counterexamples to temporal properties of systems, using a method known as ”bounded model checking”. It is natu...
Kenneth L. McMillan
APN
2000
Springer
14 years 2 months ago
Pre- and Post-agglomerations for LTL Model Checking
One of the most efficient analysis technique is to reduce an original model into a simpler one such that the reduced model has the same properties than the original one. G. Berthel...
Denis Poitrenaud, Jean-François Pradat-Peyr...
CMSB
2009
Springer
14 years 2 months ago
On Coupling Models Using Model-Checking: Effects of Irinotecan Injections on the Mammalian Cell Cycle
Abstract. In systems biology, the number of models of cellular processes increases rapidly, but re-using models in different contexts or for different questions remains a challengi...
Elisabetta De Maria, François Fages, Sylvai...
FDL
2006
IEEE
14 years 2 months ago
System Description Aspects as Syntactic Sugar
Many different system description and specification languages are used in modern design flows to emphasize different aspects like modular architecture, multibehavior, abstract act...
Jens Brandt, Klaus Schneider