Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMATH Open1156.68481OpenAlexW2494705596MaRDI QIDQ5492907FDOQ5492907

Authors: Jaco van de Pol, Olga Tveretina 

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Recommendations

• Artificial Intelligence and Symbolic Computation
• Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
• BDD based procedures for a theory of equality with uninterpreted functions
• scientific article; zbMATH DE number 1696764
• BDDs -- design, analysis, complexity, and applications.

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cited In (2)

• Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
• EufDPLL -- a tool to check satisfiability of equality logic formulas

This page was built for publication: Mathematical Foundations of Computer Science 2005

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