Work

Validating SMT solvers via semantic fusion

Year: 2020

Type: conference-paper

Abstract: We introduce Semantic Fusion, a general, effective methodology for validating Satisfiability Modulo Theory (SMT) solvers. Our key idea is to fuse two existing equisatisfiable (i.e., both satisfiable or unsatisfiable) formulas into a new formula that combines the structures of its ancestors in a novel manner and preserves the satisfiability by construction. This fused formula is then used for validating SMT solvers.

Source: ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

DOI: 10.1145/3385412.3385985

Authors: Dominik Winterer, Chengyu Zhang, Zhendong Su

Institutions: ETH Zurich, East China Normal University

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W3034071395

FWCI: 10.3

Cites: 37

Cited by: 82

Related to: 10