Verifikation reaktiver Systeme - Universität Kaiserslautern

138
5. Stålmarck, G.: System for determining propositional logic theorems by applying
values and rules to triplets that are generated from a formula (1989) Patentiert in
den U.S.A, Europa und Schweden.
6. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving.
Communications ACM 5 (1962) 394–397
7. Wirth, N.: Algorithms + Data Structures = Programs. Prentice-Hall (1975)
8. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE
Trans. on Computers C-85 (1986) 677–691
9. Wolfgang Kunz, J.P.M.S., Malik,S.: 12. Logic Synthesis and Verification. In:
SAT andATPG: Algorithms for Boolean Decision Problems. Kluwer Academic
Publishers (2001) 309–341
10. Roth, J.P.: Diagnosis of automata failures: Acalculus and a method. IBM Journal
of Research and Development 10 (1966) 278–291
11. Fujiwara, H., Shimono, T.: On the acceleration of test generation algorithms. IEEE
Transactions on Computers 32 (1983) 1137–1144
12. Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability
algorithms. Proceddings of the 9th Portuguese Conference on Artificial
Intelligence (EPIA) (1999)
13. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering
an Efficient SAT Solver. In: Proceedings of the 38th Design Automation
Conference (DAC’01). (2001)
14. Goldberg, E., Novikov, Y.: Berkmin: Afast and robust sat solver. Design Automation
and Test in Europe (DATE) 2002 (2002) 142–149
15. Beame, P., Kautz, H., Sabharwal, A.: Understanding the power of clause learning.
In: Proceedings of the 18th International Joint Conference on Artificial Intelligence
(IJCAI). (2003) 1194–1201
16. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven
learning in boolean satisfiability solver. In: ICCAD. (2001) 279–285
17. Marques-Silva, J.P., Sakallah, K.A.: GRASP –Anew search algorithm for satisfiability.
Technical Report CSE-TR-292-96, The University of Michigan (1996)
18. Jr., R.J.B., Schrag, R.C.: Using csp look-back techniques to solve realworld sat
instances. In: Proceedings of the 14th National Conference on Artificial Intelligence.
(1997) 203–208
19. Wang, C., Reddy, S.M., Pomeranz,I.,Lin,X.,Rajski, J.: Conflict driven techniques
for improving deterministic test pattern generation. In: Proceedings of the 2002
IEEE/ACM international conference on Computer-aided design, ACM Press (2002)
87–93
20. Zhang, L., Malik, S.: The quest for efficient Boolean satisfiability solvers. In
Voronkov, A., ed.: Automated Deduction – CADE-18. Volume 2392 of Lecture
Notes in Computer Science., Springer-Verlag (2002) 295–313
21. Zhang, H., Stickel,M.E.: An efficient algorithm for unit propagation. In: Proceedings
of the 4th International Symposium on Artificial Intelligence and Mathematics.
(1996)
22. Zhang, H.: SATO: an efficient propositional prover. In: Proceedings of the International
Conference on Automated Deduction (CADE’97), volume 1249 of LNAI.
(1997) 272–275
23. Du, D., Gu,J., Pardalos,P.M., eds.: Satisfiability Problem: Theory and Application.Volume
35 of Dimacs Series in Discrete Mathematics and Theoretical Computer
Science. American Mathematical Society (1997)
24. Eén, N., Sörensson, N.: An extensible SAT-solver. Proceedings of the 6th International
Conference on Theory and Applications of Satisfiability Testing (2003)