Range allocation for equivalence logic

DOI10.1007/3-540-45294-X_27MaRDI QIDQ4474229zbMATH OpenFDO

Authors Amir Pnueli, Yoav Rodeh, O. Shtrichman

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2245/22450317.htm

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Finite instantiations in equivalence logic with uninterpreted functions
• Yet another decision procedure for equality logic
• Building small equality graphs for deciding equality logic with uninterpreted functions
• Range allocation for separation logic
• Deciding equality formulas by small domains instantiations

Cited in

(5)

• Building small equality graphs for deciding equality logic with uninterpreted functions
• Finite instantiations in equivalence logic with uninterpreted functions
• EufDPLL -- a tool to check satisfiability of equality logic formulas
• Range allocation for separation logic
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

This page was built for publication: Range allocation for equivalence logic

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