Home
News
People
Publications
Seminar
Courses
Events
Vacancies
Contact
Pulp Fictions
Light
Dark
Automatic
verification
Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and …
Ting Gan
,
Liyun Dai
,
Bican Xia
,
Naijun Zhan
,
Deepak Kapur
,
Mingshuai Chen
PDF
Cite
Code
Slides
DOI
Decidability of the Reachability for a Family of Linear Vector Fields
The reachability problem is one of the most important issues in the verification of hybrid systems. Computing the reachable sets of …
Ting Gan
,
Mingshuai Chen
,
Liyun Dai
,
Bican Xia
,
Naijun Zhan
PDF
Cite
Code
Slides
DOI
«
Cite
×