Sciweavers

1018 search results - page 45 / 204
» Abstraction and Refinement in Model Checking
Sort
View
ACTA
2006
108views more  ACTA 2006»
13 years 7 months ago
Refinement verification of the lazy caching algorithm
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Wim H. Hesselink
VSTTE
2005
Springer
14 years 1 months ago
Model Checking: Back and Forth between Hardware and Software
The interplay back and forth between software model checking and hardware model checking has been fruitful for both. Originally intended for the analysis of concurrent software, mo...
Edmund M. Clarke, Anubhav Gupta, Himanshu Jain, He...
FMCO
2009
Springer
203views Formal Methods» more  FMCO 2009»
13 years 5 months ago
Applying Event-B Atomicity Decomposition to a Multi Media Protocol
Abstract. Atomicity Decomposition is a technique in the Event-B formal method, which augments Event-B refinement with additional structuring in a diagrammatic notation to support c...
Asieh Salehi Fathabadi, Michael Butler
STTT
2010
116views more  STTT 2010»
13 years 2 months ago
LTL satisfiability checking
Abstract. We report here on an experimental investigation of LTL satisfiability checking via a reduction to model checking. By using large LTL formulas, we offer challenging model-...
Kristin Y. Rozier, Moshe Y. Vardi
APCCM
2008
13 years 9 months ago
Model Eco-Systems: Preliminary Work
Modeling is core software engineering practice. Conceptual models are constructed to establish an abstract understanding of the domain among stakeholders. These are then refined i...
Aditya Ghose, George Koliadis