Filters








8,538 Hits in 5.3 sec

Counter-Example Guided Predicate Abstraction of Hybrid Systems [chapter]

Rajeev Alur, Thao Dang, Franjo Ivančić
Lecture Notes in Computer Science  
We present the basic techniques for discovering new predicates that will rule out closely related spurious counter-examples, optimizations of these techniques, implementation of these in the verification  ...  computation techniques for hybrid systems.  ...  Counter-example guided abstraction refinement (CEGAR) for hybrid systems is being independently explored by the hybrid systems group at CMU [14] .  ... 
doi:10.1007/3-540-36577-x_15 fatcat:udq5f3kix5fbzn3rocx64he3wi

Counterexample-guided predicate abstraction of hybrid systems

Rajeev Alur, Thao Dang, Franjo Ivančić
2006 Theoretical Computer Science  
We present the basic techniques for discovering new predicates that will rule out closely related spurious counter-examples, optimizations of these techniques, implementation of these in the verification  ...  computation techniques for hybrid systems.  ...  Counter-example guided abstraction refinement (CEGAR) for hybrid systems is being independently explored by the hybrid systems group at CMU [14] .  ... 
doi:10.1016/j.tcs.2005.11.026 fatcat:fykkoyrbyza2hhqrsxje2o74xa

Partial Predicate Abstraction and Counter-Example Guided Refinement [article]

Tuba Yavuz
2017 arXiv   pre-print
In this paper we present a counter-example guided abstraction and approximation refinement (CEGAAR) technique for partial predicate abstraction, which combines predicate abstraction and fixpoint approximations  ...  The proposed approach incrementally considers growing sets of predicates for abstraction refinement.  ...  Counter-Example Guided Abstraction and Approximation Refinement In this section, we present a counter-example guided abstraction and approximation refinement technique for partial predicate abstraction  ... 
arXiv:1712.01734v1 fatcat:cknqqeht2vcyjo4o7upb363xgm

Heuristics for Selecting Predicates for Partial Predicate Abstraction [article]

Tuba Yavuz, Chelsea Metcalf
2017 arXiv   pre-print
In this paper, we consider systems modeled using linear integer arithmetic and investigate an alternative approach to counter-example guided abstraction refinement.  ...  In this paper we consider the problem of configuring partial predicate abstraction that combines two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint  ...  Counter-example Guided Abstraction Refinement for Partial Abstraction A common approach for dealing with imprecision in predicate abstraction is Counter-Example Guided Abstraction Refinement (CEGAR).  ... 
arXiv:1801.02457v1 fatcat:qe47cdrq5vhrbpbqwapzzqzu7m

Hybrid cegar: combining variable hiding and predicate abstraction

Chao Wang, Hyondeuk Kim, Aarti Gupta
2007 Computer-Aided Design (ICCAD), IEEE International Conference on  
In this paper, we propose a hybrid abstraction method that allows both visible variables and predicates to take advantages of their relative strengths.  ...  Variable hiding and predicate abstraction are two popular abstraction methods to obtain simplified models for model checking.  ...  Our implementations of both predicate abstraction and hybrid abstraction completed this example.  ... 
doi:10.1109/iccad.2007.4397283 dblp:conf/iccad/WangKG07 fatcat:d4eqcgiobzgbjcwuku7fdpa5hu

TACAS 2003 Special Issue—Preface

Hubert Garavel, John Hatcliff
2006 Theoretical Computer Science  
In their paper "Counter-Example Guided Predicate Abstraction of Hybrid Systems", Alur, Dang, and Ivančić show how to adapt well-known concepts used in predicate abstraction for discrete systems to hybrid  ...  Specifically, they focus on identifying predicates automatically by analyzing spurious counter-examples generated by the search in the abstract state-space.  ...  Conclusion We would like to thank heartily the referees for their expertise and their commitment to the quality of the present special issue.  ... 
doi:10.1016/j.tcs.2005.11.014 fatcat:wayjlqolubgvpkwhidau222pha

Predicate abstraction for reachability analysis of hybrid systems

Rajeev Alur, Thao Dang, Franjo Ivančić
2006 ACM Transactions on Embedded Computing Systems  
We also address the completeness of our abstractionbased verification strategy by showing that predicate abstraction of hybrid systems can be used to prove bounded safety.  ...  This paper presents algorithms and tools for reachability analysis of hybrid systems by combining the notion of predicate abstraction with recent techniques for approximating the set of reachable states  ...  Since the guided search is supposed to speed up the discovery of a counter-example, it is counter-productive to spend too much time in computing this guiding measure.  ... 
doi:10.1145/1132357.1132363 fatcat:vrnwjfoxvzhlhag6vaka4rbmcm

Finding feasible abstract counter-examples

Corina S. Păsăreanu, Matthew B. Dwyer, Willem Visser
2002 International Journal on Software Tools for Technology Transfer (STTT)  
Thus, while abstraction enables efficient model checking it also threatens the usefulness of model checking as a defect detection tool, since it may be difficult to determine whether a counter-example  ...  We have explored several strategies for addressing this problem by extending an explicit-state model checker, Java PathFinder (JPF), to search for and analyze counter-examples in the presence of abstractions  ...  JPF can also perform simulation of the concrete program guided by an abstract counter-example; if a corresponding concrete program trace exists then the counter-example is feasible.  ... 
doi:10.1007/s10009-002-0088-z fatcat:hgvhe74r55aj7owvpdyk7vw7km

Abstraction Based Model-Checking of Stability of Hybrid Systems [chapter]

Pavithra Prabhakar, Miriam Garcia Soto
2013 Lecture Notes in Computer Science  
We propose a new abstract data structure, namely, finite weighted graphs, and a modification of the predicate abstraction based on the faces in the system description.  ...  In this paper, we present a novel abstraction technique and a model-checking algorithm for verifying Lyapunov and asymptotic stability of a class of hybrid systems called piecewise constant derivatives  ...  One interesting future direction is to develop a counter-example guided abstraction refinement framework using the abstract counter-example returned in the model-checking phase.  ... 
doi:10.1007/978-3-642-39799-8_20 fatcat:mit7ptmvsrgtdpvnjnly6a4f3q

Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems [chapter]

Pavithra Prabhakar, Miriam García Soto
2015 Lecture Notes in Computer Science  
In another direction, a quantitative version of classical predicate abstraction has been proposed for approximation based stability analysis of certain classes of hybrid systems.  ...  We investigate the formal connections between "quantitative predicate abstractions" for stability analysis of hybrid systems and "continuous simulation relations".  ...  The research leading to the results in the paper has received funding from the People Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under REA grant  ... 
doi:10.1007/978-3-662-46081-8_18 fatcat:2oky6lrgjff6nhqzubqxcep4ku

Hierarchical Hybrid Planning in a Mobile Service Robot [chapter]

Sebastian Stock, Masoumeh Mansouri, Federico Pecora, Joachim Hertzberg
2015 Lecture Notes in Computer Science  
The resulting online planner, CHIMP, is integrated in a plan-based robot control system and is demonstrated to physically guide a PR2 robot.  ...  We demonstrate the straightforward integration of different kinds of knowledge for causal, temporal and resource knowledge as well as knowledge provided by an external path planner.  ...  Approach A meta-CSP [8] is a high-level CSP representing a hybrid problem in different levels of abstraction.  ... 
doi:10.1007/978-3-319-24489-1_28 fatcat:tcdqdkx7e5cw3nms6q52qyfuwq

Combining Predicate Abstraction with Fixpoint Approximations [chapter]

Tuba Yavuz
2016 Lecture Notes in Computer Science  
Using a carefully crafted model of Airport Ground Network Control, we show that when predicate abstraction in a CEGAR loop fails to verify temporal logic properties of an infinite-state transition system  ...  In this paper we consider combining two techniques that have been effective in analyzing infinite-state systems: predicate abstraction and fixpoint approximations.  ...  Since it is difficult to come up with the right set of predicates that would yield a precise analysis, predicate abstraction has been combined with the counter-example guided abstraction refinement (CEGAR  ... 
doi:10.1007/978-3-319-41591-8_8 fatcat:y23snrmqbjgitnujahlyoqf5bi

Safety verification for linear systems

Parasara Sridhar Duggirala, Ashish Tiwari
2013 2013 Proceedings of the International Conference on Embedded Software (EMSOFT)  
We thus get a counterexample guided abstraction refinement (CEGAR) procedure for the unconstrained safety verification of linear systems.  ...  Our new procedure performs abstraction-refinement on the initial and unsafe region, and not on the system itself.  ...  This methodology is nicknamed counter-example guided abstraction refinement (CEGAR).  ... 
doi:10.1109/emsoft.2013.6658585 dblp:conf/emsoft/DuggiralaT13 fatcat:r42i4jchdbfphjep757m5f5yme

SMT(CLU): A Step toward Scalability in System Verification

Hossein Sheini, Karem Sakallah
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
We describe a SAT-based decision method for the underlying logic in many formal verification problems; i.e. the counter arithmetic logic with lambda expressions and uninterpreted functions (CLU).  ...  This logic is well suited for equivalence checking of two versions of a hardware design or the input and output of a compiler and has been recently utilized in several model checkers.  ...  Recent advances in this field include techniques to exploit predicate abstraction, parameterized designs, BDDs, propositional satisfiability, and counter-example-guided abstraction refinement (CEGAR).  ... 
doi:10.1109/iccad.2006.320088 fatcat:x3skvgucizgznloezfycesxkfm

SMT(CLU)

Hossein M. Sheini, Karem A. Sakallah
2006 Computer-Aided Design (ICCAD), IEEE International Conference on  
We describe a SAT-based decision method for the underlying logic in many formal verification problems; i.e. the counter arithmetic logic with lambda expressions and uninterpreted functions (CLU).  ...  This logic is well suited for equivalence checking of two versions of a hardware design or the input and output of a compiler and has been recently utilized in several model checkers.  ...  Recent advances in this field include techniques to exploit predicate abstraction, parameterized designs, BDDs, propositional satisfiability, and counter-example-guided abstraction refinement (CEGAR).  ... 
doi:10.1145/1233501.1233680 dblp:conf/iccad/SheiniS06 fatcat:uk7m5yp7gfepvioxekouu3gdyy
« Previous Showing results 1 — 15 out of 8,538 results