8.2. מקורות באנגלית
- "An
Analysis of SAT-based Model Checking Techniques in an Industrial
Environment", Cadence Design Systems, 2005, Nina Amla, Xiaoqun Du,
Andreas Kuehlmann, Robert P. Kurshan and Kenneth L. McMillan
- "An Efficiently Checkable,
Proof-Based Formulation of Vacuity in Model Checking", 2004, Kedar
S. Namjoshi
- "Applying SAT methods in Unbounded
Symbolic Model Checking", K. L. McMillan, Cadence Berkeley Labs
- "Computational tree logic",
2006, Wikipedia.
- “CTL*”, 2008, Wikipedia.
- “Davis–Putnam algorithm”, 2009, Wikipedia.
- “DPLL algorithm”, 2009, Wikipedia.
- "Graph Algorithms", 1996, Renaud
Waldura, http://renaud.waldura.com/portfolio/graph-algorithms/
- "Model Checking", 1999, MIT
Press, Edmund M Clarke, Orna Grumberg and Doron Peled.
- "Linear temporal logic", 2006,
Wikipedia.
- "Logic in Computer Science(Second
Edition)", 2004, Michael Huth and Mark Ryan.
- "Program Verification", 1992,
Addison-Wesley Publishing Company, France Nissim.
- "Overview of the Temporal Logic
CTL*", 2003, Knowledge Representation Lab – Texas Tech University, Edmund
M. Clarke, Orna Grumberg, and Doron Peled.
- "Semantics and Verification of
Software - Operational Semantics of WHILE", 2008, RWTH Aachen
University, Thomas Noll
- "Specifying the Semantics of while
Programs: A Tutorial and Critique of a Paper by Hoare and Lauer",
1981, Irene Greif, Albert R. Meyer
- "Temporal Logic", 1999, Stanford
Encyclopedia of Philosophy (http://plato.stanford.edu/entries/logic-temporal/).
- "Timed Automata and Timed
Computation Tree Logic", 2000, Paul Pettersson.
- "Tuning SAT checkers for Bounded
Model Checking", Ofer Shtrichman
- "Vacuity Analysis by Fault
Simulation", 2008, Luigi Di Guglielmo, Franco Fummi,Graziano
Pravadelli
|
|