Sciweavers

507 search results - page 31 / 102
» Counterexample-Guided Abstraction Refinement
Sort
View
GLVLSI
2007
IEEE
141views VLSI» more  GLVLSI 2007»
14 years 1 months ago
A synchronization algorithm for local temporal refinements in perfectly synchronous models with nested feedback loops
he abstract and simple computation and communication mechanism in the synchronous computational model it is easy to simulate synchronous systems and to apply formal verification m...
Tarvo Raudvere, Ingo Sander, Axel Jantsch
FMCO
2009
Springer
203views Formal Methods» more  FMCO 2009»
13 years 7 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
ECBS
2003
IEEE
146views Hardware» more  ECBS 2003»
14 years 3 months ago
Architecture-Based Design of Computer Based Systems
This paper presents a practical approach to architecture-based design of computer based systems. The approach is discussed in relation to other existing of performing discovery, a...
Mark Denford, Tim O'Neill, John Leaney
CAV
2006
Springer
101views Hardware» more  CAV 2006»
14 years 1 months ago
Terminator: Beyond Safety
Previous symbolic software model checkers (i.e., program analysis tools based on predicate abstraction, pushdown model checkiterative counterexample-guided abstraction refinement, ...
Byron Cook, Andreas Podelski, Andrey Rybalchenko
ESOP
2007
Springer
14 years 1 months ago
Type Reconstruction for General Refinement Types
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
Kenneth W. Knowles, Cormac Flanagan