A term rewriting technique for decision graphs

DOI10.1016/J.ENTCS.2009.10.016MaRDI QIDQ5170280zbMATH OpenOpenAlexFDO

Authors Bahareh Badban

Publication date 23 July 2014

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2009.10.016

zbMATH Keywords

decision procedurefirst-order logicterm rewrite systemverification

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Zero, successor and equality in BDDs
• A rewriting approach to binary decision diagrams
• scientific article; zbMATH DE number 1696764
• scientific article; zbMATH DE number 1980926
• Binary decision diagrams for first-order predicate logic.

Cites work

• A Computing Procedure for Quantification Theory
• A symbolic approach to predicate abstraction.
• BDD based procedures for a theory of equality with uninterpreted functions
• Computer Aided Verification
• Fast Decision Procedures Based on Congruence Closure
• scientific article; zbMATH DE number 1696764 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 1903355 (Why is no real title available?)
• scientific article; zbMATH DE number 2102726 (Why is no real title available?)
• Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
• Solvable cases of the decision problem
• Zero, successor and equality in BDDs

Cited in

(1)

• Zero, successor and equality in BDDs

This page was built for publication: A term rewriting technique for decision graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170280)