Information and Computation
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Timing verification by successive approximation
Information and Computation
IEEE Spectrum
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
V-COLLIDE: accelerated collision detection for VRML
VRML '97 Proceedings of the second symposium on Virtual reality modeling language
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
A Compositional Proof of a Real-Time Mutual Exclusion Protocol
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Verification of hybrid systems based on counterexample-guided abstraction refinement
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Hybrid systems: from verification to falsification by combining motion planning and discrete search
Formal Methods in System Design
ACM Computing Surveys (CSUR)
Computing Reachable States for Nonlinear Biological Models
CMSB '09 Proceedings of the 7th International Conference on Computational Methods in Systems Biology
Reachability for linear hybrid automata using iterative relaxation abstraction
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Symbolic model checking of hybrid systems using template polyhedra
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Computing reachable states for nonlinear biological models
Theoretical Computer Science
Proceedings of the 14th international conference on Hybrid systems: computation and control
Theoretical Computer Science
Towards temporal verification of emergent behaviours in swarm robotic systems
TAROS'11 Proceedings of the 12th Annual conference on Towards autonomous robotic systems
A hierarchical approach for the synthesis of stabilizing controllers for hybrid systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Template-Based unbounded time verification of affine hybrid automata
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Towards temporal verification of swarm robotic systems
Robotics and Autonomous Systems
Model-Based static code analysis for MATLAB models
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
An approximation algorithm for box abstraction of transition systems on real state spaces
Formal Methods in System Design
| Hi-index | 0.00 |
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state systems, and has been recently shown to enhance the effectiveness of the teachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the verifier performs an on-the-fly search of the finite discrete quotient whose states correspond to the truth assignments to the input predicates. The success of this approach depends on the choice of the predicates used for abstraction. In this paper, we focus on identifying these predicates automatically by analyzing spurious counterexamples generated by the search in the abstract state-space. We present the basic techniques for discovering new predicates that will rule out closely related spurious counterexamples, optimizations of these techniques, implementation of these in the verification tool, and case studies demonstrating the promise of the approach.