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

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of ACM on programming languages Vol. 7; no. POPL; pp. 2111 - 2140
Main Authors: Unno, Hiroshi, Terauchi, Tachio, Gu, Yu, Koskinen, Eric
Format: Journal Article
Language:English
Published: New York, NY, USA ACM 09.01.2023
Subjects:
ISSN:2475-1421, 2475-1421
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first