Automated element-wise reasoning with sets

Proceedings of the Second International Conference on Software Engineering and Formal Methods. SEFM 2004

Volumn , Issue , 2004, Pages 320-329

  Struth, Georg ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC DISTRIBUTIVE LATTICES; ATOMICITY; CALCULUS; STATE TRANSITION SYSTEMS;

ABSTRACTING; ALGORITHMS; ATOMIZATION; COMPUTER PROGRAMMING; PROBLEM SOLVING; SEMANTICS; SET THEORY; THEOREM PROVING;

SOFTWARE ENGINEERING;

EID: 16244422365     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SEFM.2004.1347536     Document Type: Conference Paper

References (23)

1. AtelierB. www.atelierb-societe.com.
2. Z/EVES. www.ora.on.ca/z-eves/welcome.html, 2003.
3. J.-R. Abrial. The B-Book. Cambridge University Press, 1996.
4. G. Birkhoff. Lattice Theory, volume 25 of Colloquium Publications. American Mathematical Society, 1984. Reprint.
5. J. P. Bowen and M. J. C. Gordon. A shallow embedding of Z in HOL. Information and Software Technology, 37(5-6):269-276, 1995.
6. A. D. Bruckner, F. Rittinger, and B. Wolff. HOL-Z 2.0: A proof environment for Z-specifications. Journal of Universal Computer Science, 9(2): 152-172, 2003.
7. D. Cantone, E. G. Omodeo, and A. Politicri. Set Theory for Computing. From Decision Procedures to Declarative Programming with Sets. Springer, 2001.
8. J. Desharnais, B. Möller, and G. Struth. Modal Kleene algebra - A survey. Technical Report DIUL-RR-0401, Institut d'informatique et de génie logiciel, Université Laval, Québec, 2004.
9. 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, 1996.
10. A. Grzegorczyk. Undecidability of some topological theories. Fund. Math., 38:137-152, 1951.
11. L. Hines. Str+⊆ve: The Str+-ve-based Subset Proven In M. E. Stickel, editor, 10th International Conference on Automated Deduction, volume 449 of LNAI, pages 193-206. Springer, 1990.
12. D. Kozen. Complexity of Boolean algebras. Theoretical Computer Science, 10:221-247, 1980.
13. J. McKinsey. The decision problem for some classes of sentences without quantifiers. Journal of Symbolic Logic, 8:61-76, 1943.
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 Reasoning, 8:91-147, 1993.
16. P. Rudnicki. An overwiev of the MIZAR project. Technical report, Department of Computing Science, University of Alberta, 1992.
17. M. Rusinowitch. Démonstration Automatique: Techniques de Réecriture. Science Informatique. InterEditions, Paris, 1989.
18. J. M. Spivey. Understanding Z. Cambrigde University Press, 1988.
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, 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, 2002.
21. G. Struth. A calculus for set-based program development. In J. S. Dong and J. Woodcock, editors, Formal Methods and Software Engineering: 5th International Conference on Formal Engineering Methods, volume 2885 of LNCS, pages 541-559. Springer, 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.