Simply observable behavioral specification
暂无分享,去创建一个
[1] Joseph A. Goguen,et al. A hidden agenda , 2000, Theor. Comput. Sci..
[2] Rolf Hennicker,et al. Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.
[3] Dorel Lucanu,et al. Concurrent object composition in CafeOBJ , 1998 .
[4] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[5] Michel Bidoit,et al. Behavioural Theories and the Proof of Behavioural Properties , 1996, Theor. Comput. Sci..
[6] Kokichi Futatsugi,et al. Test set coinduction - Toward automated verification of behavioural properties , 1998, WRLA.
[7] M. Matsumoto. Object composition and refinement by using non-observable projection operators: A case study of the automated teller machine system , 1999, FM 1999.
[8] Michel Bidoit,et al. Observational Logic , 1998, AMAST.
[9] Rolf Hennicker,et al. A Semi-Algorithm for Algebraic Implementation Proofs , 1992, Theor. Comput. Sci..
[10] Michel Bidoit,et al. Proving Behavioural Theorems with Standard First-Order Logic , 1994, ALP.
[11] Jan Willem Klop,et al. Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.
[12] Martin Wirsing,et al. Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[13] Grigore Rosu,et al. Hidden Congruent Deduction , 1998, FTP.