REDLOG: computer algebra meets computer logic
ACM SIGSAM Bulletin
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
The Calculus of Computation: Decision Procedures with Applications to Verification
The Calculus of Computation: Decision Procedures with Applications to Verification
Abstractions for hybrid systems
Formal Methods in System Design
Differential Dynamic Logic for Hybrid Systems
Journal of Automated Reasoning
Verifying Industrial Hybrid Systems with MathSAT
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Relational abstractions for continuous and hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Formal verification of hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
HyDI: A Language for Symbolic Hybrid Systems with Discrete Interaction
SEAA '11 Proceedings of the 2011 37th EUROMICRO Conference on Software Engineering and Advanced Applications
Optimizing bounded model checking for linear hybrid systems
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems
IEEE Transactions on Robotics
Generalized property directed reachability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Software model checking via IC3
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Timed relational abstractions for sampled data control systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
HybridSAL relational abstracter
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
SMT-based scenario verification for hybrid systems
Formal Methods in System Design
| Hi-index | 0.00 |
Hybrid Systems model both discrete switches and continuous dynamics and are suitable to represent embedded systems where discrete controllers interact with a physical plant. Relational abstraction is a new approach for verifying hybrid systems. In relational abstraction, the continuous dynamics in each location of the hybrid system is abstracted by a binary relation that relates the current value of the continuous variables with all future values of the variables that are reachable after a time elapse (continuous) transition. The abstract system is an infinite-state system, which can be verified using k-induction or abstract interpretation. Existing techniques for computing relational abstractions are time-agnostic: they do not construct any relationship between the state variables and the time elapsed during the continuous evolution. Time-agnostic abstractions cannot verify timing properties. We present a technique to compute a time-aware relational abstraction for verifying (timing-related) safety properties of cyber-physical systems. We show the effectiveness of the new abstraction on several case studies on which the previous techniques fail.