Sciweavers

96 search results - page 19 / 20
» Verification of an Implementation of Tomasulo's Algorithm by...
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 3 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
FMICS
2009
Springer
14 years 10 days ago
A Rigorous Methodology for Composing Services
on Abstraction: a Lightweight Approach to Modelling Concurrency. Javier de Dios and Ricardo Peña Certified Implementation on top of the Java Virtual Machine 19:00 Social dinner + ...
Kenneth J. Turner, Koon Leai Larry Tan
AMOST
2007
ACM
13 years 9 months ago
Achieving both model and code coverage with automated gray-box testing
We have devised a novel technique to automatically generate test cases for a software system, combining black-box model-based testing with white-box parameterized unit testing. Th...
Nicolas Kicillof, Wolfgang Grieskamp, Nikolai Till...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
13 years 3 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
POPL
2010
ACM
13 years 8 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...