Sciweavers

226 search results - page 42 / 46
» Symbolic Model Checking for Real-time Systems
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
14 years 2 months ago
Verifying Reference Counting Implementations
Reference counting is a widely-used resource management idiom which maintains a count of references to each resource by incrementing the count upon an acquisition, and decrementing...
Michael Emmi, Ranjit Jhala, Eddie Kohler, Rupak Ma...
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 28 days ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
STACS
1999
Springer
13 years 11 months ago
The Weakness of Self-Complementation
Model checking is a method for the verification of systems with respect to their specifications. Symbolic model-checking, which enables the verification of large systems, procee...
Orna Kupferman, Moshe Y. Vardi
CAV
2006
Springer
101views Hardware» more  CAV 2006»
13 years 11 months ago
Ticc: A Tool for Interface Compatibility and Composition
Abstract. We present a brief overview of the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component...
B. Thomas Adler, Luca de Alfaro, Leandro Dias da S...