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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of ACM on programming languages Ročník 7; číslo POPL; s. 2111 - 2140
Hlavní autori:	Unno, Hiroshi, Terauchi, Tachio, Gu, Yu, Koskinen, Eric
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 09.01.2023
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!