Preview
Unable to display preview. Download preview PDF.
References
G. Boolos and R. Jeffrey. Computability and Logic. Cambridge, 1974.
M. Buro and H. Kleine-Büning. Report on a SAT competition. Report 110, Reihe Informatik. Universität Paderborn. Nov. 1992
B. Dreben and W. D. Goldfarb. The Decision Problem. Addison-Wesley, Reading (Mass.), 1979.
M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.
S. J. Garland and J. V. Guttag. A Guide to LP, The Larch Prover. Report 82. Digital Systems Research Center. Palo Alto. 1991.
K. Jensen and N. Wirth. Pascal: User Manual and Report. Springer, New York, 1983.
Th. Käufl. The Program Verification System Tatzelwurm: User Manual. Unpublished working paper
Th. Käufl. Reasoning about Theories with a Finite Model. In 3. Österreichische Artificial Intelligence-Tagung. Pages 168–175, Springer, Informatik-Fachberichte 151, Berlin, Heidelberg, New York, 1987.
Th. Käufl. Reasoning about Systems of Linear Inequalities. In 9th International Conference on Automated Deduction. Pages 563–572,Springer, LNCS 310, New York, 1988.
Th. Kaufl. Simplification and Decision of Systems of Linear Inequalities over the Integers. Interner Bericht 9/88. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, 1988.
Th. Käufl. Program Verifier Tatzelwurm: The Correctness and Completeness of the Generation of the Verification Conditions. Interner Bericht 9/89. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, 1989.
Th. Käufl. The Program Verifier Tatzelwurm. In [BK92]
Th. Käufl. The Combination of a Decision Procedure for the Presburger Arithmetic with a Tableau Prover. Workshop Theory Reasoning in Automated Deduction. 12th Internation Conference on Automated Deduction.
H. Kersten (ed.). Sichere Software: Formale Spezifikation und Verifikation vertrauenswürdiger Systeme. Heidelberg, 1990.
S. Klingenbeck and Th. Käufl. Tatzelwurm. In C. Lewerentz and Th. Lindner (eds.). Formal Development of Reactive Systems — Case Study Production Cell, pages 247–260, Springer LNCS 891, 1995.
Th. Käufl and N. Zabel. Cooperation of Decision Procedures in a Tableau-Based Theorem Prover. Revue d'Intelligence Artificielle, Vol. 4(3): 99–126, 1990.
J. Loeckx and K. Sieber. The Foundations of Program Verification. Chicester, Stuttgart, 1984.
P. A. Mateti. Decision Procedure for the Correctness of a class of Programs. Journal ACM, 28(2): 215–232, 1981.
C. G. Nelson and D. C. Oppen. Simplification by Cooperating Decision Procedures. ACM TOPLAS 1, pp. 245–257, 1979.
D. A. Schmidt. Programming Notation for Tactical Reasoning. 7th International Conference on Automated Deduction. Pages 445–459, Springer, LNCS 170, Berlin, Heidelberg, New York, 1984.
Schrijver. A. Theory of Linear and Integer Programming. Wiley, 1986.
N. Suzuki and D. Jefferson. Verification Decidability of Presburger Array Programs. Journal ACM, 27(1): 191–205, 1980.
R.M. Smullyan. First Order Logic. Springer, New York, 1968.
Tichy. RCS-A System for Version Control. Softw. Pract. Exper. 15(7): 637–654, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deussen, P., Hansmann, A., Käufl, T., Klingenbeck, S. (1995). The verification system Tatzelwurm . In: Broy, M., Jähnichen, S. (eds) KORSO: Methods, Languages, and Tools for the Construction of Correct Software. Lecture Notes in Computer Science, vol 1009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015468
Download citation
DOI: https://doi.org/10.1007/BFb0015468
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60589-8
Online ISBN: 978-3-540-47802-7
eBook Packages: Springer Book Archive