A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets - Archive ouverte HAL
Article Dans Une Revue Computer Languages, Systems and Structures Année : 2017

A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets

Résumé

This paper studies sound proof rules for checking positive invariance of algebraic and semi-algebraic sets, that is, sets satisfying polynomial equalities and those satisfying finite boolean combinations of polynomial equalities and inequalities, under the flow of polynomial ordinary differential equations. Problems of this nature arise in formal verification of continuous and hybrid dynamical systems, where there is an increasing need for methods to expedite formal proofs. We study the trade-off between proof rule generality and practical performance and evaluate our theoretical observations on a set of benchmarks. The relationship between increased deductive power and running time performance of the proof rules is far from obvious; we discuss and illustrate certain classes of problems where this relationship is interesting.
Fichier principal
Vignette du fichier
root.pdf (938.71 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01232288 , version 1 (23-11-2015)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Khalil Ghorbal, Andrew Sogokon, André Platzer. A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets. Computer Languages, Systems and Structures, 2017, Special issue on the 16th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2015), 47 (1), pp.19-43. ⟨10.1016/j.cl.2015.11.003⟩. ⟨hal-01232288⟩
573 Consultations
968 Téléchargements

Altmetric

Partager

More