Inductive behavioral proofs by unhiding

Electronic Notes in Theoretical Computer Science

Volumn 82, Issue 1, 2003, Pages 285-302

  Roşu, Grigore ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; FORMAL LOGIC; MATHEMATICAL MODELS; SPECIFICATIONS; THEOREM PROVING;

DATA REPRESENTATION; HIDDEN LOGIC; INFORMATION HIDING; SOFTWARE DEVELOPMENT APPROACH;

ALGEBRA;

EID: 18944390756     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80645-5     Document Type: Conference Paper

References (41)

1. Bergstra J., Heering J., Klint P. Module algebra. Journal of the ACM. 37:(2):1990;335-372
2. Bergstra J., Tucker J.V. Equational specifications, complete rewriting systems, and computable and semicomputable algebras. Journal of the ACM. 42:(6):1995;1194-1230
3. Bernot G., Bidoit M., Knapik T. Observational specifications and the indistinguishability assumption. TCS. 139:(1-2):1995;275-314
4. N. Berregeb, A. Bouhoula, and M. Rusinowitch. Observational proofs with critical contexts. In Proceedings of FASE'98, volume 1382 of LNCS. 1998.
5. Bidoit M., Hennicker R. Proving behavioural theorems with standart first-order logic. Algebraic and Logic Programming (ALP'94) volume 850 of LNCS. 1994;41-58
6. Bidoit M., Hennicker R. Behavioral theories and the proof of behavioral properties. Theoretical Computer Science. 165:(1):1996;3-55
7. Bidoit M., Hennicker R. Modular correctness proofs of behavioural implementations. Acta Informatica. 35:(11):1998;951-1005
8. Bidoit M., Hennicker R. Observer complete definitions are behaviourally coherent. OBJ/CafeOBJ/Maude at FM'99. 1999;83-94 Theta
9. Burstall R., Diaconescu R. Hiding and behaviour: an institutional approach. A Classical Mind: Essays in Honour of C.A.R. Hoare. 1994;75-92 Prentice Hall
10. S. Buss and G. Roşu. Incompleteness of behavioral logics. In Proceeding of CMCS'00, volume 33 of ENTCS, pages 61-79. Elsevier, 2000.
11. Cǐrstea C. Semantic constructions for hidden algebra. Recent Trends in Algebraic Development Techniques volume 1589 of LNCS. 1999;Springer
12. M. Clavel, S. Eker, P. Lincoln, and J. Meseguer. Principles of Maude. In Proceedings of WRLA, volume 4 of ENTCS. Elsevier, 1996.
13. R. Diaconescu and K. Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, volume 6.
14. Diaconescu R., Futatsugi K. Behavioral coherence in object-oriented algebraic specification. J. of Universal Computer Science. 6:(1):2000;74-96
15. Diaconescu R., Goguen J., Stefaneas P. Logical support for modularization. Logical Environments. 1993;83-130 Cambridge
16. V. Giarrantana, F. Gimona, and U. Montanari. Observability concepts in abstract data specifications. In Proceedings of MFCS, vol. 45 of LNCS. 1976.
17. Goguen J. Types as theories. Topology and Category Theory in Computer Science. 1991;357-390 Oxford
18. Goguen J., Burstall R. Institutions: Abstract model theory for specification and programming. Journal of the ACM. 39:(1):January 1992;95-146
19. J. Goguen and R. Diaconescu. Towards an algebraic semantics for the object paradigm. In Proceedings of WADT, volume 785 of LNCS. Springer, 1994.
20. J. Goguen, K. Lin, and G. Roşu. Circular coinductive rewriting. In Proceedings of Automated Software Engineering 2000, pages 123-131. IEEE, 2000.
21. J. Goguen, K. Lin, and G. Roşu. Behavioral and coinductive rewriting. In Proceedings of WRLA'01, volume 36 of ENTCS, pages 1-22. Elsevier, 2001.
22. Goguen J., Malcolm G. Hidden coinduction: Behavioral correctness proofs for objects. Mathematical Structures in Computer Science. 9:(3):1999;287-319
23. Goguen J., Malcolm G. A hidden agenda. TCS. 245:(1):2000;55-101
24. J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. In Proceedings of ICALP, volume 140 of LNCS, pages 265-281. Springer, 1982.
25. J. Goguen and G. Roşu. Hiding more of hidden algebra. In Proceeding of FM'99, volume 1709 of LNCS, pages 1704-1719. Springer, 1999.
26. Goguen J., Winkler T., Meseguer J., Futatsugi K., Jouannaud J.-P. Introducing OBJ. Software Engineering with OBJ: algebraic specification in action. 2000;3-167 Kluwer
27. Hennicker R. Context induction: a proof principle for behavioral abstractions. Formal Aspects of Computing. 3:(4):1991;326-345
28. R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263-277. Springer, 1999.
29. Jacobs B., Rutten J. A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Comp. Science. 62:1997;222-259
30. D. Lucanu, O. Gheorghieş, and A. Apetrei. Bisimulation and hidden algebra. In Proceedings of CMCS'99, volume 19 of ENTCS, pages 213-232. 1999.
31. Majster M. Limits of the algebraic specification of abstract data types. SIGPLAN Notices. October 1977;37-42
32. Meseguer J., Goguen J. Initiality, induction and computability. Algebraic Methods in Semantics. 1985;459-541 Cambridge
33. S. Mikami. Semantics of equational specifications with module import and verification method of behavioral equations. In Proceedings of CafeOBJ Symposium. Japan Advanced Institute for Science and Technology, 1998.
34. P. Padawitz. Towards the one-tiered design of data types and transition systems. In Proceedings of WADT'97, volume 1376 of LNCS, pages 365-380. Springer, 1998.
35. Parnas D. Information distribution aspects of design methodlogy. Information Processing. 71:1972;339-344
36. H. Reichel. Behavioural equivalence - a unifying concept for initial and final specifications. In Proceedings of the 3rd Hungarian Computer Science Conference. Akademiai Kiado, 1981.
37. Reichel H. Behavioural validity of conditional equations in abstract data types. Contributions to General Algebra 3. 1985;Teubner
38. G. Roşu. Hidden Logic. PhD thesis, University of California at San Diego, 2000.
39. Roşu G. Equational axiomatizability for coalgebra. Theoretical Computer Science. 260:(1-2):2001;229-247
40. Roşu G., Goguen J. Hidden congruent deduction. Automated Deduction in Classical and Non-Classical Logics volume 1761 of LNAI. 2000;Springer
41. Sannella D., Tarlecki A. On observational equivalence and algebraic specification. Journal of Computer and System Science. 34:1987;150-178