Work

Symbolic Reachability Analysis Based on SAT-Solvers

Year: 2000

Type: conference-paper

Source: Lecture notes in computer science

Parent work: Tools and Algorithms for the Construction and Analysis of Systems: 6th International Conference, TACAS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings

DOI: 10.1007/3-540-46419-0_28

Authors: Parosh Aziz Abdulla, Per Bjesse, Niklas Eén

Institutions: Uppsala University, Prover Technology (Sweden), Chalmers University of Technology

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1494481937

FWCI: 10.59

Cites: 26

Cited by: 182

Related to: 10