Behavioral verification of distributed concurrent systems with BOBJ

Proceedings - International Conference on Quality Software

Volumn 2003-January, Issue , 2003, Pages 216-235

  Goguen, J ^a   Lin, Kai ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS;

ALGEBRAIC SPECIFICATIONS; BEHAVIORAL PROPERTIES; CASE ANALYSIS; CONCURRENT SYSTEMS;

FORMAL VERIFICATION;

EID: 84945183358     PISSN: 15506002     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QSIC.2003.1319106     Document Type: Conference Paper

References (35)

1. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge, 1998.
2. Narjes Berregeb, Adel Bouhoula, and Michal Rusinowitch. Observational proofs with critical contexts. In Fundamental Approaches to Software Engineering, volume 1382 of Lecture Notes in Computer Science, pages 38-53. Springer, 1998.
3. Michel Bidoit and Rolf Hennicker. Constructor-based observational logic. Technical Report LSV-03-9, Laboratoire Spcification et Verification, CNRS de Cachan, March 2003.
4. Barry Boehm. Software Engineering Economics. Prentice-Hall, 1981.
5. Rod Burstall and Joseph Goguen. An informal introduction to specifications using Clear. In Robert Boyer and J Moore, editors, The Correctness Problem in Computer Science, pages 185-213. Academic, 1981.
6. Software Specification Techniques, Narain Gehani and Andrew McGettrick, editors, Addison-Wesley, 1985, pages 363-390.
7. Samuel Buss and Grigore Rosu. Incompleteness of behavioral logics. In Horst Reichel, editor, Proceedings, Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science, pages 61-79. Elsevier Science, March 2000.
8. Razvan Diaconescu and Kokichi Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, Volume 6.
9. Razvan Diaconescu and Kokichi Futatsugi. Behavioural coherence in object-oriented algebraic specification. Journal of Universal Computer Science, 6(1):74-96, 2000.
10. Hartmut Ehrig and Bernd Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer, 1985. EATCS Monographs on Theoretical Computer Science, Vol. 6.
11. Marie-Claude Gaudel and Igor Privara. Context induction: an exercise. Technical Report 687, LRI, Université de Paris-Sud, 1991.
12. Joseph Goguen. Principles of parameterized programming. In Ted Biggerstaff and Alan Perlis, editors, Software Reusability, Volume I: Concepts and Models, pages 159-225. Addison Wesley, 1989.
13. Joseph Goguen. Types as theories. In George Michael Reed, Andrew William Roscoe, and Ralph F. Wachter, editors, Topology and Category Theory in Computer Science, pages 357-390. Oxford, 1991. Proceedings of a Conference held at Oxford, June 1989.
14. Joseph Goguen and Rod Burstall. Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery, 39(1):95-146, January 1992.
15. Joseph Goguen and Razvan Diaconescu. Towards an algebraic semantics for the object paradigm. In Hartmut Ehrig and Fernando Orejas, editors, Proceedings, Tenth Workshop on Abstract Data Types, pages 1-29. Springer, 1994. Lecture Notes in Computer Science, Volume 785.
16. Joseph Goguen and Kai Lin. Web-based support for cooperative software engineering. Annals of Software Engineering, 12:25-32, 2001. Special issue for papers from a conference in Taipei, December 2000.
17. Joseph Goguen, Kai Lin, and Grigore Rosu. Circular coinductive rewriting. In Automated Software Engineering '00, pages 123-131. IEEE, 2000. Proceedings of a workshop held in Grenoble, France.
18. Joseph Goguen, Kai Lin, and Grigore Rosu. Behavioral and coinductive rewriting. In Proceedings, Rewriting Logic Workshop, 2000. Elsevier, 2001. Electronic Notes on Theoretical Computer Science, Volume 36, at www.elsevier.nl/locate/entcs/volume36.html.
19. Joseph Goguen and Grant Malcolm. Hidden coinduction: Behavioral correctness proofs for objects. Mathematical Structures in Computer Science, 9(3):287-319, June 1999.
20. Joseph Goguen and Grant Malcolm. A hidden agenda. Theoretical Computer Science, 245(1):55-101, August 2000. Also UCSD Dept. Computer Science & Eng. Technical Report CS97-538, May 1997.
21. Joseph Goguen and José Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105(2):217-273, 1992. Drafts exist from as early as 1985.
22. Joseph Goguen and Grigore Rosu. Hiding more of hidden algebra. In Jeannette Wing, Jim Woodcock, and Jim Davies, editors, FM'99-Formal Methods, pages 1704-1719. Springer, 1999. Lecture Notes in Computer Sciences, Volume 1709, Proceedings of World Congress on Formal Methods, Toulouse, France.
23. Joseph Goguen and Grigore Rosu. A protocol for distributed cooperative work. In Gheorghe Stefanescu, editor, Proceedings, FCT'99, Workshop on Distributed Systems (Iaşi, Romania), volume 28, pages 1-22. Elsevier, 1999. Electronic Lecture Notes in Theoretical Computer Science.
24. Joseph Goguen, Timothy Winkler, José Meseguer, Kokichi Futatsugi, and Jean-Pierre Jouannaud. Introducing OBJ. In Joseph Goguen and Grant Malcolm, editors, Software Engineering with OBJ: Algebraic Specification in Action, pages 3-167. Kluwer, 2000.
25. Rolf Hennicker. Context induction: a proof principle for behavioural abstractions. In A. Miola, editor, Proceedings, International Symposium on the Design and Implementation of Symbolic Computation Systems, volume 429 of Lecture Notes in Computer Science, pages 101-110. Springer, 1990.
26. Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263-277. Springer, 1999.
27. Bart Jacobs and Jan Rutten. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science, 62:222-259, June 1997.
28. Kai Lin. Machine Support for Behavioral Algebraic Specification and Verification. PhD thesis, University of California at San Diego, 2003.
29. José Meseguer and Joseph Goguen. Initiality, induction and computability. In Maurice Nivat and John Reynolds, editors, Algebraic Methods in Semantics, pages 459-541. Cambridge, 1985.
30. Robin Milner. A Calculus of Communicating Systems. Springer, 1980. Lecture Notes in Computer Science, Volume 92.
31. David M.R. Park. Concurrency and Automata on Infinite Sequences. Springer, 1980. Lecture Notes in Computer Science, Volume 104.
32. Horst Reichel. Behavioural equivalence-a unifying concept for initial and final specifications. In Proceedings, Third Hungarian Computer Science Conference. Akademiai Kiado, 1981. Budapest.
33. Grigore Rosu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
34. Grigore Rosu and Joseph Goguen. Hidden congruent deduction. In Ricardo Caferra and Gernot Salzer, editors, Proceedings, 1998 Workshop on First Order Theorem Proving, pages 213-223. Technische Universität Wien, 1998. (Schloss Wilhelminenberg, Vienna, November 23-25, 1998).
35. Grigore Rosu and Joseph Goguen. Circular coinduction. In Proceedings, Int. Joint Conf. Automated Deduction. Springer, 2000. Sienna, June 2001.