Sciweavers

ATVA
2005
Springer
112views Hardware» more  ATVA 2005»
14 years 5 months ago
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...
Stéphane Demri, David Nowak
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
14 years 5 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
ATVA
2005
Springer
108views Hardware» more  ATVA 2005»
14 years 5 months ago
Multi-valued Model Checking Games
This work extends the game-based framework of µ-calculus model checking to the multi-valued setting. In multi-valued model checking a formula is interpreted over a Kripke structur...
Sharon Shoham, Orna Grumberg
ATVA
2005
Springer
109views Hardware» more  ATVA 2005»
14 years 5 months ago
A New Reachability Algorithm for Symmetric Multi-processor Architecture
Partitioned BDD-based algorithms have been proposed in the literature to solve the memory explosion problem in BDD-based verification. A naive parallelization of such algorithms ...
Debashis Sahoo, Jawahar Jain, Subramanian K. Iyer,...
ATVA
2005
Springer
108views Hardware» more  ATVA 2005»
14 years 5 months ago
Flat Acceleration in Symbolic Model Checking
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
Sébastien Bardin, Alain Finkel, Jér&...
ATVA
2005
Springer
88views Hardware» more  ATVA 2005»
14 years 5 months ago
A New Graph of Classes for the Preservation of Quantitative Temporal Constraints
Xiaoyu Mao, Janette Cardoso, Robert Valette