[1]

Biere A, Cimatti A, Clarke E, Fujita M, Zhu Y. Symbolic model checking using SAT procedures instead of BDDs. In *Proc. DAC*, New Orleans, LA, USA, June 21–25, 1999, pp.317–320.

[2]

Biere A, Cimatti A, Clarke E, Zhu Y. Symbolic model checking without BDDs. In *Proc. TACAS*, Amsterdam, The Netherlands, March 22–28, 1999, pp.193–207.

[3]

Penczek W, WoŸna B, Zbrzezny A. Bounded model checking for the universal fragment of CTL.

*Fundamenta Informaticae*, 2002, 51(1/2): 135–156.

MATHMathSciNet[4]

Biere A, Clarke E, Raimi R, Zhu Y. Verifying safety properties of a Power PC microprocessor using symbolic model checking without BDDs. In *Proc. CAV*, Trento, Italy, July 6–10, 1999, pp.60–71.

[5]

Copty F, Fix L, Fraer R, Giunchiglia E, Kamhi G, Tacchella A, Vardi M Y. Benefits of bounded model checking at an industrial setting. In *Proc. CAV*, Paris, France, July 18–22, 2001, pp.436–453.

[6]

Strichman O. Accelerating bounded model checking of safety properties.

*Formal Methods in System Design*, 2004, 24(1): 5–24.

MATHCrossRef[7]

Jain H, Bartzis C, Clarke E M. Satisfiability checking of non-clausal formulas using general matings. In *Proc. SAT*, Seattle, WA, USA, August 12–15, 2006, pp.75–89.

[8]

Emerson E A, Clarke E M. Using branching-time temporal logics to synthesize synchronization skeletons.

*Science of Computer Programming*, 1982, 2(3): 241–266.

MATHCrossRef[9]

Clarke E M, Grunberg O, Peled D A. Model Checking. Cambridge, Massachusetts, London, England: The MIT Press, 1999.

[10]

Buccafurri F, Eiter T, Gottlob G, Leone N. On ACTL formulae having linear counterexamples.

*Journal of Computer and System Sciences*, 2001, 62(3): 463–515.

MATHCrossRefMathSciNet[11]

Pieprzyk J, Cheng Xin Qu. Rotation-symmetric functions and fast hashing. In *Proc. ACISP*, Brisbane, Queensland, Australia, July 1998, pp.169–180.

[12]

Eén N, Sörensson N. An extensible SAT-solver. In *Proc. SAT*, Santa Margherita Ligure, Italy, May 5–8, 2003, pp.502–518.

[13]

Eén N, Sörensson N. Effective preprocessing in SAT through variable and clause elimination. In *Proc. SAT*, St. Andrews, UK, June 19–23, 2005, pp.61–75.

[14]

Eén N, Sörensson N. Temporal induction by incremental SAT solving.

*Electronic Notes in Theoretical Computer Science*, 2003, 89(4): 543–560.

CrossRef[15]

Xu Y, Chen W, Xu L, Zhang W. Evaluation of SAT-based bounded model checking of ACTL properties. In *Proc. TASE*, Shanghai, China, June 5–8, 2007, pp.339–348.

[16]

Zhang W. Verification of ACTL properties by bounded model checking. In *Proc. EUROCAST*, Gran Canaria, Spain, February 12–16, 2007, pp.199–202.

[17]

Peled D A. Software Reliability Methods. New York: Springer, USA, 2001.

MATH[18]

Zhou C, Ding D. Improved SAT based bounded model checking. In *Proc. TAMC*, Beijing, China, May 15–20, 2006, pp.611–620.

[19]

Penczek W, WoŸna B, Zbrzezny A. Towards bounded model checking for the universal fragment of TCTL. In *Proc. FTRTFT*, Oldenburg, Germany, September 9–12, 2002, pp.265–290.

[20]

Audemard G, Cimatti A, Kornilowicz A, Sebastiani R. Bounded model checking for timed systems. In *Proc. FORTE*, Houston, Texas, USA, November 11–14, 2002, pp.243–259.

[21]

Markey N, Schnoebelen P. Symbolic model checking for simply-timed systems. In *Proc. FTRTFT*, Grenoble, France, September 22–24, 2004, pp.102–117.

[22]

Sheini H M, Sakallah K A. From propositional satisfiability to satisfiability modulo theories. In *Proc. SAT*, Seattle, WA, USA, August 12–15, 2006, pp.1–9.