A Calculus for Set-Based Program Development

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2885, Issue , 2003, Pages 541-559

  Struth, Georg ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS; LATTICE THEORY;

ATOMIC DISTRIBUTIVE LATTICES; AUTOMATED PROOFS; BOOLEAN REASONING; PROGRAM DEVELOPMENT; PROOF SEARCH; REDUCTION AND SIMPLIFICATION;

CALCULATIONS;

EID: 0344392286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39893-6_31     Document Type: Article

References (24)

1. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
2. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic and Computation, 4(3):217-247, 1994.
3. L. Bachmair and H. Ganzinger. Rewrite techniques for transitive relations. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 384-393. IEEE Computer Society Press, 1994.
4. G. Birkhoff. Lattice Theory, volume 25 of Colloquium Publications. American Mathematical Society, 1984. Reprint.
5. R. P. Dilworth. Lattices with unique complements. Trans. Amer. Math. Soc., 57:123-154, 1945.
6. H. Doornbos, R. C. Backhouse, and J. van der Woude. A calculation approach to mathematical induction. Theoretical Computer Science, 179:103-135, 1997.
7. M. Gordon. Set theory, higher-order logic or both? In J. Grundy and J. Harrison, editors, Theorem Proving in Higher-Order Logic: 9th International Conference, volume 1125 of LNCS, pages 191-202. Springer-Verlag, 1996.
8. A. Grzegorczyk. Undecidability of some topological theories. Fund. Math., 38:137-152, 1951.
9. H. Hermes. Einführung in die Verbandstheorie. Springer-Verlag, 1967.
10. L. Hines. Str+ve⊆; The Str+ve-based Subset Prover. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNAI, pages 193-206. Springer-Verlag, 1990.
11. C. A. R. Hoare and B. von Karger. Sequential calculus. Information Processing Letters, 53(3):123-130, 1995.
12. D. Kozen. Complexity of Boolean algebras. Theoretical Computer Science, 10:221-247, 1980.
13. D. Kozen. Kleene algebra with tests. Transation on Programming Languages and Systems, 19(3):427-443, 1997.
14. L. C. Paulson. Set theory for verification: I. From foundations to functions. J. Automated Reasoning, 11:353-389, 1993.
15. A. Quaife. Automated deduction in von-Neumann-Bernays-Gödel set theory. J. Automated Deduction, 8:91-147, 1993.
16. P. Rudnicki. An overwiev of the MIZAR project. Technical report, Department of Computing Science, University of Alberta, 1992.
17. J. M. Spivey. Understanding Z. Cambrigde University Press, 1988.
18. G. Struth. An algebra of resolution. In L. Bachmair, editor, Rewriting Techniques and Applications, 11th International Conference, volume 1833 of LNCS, pages 214-228. Springer-Verlag, 2000.
19. G. Struth. Deriving focused calculi for transitive relations. In A. Middeldorp, editor, Rewriting Techniques and Applications, 12th International Conference, volume 2051 of LNCS, pages 291-305. Springer-Verlag, 2001.
20. G. Struth. Deriving focused lattice calculi. In S. Tison, editor, Rewriting Techniques and Applicaions, 13th International Conference, volume 2378 of LNCS, pages 83-97. Springer-Verlag, 2002.
21. G. Struth. A calculus for set-based program development I: Mathematical foundations. Technical Report 2003-15, Institut für Informatik; Universität Augsburg, 2003.
22. G. Struth. A calculus for set-based program development II: Proof search. Technical Report 2003-16, Institut für Informatik; Universität Augsburg, 2003.
23. A. Tarski. Arithmetical classes and types of Boolean algebras. Bull. Am. Math. Soc., 55(64):1192, 1949.
24. G. S. Tseitin. On the complexity of derivations in propositional calculus. In J. Siekmann and G. Wrightson, editors, Automation of Reasoning: Classical Papers on Computational Logic, pages 466-483. Springer-Verlag, 1983. reprint.