Guarded equivalence predicates extracted via CTI-local methods from relational counterexamples enable PDR to complete previously timeout-prone hardware IFV proofs and reduce times by up to 10.8x on 12 benchmarks.
In: CA V ’10
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 2polarities
background 2representative citing papers
An ISA-level memory consistency model for tākō is introduced and proven sound by verifying that executions of an implementation model are permitted by the model.
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
Extends QuAK with flattening procedures that reduce nested quantitative automata to quantitative automata while preserving answers to threshold decision problems for known decidable cases.
citing papers explorer
-
Guarded Equivalence Predicates for Scalable Formal Hardware Information-Flow Verification
Guarded equivalence predicates extracted via CTI-local methods from relational counterexamples enable PDR to complete previously timeout-prone hardware IFV proofs and reduce times by up to 10.8x on 12 benchmarks.
-
t\"{a}k\={o}Formal: Enabling Robust Software for Programmable Memory Hierarchies (Extended Version)
An ISA-level memory consistency model for tākō is introduced and proven sound by verifying that executions of an implementation model are permitted by the model.
-
Infinite State Model Checking by Learning Transitive Relations
A verification technique for infinite-state systems learns transitive relations via recurrence analysis and projections to achieve finite diameter, enabling safety proofs through bounded-step reachability checks.
-
Extending QuAK with Nested Quantitative Automata
Extends QuAK with flattening procedures that reduce nested quantitative automata to quantitative automata while preserving answers to threshold decision problems for known decidable cases.