Sciweavers

96 search results - page 17 / 20
» Verification of an Implementation of Tomasulo's Algorithm by...
Sort
View
FAC
2008
100views more  FAC 2008»
13 years 7 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CAV
2009
Springer
157views Hardware» more  CAV 2009»
14 years 8 months ago
Explaining Counterexamples Using Causality
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
Ilan Beer, Shoham Ben-David, Hana Chockler, Avigai...
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...
ATAL
2004
Springer
13 years 11 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, ...
POPL
2010
ACM
14 years 4 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi