Filters








50,107 Hits in 5.8 sec

Concrete Model Checking with Abstract Matching and Refinement [chapter]

Corina S. Păsăreanu, Radek Pelánek, Willem Visser
2005 Lecture Notes in Computer Science  
We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis.  ...  The results of these checks are used to decide termination or to refine the abstraction by generating new abstraction predicates.  ...  The refinement is done by checking exactness of abstractions with the use of a theorem prover.  ... 
doi:10.1007/11513988_7 fatcat:g64dxakas5evjnush64p2j6bju

Predicate Abstraction with Under-Approximation Refinement

Corina Păsăreanu, Radek Pelánek, Willem Visser, Kousha Etessami
2007 Logical Methods in Computer Science  
We propose an abstraction-based model checking method which relies on refinement of an under-approximation of the feasible behaviors of the system under analysis.  ...  The results of these checks are used to decide termination or to refine the abstraction by generating new abstraction predicates.  ...  Section 4 describes the main algorithm for performing concrete model checking with abstract matching and refinement.  ... 
doi:10.2168/lmcs-3(1:5)2007 fatcat:7lv3xmdav5ajph3azzocokixuq

Guiding simulation with increasingly refined abstract traces

K. Nanshi, F. Somenzi
2006 Proceedings - Design Automation Conference  
We combine abstraction refinement and simulation to provide a more efficient approach to checking invariant properties whose only counterexamples are very long traces.  ...  We allow each transition of an abstract error trace to map to multiple transitions of the concrete error trace and simulate pseudorandom vectors to build segments of the concrete trace.  ...  The property is checked in the abstract model with a model checker.  ... 
doi:10.1109/dac.2006.229318 fatcat:pvcihkngx5gdjpaahu442rnvqi

Guiding simulation with increasingly refined abstract traces

Kuntal Nanshi, Fabio Somenzi
2006 Proceedings of the 43rd annual conference on Design automation - DAC '06  
We combine abstraction refinement and simulation to provide a more efficient approach to checking invariant properties whose only counterexamples are very long traces.  ...  We allow each transition of an abstract error trace to map to multiple transitions of the concrete error trace and simulate pseudorandom vectors to build segments of the concrete trace.  ...  The property is checked in the abstract model with a model checker.  ... 
doi:10.1145/1146909.1147097 dblp:conf/dac/NanshiS06 fatcat:dibmomjuhbhyzgonqxjtnmmncy

Abstract Analysis of Symbolic Executions [chapter]

Aws Albarghouthi, Arie Gurfinkel, Ou Wei, Marsha Chechik
2010 Lecture Notes in Computer Science  
Novel characteristics of this method are (a) constructing under-approximating models via symbolic execution with abstract matching and (b) proving safety using underapproximating models.  ...  In this paper, we look at the problem of reasoning about concurrent systems with infinite data domains and non-deterministic input, and develop a method for verification and falsification of safety properties  ...  We would like to thank Corina Pasareanu and Radek Pelanek for giving us access to their code, the anonymous referees for their helpful comments, and the formal methods group at the University of Toronto  ... 
doi:10.1007/978-3-642-14295-6_43 fatcat:fudqfplpljhdvnb7pubzqaj7v4

Graph Constraint Evaluation over Partial Models by Constraint Rewriting [chapter]

Oszkár Semeráth, Dániel Varró
2017 Lecture Notes in Computer Science  
Partial models represent multiple possible concrete models, and thus, they are able to capture uncertainty and possible design decisions.  ...  valid constraint may be violated (or an invalid constraint may be respected) when refining a partial model into a concrete model.  ...  Additionally, we would like to thank Gábor Bergmann and the anonymous reviewers for their insightful comments.  ... 
doi:10.1007/978-3-319-61473-1_10 fatcat:ycmk7jkgevaivo5nukfvuowlyi

An Efficient Runtime Validation Framework based on the Theory of Refinement [article]

Mitesh Jain, Panagiotis Manolios
2017 arXiv   pre-print
Our approach compiles a formal refinement conjecture into a runtime check that is performed during simulation.  ...  We introduce a new methodology based on refinement for testing the functional correctness of hardware and low-level software.  ...  With our refinement-based methodology, we only check one property, the WEB refinement property, and the oracle is simply the high-level abstract model (ISA).  ... 
arXiv:1703.05317v1 fatcat:7uvnxtrvn5cx7h7i7z7sp6lg7i

Behavioral Refinement of Graph Transformation-Based Models

Reiko Heckel, Sebastian Thöne
2005 Electronical Notes in Theoretical Computer Science  
Model-driven software engineering requires the refinement of abstract models into more concrete, platform-specific ones.  ...  In contrast to previous approaches, refinement relations on graph transformation systems are not defined as fixed syntactic mappings between abstract transformation rules and, e.g., concrete rule expressions  ...  We require that the behavior of the abstract model can be simulated at the concrete level, and we discuss how this property can be checked by model checking at the concrete level.  ... 
doi:10.1016/j.entcs.2004.08.037 fatcat:3ieuddz55rgshf7kv56gvelbpa

Induction in CEGAR for Detecting Counterexamples

Chao Wang, Aarti Gupta, Franjo Ivancic
2007 Formal Methods in Computer Aided Design (FMCAD'07)  
Existing algorithms including bounded model checking, predicate abstraction, and interpolation are not efficient in detecting long counterexamples.  ...  In this paper, we propose the use of induction inside the counterexample guided abstraction and refinement (CEGAR) loop to prove the existence of counterexamples.  ...  The CEGAR Procedure Counterexample guided abstraction refinement is an iterative procedure consisting of three phases: abstraction, model checking, and refinement.  ... 
doi:10.1109/famcad.2007.21 dblp:conf/fmcad/WangGI07 fatcat:jviiphc6enhgjhnn2kwhso26yu

Skipping Refinement [chapter]

Mitesh Jain, Panagiotis Manolios
2015 Lecture Notes in Computer Science  
Reasoning about reactive systems using refinement involves defining an abstract, highlevel specification system and a concrete, low-level implementation system.  ...  Our experimental results demonstrate that current model-checking and automated theorem proving tools have difficultly automatically analyzing these systems using existing notions of correctness, but they  ...  The concrete system is defined at a lower level of abstraction, so it is usually the case that it requires several steps to match one high-level step of the abstract system.  ... 
doi:10.1007/978-3-319-21690-4_7 fatcat:4yyijtr75vbo3k4xkhf5gxtx7m

Skipping Refinement [article]

Mitesh Jain, Panagiotis Manolios
2015 arXiv   pre-print
Reasoning about reactive systems using refinement involves defining an abstract, high-level specification system and a concrete, low-level implementation system.  ...  Our experimental results demonstrate that current model-checking and automated theorem proving tools have difficultly automatically analyzing these systems using existing notions of correctness, but they  ...  The concrete system is defined at a lower level of abstraction, so it is usually the case that it requires several steps to match one high-level step of the abstract system.  ... 
arXiv:1502.02942v1 fatcat:gj7zwjtcz5a5tawgq2msbywmby

Abstraction and Refinement Techniques in Automated Design Debugging

Sean Safarpour, Andreas Veneris
2007 2007 Design, Automation & Test in Europe Conference & Exhibition  
This work proposes a departure from conventional debugging techniques by introducing abstraction and refinement during error localization.  ...  Experiments on benchmark and industrial designs confirm the effectiveness of the proposed framework and encourage further development of abstraction and refinement methodologies for existing debugging  ...  In this case, the abstract model is refined by reverting some of the abstracted state elements and continuing the model checking process. III.  ... 
doi:10.1109/date.2007.364455 fatcat:ht3tsbvsjzch7avyvjlkn2zmse

Abstraction and Refinement Techniques in Automated Design Debugging

Sean Safarpour, Andreas Veneris
2006 International Workshop on Microprocessor Test and Verification  
This work proposes a departure from conventional debugging techniques by introducing abstraction and refinement during error localization.  ...  Experiments on benchmark and industrial designs confirm the effectiveness of the proposed framework and encourage further development of abstraction and refinement methodologies for existing debugging  ...  In this case, the abstract model is refined by reverting some of the abstracted state elements and continuing the model checking process. III.  ... 
doi:10.1109/mtv.2006.1 dblp:conf/mtv/SafarpourV06 fatcat:hrxgf2fdovetzmtk2crdtraclu

Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure

Bing Li, Chao Wang, Fabio Somenzi
2005 International Journal on Software Tools for Technology Transfer (STTT)  
model, and refinement.  ...  We present an abstraction refinement algorithm for model checking of safety properties that relies exclusively on a SAT solver for checking the abstract model, testing abstract counterexamples on the concrete  ...  In abstraction refinement [Kur94] , one starts with a coarse abstraction of the given, concrete model and keeps refining it until the property is decided.  ... 
doi:10.1007/s10009-004-0169-2 fatcat:ckfq5xzonvfnxpc6f5rt65vyoq

Counterexample Guided Abstraction Refinement Via Program Execution [chapter]

Daniel Kroening, Alex Groce, Edmund Clarke
2004 Lecture Notes in Computer Science  
This paper presents an approach to software model checking that actually executes the program in order to drive abstraction-refinement.  ...  Software model checking tools based on a Counterexample Guided Abstraction Refinement (CEGAR) framework have attained considerable success in limited domains.  ...  that were not previously amenable to abstraction-refinement-based model checking.  ... 
doi:10.1007/978-3-540-30482-1_23 fatcat:i4z5jwnltrc3zc7km4u6yphdui
« Previous Showing results 1 — 15 out of 50,107 results