Sciweavers

2872 search results - page 249 / 575
» On (Omega-)Regular Model Checking
Sort
View
JFP
2006
78views more  JFP 2006»
15 years 4 months ago
Sound and complete models of contracts
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
Matthias Blume, David A. McAllester
TACAS
1998
Springer
105views Algorithms» more  TACAS 1998»
15 years 8 months ago
Verification of Large State/Event Systems Using Compositionality and Dependency Analysis
A state/event model is a concurrent version of Mealy machines used for describing embedded reactive systems. This paper introduces a technique that uses compositionality and depend...
Jørn Lind-Nielsen, Henrik Reif Andersen, Ge...
TSE
2011
114views more  TSE 2011»
14 years 11 months ago
Loupe: Verifying Publish-Subscribe Architectures with a Magnifying Lens
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
Luciano Baresi, Carlo Ghezzi, Luca Mottola
CHARME
2005
Springer
120views Hardware» more  CHARME 2005»
15 years 10 months ago
How Thorough Is Thorough Enough?
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...
Arie Gurfinkel, Marsha Chechik
FASE
2005
Springer
15 years 10 months ago
A Framework for Counterexample Generation and Exploration
Model-checking is becoming an accepted technique for debugging hardware and software systems. Debugging is based on the “Check / Analyze / Fix” loop: check the system against a...
Marsha Chechik, Arie Gurfinkel