Sciweavers

1895 search results - page 333 / 379
» Using ATL for Checking Models
Sort
View
TACAS
2009
Springer
131views Algorithms» more  TACAS 2009»
15 years 11 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...
LICS
2008
IEEE
15 years 11 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
ASYNC
2007
IEEE
129views Hardware» more  ASYNC 2007»
15 years 8 months ago
Formal Verification of CHP Specifications with CADP Illustration on an Asynchronous Network-on-Chip
Few formal verification techniques are currently available for asynchronous designs. In this paper, we describe a new approach for the formal verification of asynchronous architec...
Gwen Salaün, Wendelin Serwe, Yvain Thonnart, ...
ATAL
2004
Springer
15 years 8 months ago
State-Space Reduction Techniques in Agent Verification
We have developed a set of tools to allow the use of model-checking techniques for the verification of systems directly implemented in an agent-oriented programming language. The ...
Rafael H. Bordini, Michael Fisher, Willem Visser, ...
ISSTA
2010
ACM
15 years 6 months ago
Analysis of invariants for efficient bounded verification
SAT-based bounded verification of annotated code consists of translating the code together with the annotations to a propositional formula, and analyzing the formula for specifica...
Juan P. Galeotti, Nicolás Rosner, Carlos L&...