A decision procedure for equality logic with uninterpreted functions

O. Tveretina

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    2 Citaten (Scopus)


    The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced. Since it is based on the DPLL method, the procedure can adopt its heuristics. Therefore the procedure can be used as a basis for efficient implementations of satisfiability checkers for EUF. A part of the introduced method is a technique for reducing the size of formulas, which can also be used as a preprocessing step in other approaches for checking satisfiability of EUF formulas.
    Originele taal-2Engels
    TitelArtificial Intelligence and Symbolic Computation (Proceedings 7th International Conference, AISC 2004, Linz, Austria, September 22-24, 2004)
    RedacteurenB. Buchberger, J.A. Campbell
    Plaats van productieBerlin
    ISBN van geprinte versie3-540-23212-5
    StatusGepubliceerd - 2004

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743

    Citeer dit