Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification

We present a novel approach to deciding the validity of formulas in first-order fixpoint logic with background theories and arbitrarily nested inductive and co-inductive predicates defining least and greatest fixpoints. Our approach is constraint-based, and reduces the validity checking problem of t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of ACM on programming languages Jg. 7; H. POPL; S. 2111 - 2140
Hauptverfasser:	Unno, Hiroshi, Terauchi, Tachio, Gu, Yu, Koskinen, Eric
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY, USA ACM 09.01.2023
Schlagworte:	Automated reasoning Constraint and logic programming Logic and verification Program verification Theory of computation fixpoint logics constraint logic programming temporal verification
ISSN:	2475-1421, 2475-1421
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!