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
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
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Progress on reachability analysis of hybrid systems using predicate abstraction
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Localization and register sharing for predicate abstraction
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Refining abstractions of hybrid systems using counterexample fragments
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Taylor approximation for hybrid systems
Information and Computation
Bisimilar Finite Abstractions of Interconnected Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Modular Development of Hybrid Systems for Verification in Coq
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Symbolic analysis for improving simulation coverage of Simulink/Stateflow models
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Discrete-State Abstractions of Nonlinear Systems Using Multi-resolution Quantizer
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Thermal analysis of multiprocessor SoC applications by simulation and verification
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Analysis and control of hybrid systems with parameter uncertainty based on interval methods
ACC'09 Proceedings of the 2009 conference on American Control Conference
Language-based abstraction refinement for hybrid system verification
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Automatic abstraction refinement for timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Measurability and safety verification for stochastic hybrid systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Formal verification of hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Incremental computation of succinct abstractions for hybrid systems
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Synthesis of quantized feedback control software for discrete time linear hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Finite abstractions for hybrid systems with stable continuous dynamics
Discrete Event Dynamic Systems
Model checking of hybrid systems using shallow synchronization
FMOODS'10/FORTE'10 Proceedings of the 12th IFIP WG 6.1 international conference and 30th IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Automated machine-checked hybrid system safety proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Heterogeneous verification of cyber-physical systems using behavior relations
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
The Complete Proof Theory of Hybrid Systems
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On model based synthesis of embedded control software
Proceedings of the tenth ACM international conference on Embedded software
Compositional heterogeneous abstraction
Proceedings of the 16th international conference on Hybrid systems: computation and control
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
Reachability analysis of nonlinear analog circuits through iterative reachable set reduction
Proceedings of the Conference on Design, Automation and Test in Europe
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Pre-orders for reasoning about stability properties with respect to input of hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Model-based synthesis of control software from system-level formal specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
| Hi-index | 0.00 |
Embedded systems are increasingly finding their way into a growing range of physical devices. These embedded systems often consist of a collection of software threads interacting concurrently with each other and with a physical, continuous environment. While continuous dynamics have been well studied in control theory, and discrete and distributed systems have been investigated in computer science, the combination of the two complexities leads us to the recent research on hybrid systems. This paper addresses the formal analysis of such hybrid systems. Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state discrete programs. 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 of linear systems using polyhedra. Given a hybrid system and a set of predicates, we consider the finite discrete quotient whose states correspond to all possible truth assignments to the input predicates. The tool performs an on-the-fly exploration of the abstract system. We present the basic techniques for guided search in the abstract state-space, optimizations of these techniques, implementation of these in our verifier, and case studies demonstrating the promise of the approach. We also address the completeness of our abstraction-based verification strategy by showing that predicate abstraction of hybrid systems can be used to prove bounded safety.