SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.
Pointer Kleene Algebra
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 2roles
background 1polarities
support 1representative citing papers
Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.
citing papers explorer
-
Computing Witnesses Using the SCAN Algorithm
SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.
-
Relation-Algebraic Verification of Disjoint-Set Forests
Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.