E-matching for Fun and Profit

Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient algorithms for solving the E-matching problem are presented an...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in theoretical computer science Vol. 198; no. 2; pp. 19 - 35
Main Authors Moskal, Michał, Łopuszański, Jakub, Kiniry, Joseph R.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 06.05.2008
Subjects
E-matching
quantifier instantiation
SMT
E-matching
quantifier instantiation
SMT
Online AccessGet full text

Cover

More Information
Summary:Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient algorithms for solving the E-matching problem are presented and compared to a well-known algorithm described in the literature.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2008.04.078