Filters








2,738 Hits in 3.5 sec

Extracting Counterexamples from Transitive-Closure-Based Model Checking

Mitchell Kember, Lynn Tran, George Gao, Nancy Day
2019 2019 IEEE/ACM 11th International Workshop on Modelling in Software Engineering (MiSE)  
We address the problem of how to extract counterexamples for the transitive-closure-based model checking (TCMC) technique.  ...  As a CTL model checking method, TCMC is defined over transition systems and states (rather than paths) and therefore, returns a transition system with a bug as a counterexample.  ...  CONCLUSION We have presented a constraint-based method for extracting counterexamples from the results of transitive-closure-based model checking for all CTLFC properties, even those whose counterexample  ... 
doi:10.1109/mise.2019.00015 dblp:conf/icse/KemberTGD19 fatcat:nutfsrmolrf2xeirnhob5ss2qy

Active Learning of Abstract System Models from Traces using Model Checking [Extended] [article]

Natasha Yogananda Jeppu, Tom Melham, Daniel Kroening
2021 arXiv   pre-print
software model checking.  ...  Conditions that encode a completeness hypothesis are then extracted from the FSA under construction and used to evaluate its degree of completeness by checking their truth value against the system using  ...  The extracted conditions are checked against the system implementation using software model checking (See Section III-B.).  ... 
arXiv:2112.05990v1 fatcat:7bstce3ovbcq5lgp3pfwzat3nu

Checking relational specifications with binary decision diagrams

Craig A. Damon, Daniel Jackson, Somesh Jha
1996 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering - SIGSOFT '96  
Throughout, boolean formulae are represented with BDDs; from the resulting BDD, models are easily extracted.  ...  I can't get no satisfaction 'Cause I try and I try and I try and I try --Mick Abstract Checking a specification in a language based on sets and relations (such as Z) can be reduced to the problem of finding  ...  Extracting the first model from the BDD costs almost nothing, but extracting all models is often not feasible, since, lacking isomorph elimination, the BDD method generates many more models than the explicit  ... 
doi:10.1145/239098.239110 dblp:conf/sigsoft/DamonJJ96 fatcat:6s6hetowsrefbprt5qt43h6kmq

Checking relational specifications with binary decision diagrams

Craig A. Damon, Daniel Jackson, Somesh Jha
1996 Software engineering notes  
Throughout, boolean formulae are represented with BDDs; from the resulting BDD, models are easily extracted.  ...  I can't get no satisfaction 'Cause I try and I try and I try and I try --Mick Abstract Checking a specification in a language based on sets and relations (such as Z) can be reduced to the problem of finding  ...  Extracting the first model from the BDD costs almost nothing, but extracting all models is often not feasible, since, lacking isomorph elimination, the BDD method generates many more models than the explicit  ... 
doi:10.1145/250707.239110 fatcat:ur7cr5fs35albblqjjjgz4672q

Termination Analysis with Compositional Transition Invariants [chapter]

Daniel Kroening, Natasha Sharygina, Aliaksei Tsitovich, Christoph M. Wintersteiger
2010 Lecture Notes in Computer Science  
We present an alternative algorithm that uses a light-weight check based on transitivity of ranking relations to prove program termination.  ...  Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the procedure.  ...  If a counterexample is found, we extract a path from it and try to compute a wf. ranking relation for it.  ... 
doi:10.1007/978-3-642-14295-6_9 fatcat:ezcr4lagszcz5aioenapt3jkj4

Accelerating Interpolants [chapter]

Hossein Hojjat, Radu Iosif, Filip Konečný, Viktor Kuncak, Philipp Rümmer
2012 Lecture Notes in Computer Science  
CEGAAR combines interpolation-based predicate discovery in counterexampleguided predicate abstraction with acceleration technique for computing the transitive closure of loops.  ...  We present theoretical and experimental justification for the effectiveness of CEGAAR, showing that inductive interpolants can be computed from classical Craig interpolants and transitive closures of loops  ...  extracted from VHDL models of circuits following the method of [27] .  ... 
doi:10.1007/978-3-642-33386-6_16 fatcat:d2yigewvorctvcjlnqlsvk23sm

State/Event Software Verification for Branching-Time Specifications [chapter]

Sagar Chaki, Edmund Clarke, Orna Grumberg, Joël Ouaknine, Natasha Sharygina, Tayssir Touili, Helmut Veith
2005 Lecture Notes in Computer Science  
We provide a model-checking algorithm for this logic, based upon a compositional abstraction-refinement loop which exploits the natural decomposition of the concurrent system into its components.  ...  The abstraction and refinement steps are performed over each component separately, and only the model checking step requires an explicit composition of the abstracted components.  ...  at Carnegie Mellon [2, 22] . magic extracts finite LKS models from C programs.  ... 
doi:10.1007/11589976_5 fatcat:t7f7geaf6rhwzgqa7loz2vjwh4

Infinite-State Liveness-to-Safety via Implicit Abstraction and Well-Founded Relations [chapter]

Jakub Daniel, Alessandro Cimatti, Alberto Griggio, Stefano Tonetta, Sergio Mover
2016 Lecture Notes in Computer Science  
We present a fully-symbolic LTL model checking approach for infinite-state transition systems.  ...  We increase the effectiveness of the approach by integrating termination techniques based on well-founded relations derived from ranking functions.  ...  Their success is motivated by the possibility to leverage the progress of SAT-based invariant checking techniques, such as interpolation-based model checking [34] and IC3 [10] .  ... 
doi:10.1007/978-3-319-41528-4_15 fatcat:ge3dpqfpdvcx5h66cpfeclrhbu

Constrained Monotonic Abstraction: A CEGAR for Parameterized Verification [chapter]

Parosh Aziz Abdulla, Yu-Fang Chen, Giorgio Delzanno, Frédéric Haziza, Chih-Duo Hong, Ahmed Rezine
2010 Lecture Notes in Computer Science  
Our CEGAR algorithm automatically extracts from each spurious counterexample a set of configurations called a "Safety Zone" and use it to refine the abstract transition system of the next iteration.  ...  We have developed a prototype based on this idea; and our experimentation shows that the approach allows to verify many of the examples that cannot be handled by the original monotonic abstraction approach  ...  The counterexample analyzer (Algorithm 2) checks a counterexample and extracts a "Safety Zone" from the counterexample if it is spurious.  ... 
doi:10.1007/978-3-642-15375-4_7 fatcat:eebqhyi6lrgctlcmwb7j5jlucq

Inferring specifications to detect errors in code

Mana Taghdiri, Daniel Jackson
2006 Automated Software Engineering : An International Journal  
A new static program analysis method for checking structural properties of code is proposed. The user need only provide a property to check; no further annotations are required.  ...  This abstraction is then iteratively refined in response to spurious counterexamples.  ...  This material is based upon work supported by the National Science Foundation under Grant No. 0086154 and Grant No. 0325283.  ... 
doi:10.1007/s10515-006-0005-x fatcat:thstubhyybhkhea6kzjab3iv44

Optimizations for Compiling Declarative Models into Boolean Formulas [chapter]

Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin Rinard
2005 Lecture Notes in Computer Science  
These techniques are inspired by similar techniques from the field of optimizing compilers, suggesting the potential presence of underlying connections between optimization problems from two very different  ...  This paper presents our experience using several mechanical techniques that enable the Alloy Analyzer to generate optimized SAT formulas from first-order logic formulas.  ...  The most commonly factored out expressions were those that were based on transitive closure. Indeed, loop unrollings also involved formulas that used (quantified expressions with) transitive closure.  ... 
doi:10.1007/11499107_14 fatcat:44th3nujtnc7jnm6xgfl4bsssy

Choreographic Development of Message-Passing Applications [chapter]

Alex Coto, Roberto Guanciale, Emilio Tuosto
2020 Lecture Notes in Computer Science  
Unlike in orchestration-based coordination, there is no special component directing the execution.  ...  In the bottom-up approach, one can extract the local view from existing components, check for their compatibility, and generate a global view.  ...  It is similar to CC2-POM barred that the closure set is built by checking all the prefixes of the traces of the pomsets.  ... 
doi:10.1007/978-3-030-50029-0_2 fatcat:5hclbo55p5betpw6wqwensa4nm

Formal Verification for C Program

Junyan Qian, Baowen Xu
2007 Informatica  
The approach eliminates unneeded variables using program slicing technique, and then automatically extracts an initial abstract model from C source code using predicate abstraction and theorem proving.  ...  Iterative abstraction refinement has emerged in the last few years as the leading approach to software model checking.  ...  Fortunately, applying mathematically abstraction methods might extract a reduced model from a program which makes model checking feasible.  ... 
doi:10.15388/informatica.2007.178 fatcat:skgunlt25vekjbufody6orzufe

Table of contents

2019 2019 IEEE/ACM 11th International Workshop on Modelling in Software Engineering (MiSE)  
Counterexamples from Transitive-Closure-Based Model Checking 47 Mitchell Kember (University of Waterloo), Lynn Tran (University of Waterloo), George Gao (University of Waterloo), and Nancy Day (University  ...  Teresinha Vaccare Braga (University of Sao Paulo) Generic Navigation of Model-Based Development Artefacts 35 Hyacinth Ali (McGill University), Gunter Mussbacher (McGill University), and Jörg Kienzle (  ... 
doi:10.1109/mise.2019.00004 fatcat:skc756obsndvbdyr2mmbpvvhty

Dependability Engineering of Silent Self-stabilizing Systems [chapter]

Abhishek Dhama, Oliver Theel, Pepijn Crouzen, Holger Hermanns, Ralf Wimmer, Bernd Becker
2009 Lecture Notes in Computer Science  
A heuristics-based method is presented to analyze counterexamples returned by a probabilistic model checker in case the system under investigation does not exhibit the desired degree of dependability.  ...  It is also shown how to derive models that are suitable for probabilistic model checking in order to determine those dependability metrics.  ...  Consider a path that reaches state s k from state s i in two steps. s i s j s k 1 1 Such a path can be extracted from a MDP-based model by choosing a specific scheduler.  ... 
doi:10.1007/978-3-642-05118-0_17 fatcat:ibuxgwq3tnecxigdgvremi3nxy
« Previous Showing results 1 — 15 out of 2,738 results