Incremental Derivation of Abstraction Relations for Data Refinement

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

Volumn 2885, Issue , 2003, Pages 246-265

  Robinson, Neil J ^a  

^a UNIVERSITY OF QUEENSLAND   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DATA REFINEMENTS; NEW PROGRAMS; NOT GIVEN; PROOF OBLIGATIONS; REFINEMENT STEP; SOFTWARE DESIGNERS;

MAPPING;

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

References (13)

1. R.-J. R. Back. Refinement of parallel and reactive programs. Technical Report Caltech-CS-TR-92-93, Computer Science Department, California Institute of Technology, 1992.
2. R.-J. R. Back and J. von Wright. Trace refinement of action systems. In B. Jonsson and J. Parrow, editors, Proceedings of CONCUR '94: Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 367-384. Springer-Verlag, 1994.
3. R.-J. R. Back and J. von Wright. Contracts, games and refinement. Information and Computation, 156:25-45, 2000.
4. R.-J. R. Back and J. von Wright. Encoding, decoding and data refinement. Formal Aspects of Computing, 12:313-349, 2000.
5. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proceedings of the 10th International Conference on Computer Aided Verification, CAV98, volume 1427 of Lecture Notes in Computer Science, pages 319-331. Springer, 1998.
6. M. Butler. On the use of data refinement in the development of secure communications systems. Formal Aspects of Computing, 14(1):2-34, 2002.
7. M. Doche and A. Gravell. Extraction of abstraction invariants for data refinement. In D. Bert, J. P. Bowen, M. C. Henson, and K. Robinson, editors, ZB 2002: Formal Specification and Development in Z and B, Proceedings of the 2nd International Conference of B and Z Users, volume 2272 of Lecture Notes in Computer Science, pages 120-139. Springer, 2002.
8. M. Lange and C. Stirling. Model checking games for branching time logics. Journal of Logic and Computation, 12:623-639, 2002.
9. C. Morgan and P. H. B. Gardiner. Data refinement by calculation. Acta Informatica, 27(6):481-503, 1989.
10. N. J. Robinson. Checking Z data refinements using an animation tool. In D. Bert, J. P. Bowen, M. C. Henson, and K. Robinson, editors, ZB 2002: Formal Specification and Development in Z and B, Proceedings of the 2nd International Conference of B and Z Users, volume 2272 of Lecture Notes in Computer Science, pages 62-81. Springer, 2002.
11. N. J. Robinson. Finding abstraction relations for data refinement. Technical Report TR03-03, Software Verification Research Centre, School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane 4072, Australia, February 2003. http://www.itee.uq.edu.au/~njr/tr0303. pdf.
12. N. J. Robinson and C. Fidge. Animation of data refinements. In Proceedings of the Asia-Pacific Software Engineering Conference, APSEC 2002, Gold Coast, Australia, pages 137-146. IEEE Computer Society Press, December 2002.
13. J. von Wright. Data refinement and the simulation method. Technical Report Ser. A, No. 137, Abo Akademi, 1992.