Synthesizing ReLU neural networks with two hidden layers as barrier certificates for hybrid systems

Q Zhao, X Chen, Y Zhang, M Sha, Z Yang… - Proceedings of the 24th …, 2021 - dl.acm.org
Barrier certificates provide safety guarantees for hybrid systems. In this paper, we propose a
novel approach to synthesizing neural networks as barrier certificates. Candidate networks …

[PDF][PDF] Solving exists/forall problems with yices

B Dutertre - Workshop on satisfiability modulo theories, 2015 - yices.csl.sri.com
Solving Exists/Forall Problems With Yices Page 1 Solving Exists/Forall Problems With Yices
Extended Abstract Bruno Dutertre Computer Science Laboratory SRI International Bruno.Dutertre@sri.com …

New concepts for real quantifier elimination by virtual substitution

M Košta - 2016 - publikationen.sulb.uni-saarland.de
Quantifier elimination methods for real closed fields are an intensively studied subject from
both theoretical and practical points of view. This thesis studies quantifier elimination based …

Thirty years of virtual substitution: Foundations, techniques, applications

T Sturm - Proceedings of the 2018 ACM International …, 2018 - dl.acm.org
In 1988, Weispfenning published a seminal paper introducing a substitution technique for
quantifier elimination in the linear theories of ordered and valued fields. The original focus …

The DEWCAD project: pushing back the doubly exponential wall of cylindrical algebraic decomposition

R Bradford, JH Davenport, M England… - … in Computer Algebra, 2022 - dl.acm.org
This abstract seeks to introduce the ISSAC community to the DEWCAD project, which is
based at Coventry University and the University of Bath, in the United Kingdom. The project …

Hybridsal relational abstracter

A Tiwari - … Aided Verification: 24th International Conference, CAV …, 2012 - Springer
This paper describes the HybridSAL relational abstracter–a tool for verifying continuous and
hybrid dynamical systems. The input to the tool is a model of a hybrid dynamical system and …

On the limits of the classical approach to cost analysis

DE Alonso-Blas, S Genaim - International Static Analysis Symposium, 2012 - Springer
The classical approach to static cost analysis is based on transforming a given program into
cost relations and solving them into closed-form upper-bounds. It is known that for some …

A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications

T Sturm - Mathematics in Computer Science, 2017 - Springer
Effective quantifier elimination procedures for first-order theories provide a powerful tool for
generically solving a wide range of problems based on logical specifications. In contrast to …

Faster one block quantifier elimination for regular polynomial systems of equations

HP Le, M Safey El Din - Proceedings of the 2021 on International …, 2021 - dl.acm.org
Quantifier elimination over the reals is a central problem in computational real algebraic
geometry, polynomial system solving and symbolic computation. Given a semi-algebraic …

Application of LaSalle's invariance principle on polynomial differential equations using quantifier elimination

D Gerbet, K Röbenack - IEEE Transactions on Automatic …, 2021 - ieeexplore.ieee.org
LaSalle's invariance principle is a commonly used extension of Lyapunov's second method
to study asymptotic stability of nonlinear systems. If the system can be written in polynomial …