Checking satisfiability of first-order formulas by incremental translation to SAT

Conference proceeding

Open access

Peer reviewed

Clark W Barrett, David L Dill and Aaron Stump

Lecture notes in computer science, Vol.2404, pp.236-249

CAV 2002 : computer aided verification (Copenhagen, 27-31 July 2002)

2002

DOI: 10.1007/3-540-45657-0_18

Files and links (1)

url

https://doi.org/10.1007/3-540-45657-0_18View

Published (Version of record) Open Access

Applied sciences

Computer science; control theory; systems

Exact sciences and technology

Software

Software engineering

Title: Subtitle: Checking satisfiability of first-order formulas by incremental translation to SAT
Creators: Clark W Barrett
David L Dill
Aaron Stump
Resource Type: Conference proceeding
Publication Details: Lecture notes in computer science, Vol.2404, pp.236-249
Conference: CAV 2002 : computer aided verification (Copenhagen, 27-31 July 2002)
Publisher: Springer
DOI: 10.1007/3-540-45657-0_18
ISSN: 0302-9743
eISSN: 1611-3349
Language: English
Date published: 2002
Academic Unit: Computer Science
Record Identifier: 9984259431002771

1 Record Views