Introduces parallelizable, theory-agnostic methods for complete theory-lemma enumeration in SMT that scale better than classic eager encodings on complex instances.
IEEE Transactions on Computers35(8), 677–691 (Aug 1986)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
ClassInvGen co-generates class invariants and tests with LLMs to outperform pure LLM generation and Daikon on C++ data structures.
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
citing papers explorer
-
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
Introduces parallelizable, theory-agnostic methods for complete theory-lemma enumeration in SMT that scale better than classic eager encodings on complex instances.
-
Fast Obligation Translation and Synthesis
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
-
ClassInvGen: Class Invariant Synthesis using Large Language Models
ClassInvGen co-generates class invariants and tests with LLMs to outperform pure LLM generation and Daikon on C++ data structures.
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.