A New Approach to Nonlinear Invariants for Hybrid Systems Based on the Citing Instances Method
暂无分享,去创建一个
[1] Sriram Sankaranarayanan,et al. Validating numerical semidefinite programming solvers for polynomial invariants , 2018, Formal Methods Syst. Des..
[2] Lu Yang,et al. The Parallel Numerical Method of Mechanical Theorem Proving , 1990, Theor. Comput. Sci..
[3] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[4] Volker Weispfenning,et al. Comprehensive Gröbner Bases , 1992, J. Symb. Comput..
[5] Henny B. Sipma,et al. Constructing invariants for hybrid systems , 2008, Formal Methods Syst. Des..
[6] John Lygeros,et al. Controllers for reachability specifications for hybrid systems , 1999, Autom..
[7] Giovanni Gallo,et al. Efficient algorithms and bounds for Wu-Ritt characteristic sets , 1991 .
[8] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[9] David A. Cox,et al. Ideals, Varieties, and Algorithms , 1997 .
[10] Wenjun Wu,et al. Basic principles of mechanical theorem proving in elementary geometries , 1986, Journal of Automated Reasoning.
[11] Ashish Tiwari,et al. Abstractions for hybrid systems , 2008, Formal Methods Syst. Des..
[12] WeispfenningVolker. Comprehensive Grobner bases , 1992 .
[13] Mauro Pezzè,et al. Model-driven generation of runtime checks for system properties , 2014, International Journal on Software Tools for Technology Transfer.
[14] Pravin Varaiya,et al. What's decidable about hybrid automata? , 1995, STOC '95.
[15] CacheraDavid,et al. Inference of polynomial invariants for imperative programs , 2014 .
[16] MillsteinTodd,et al. Data-driven precondition inference with learned features , 2016 .
[17] Thomas A. Henzinger,et al. The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..