Bounded Model Checking Using Satisfiability Solving
By Edmund M. Clarke, Armin Biere, R. Raimi, Yunshan Zhu. Formal Methods Syst. Des., 2001
865 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Software
View Paper: https://www.semanticscholar.org/paper/e9c2c46ae00fc1a7db08c1b5e8e1752140c157e8
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Jakob Rehof
- Shaz Qadeer
- Joost-Pieter Katoen
- Pushmeet Kohli
- Nate Kushman
- Daniel Tarlow
- Marc Brockschmidt
- Jonathan Taylor
In Software
- Pushmeet Kohli
- Rishabh Singh
- Marc Brockschmidt
- Alexander L. Gaunt
- Daniel Tarlow
- Shaz Qadeer
- Joost-Pieter Katoen
- Nate Kushman
Citations in the corpus
- TerpreT: A Probabilistic Programming Language for Program Induction (2016, background): “(Clarke et al., 2001)) which for a given program, search for an input that shows some behavior.”
- Context-Bounded Model Checking of Concurrent Software (2005, methodology): “The notion of bounded-depth model checking, popular in hardware verification, can also be used for software verification [7].”
- Principles of model checking (2008, methodology): “[84], and the use of tree-like counterexamples as opposed to linear ones by Clarke [93].”