Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
Theoretical Computer Science
A classical mind
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A formal description of hybrid systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Symbolic Reachability Computation for Families of Linear Vector Fields
Journal of Symbolic Computation
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
Decidability of Hybrid Systems with Rectangular Differential Inclusion
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
QEPCAD B: a program for computing with semi-algebraic sets using CADs
ACM SIGSAM Bulletin
DISCOVERER: a tool for solving semi-algebraic systems
ACM Communications in Computer Algebra
Computing Differential Invariants of Hybrid Systems as Fixedpoints
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Constraint-Based Approach for Analysis of Hybrid Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Synthesizing Switching Logic Using Constraint Solving
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Differential-algebraic Dynamic Logic for Differential-algebraic Programs
Journal of Logic and Computation
Automatic invariant generation for hybrid systems using ideal fixed points
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Generating polynomial invariants for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Survey paper: Set invariance in control
Automatica (Journal of IFAC)
An assume/guarantee based compositional calculus for hybrid CSP
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Complementary methodologies for developing hybrid systems with event-b
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Automating relatively complete verification of higher-order functional programs
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesizing switching controllers for hybrid systems by generating invariants
Theories of Programming and Formal Methods
Verifying simulink diagrams via a hybrid hoare logic prover
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
In this paper, we consider an extended concept of invariant for polynomial dynamical systems (PDSs) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAIs) for such PDSs. The main idea is encoding relevant dynamical properties as conditions on the high order Lie derivatives of polynomials occurring in the SAI. A direct consequence of this criterion is a relatively complete method of SAI generation based on template assumption and semi-algebraic constraint solving. Relative completeness means if there is an SAI in the form of a predefined template, then our method can indeed find one.