A sound and relatively complete translation of CTL* verification and synthesis problems for reactive programs into existential Horn clauses.
Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
A sound and complete prophecy-based reduction of message-passing program verification to CHC satisfiability is proposed, with a prototype implementation for Rust-like programs.
MoAT reduces LTL model checking of infinite state systems to fair termination via automata-based approach and calls KoAT/LoAT, matching state-of-the-art performance in experiments.
KoAT implements alternating modular inference of runtime and size bounds for integer programs using a portfolio of techniques and validates the approach via experimental evaluation.
citing papers explorer
-
Prophecy-Based Automated Verification of Message-Passing Programs
A sound and complete prophecy-based reduction of message-passing program verification to CHC satisfiability is proposed, with a prototype implementation for Rust-like programs.