Cavalcanti, A. and Naumann, D.A. (2002) Forward simulation for data refinement of classes. In: FME 2002: Formal Methods - Getting IT Right. International Symposium of Formal Methods Europe, July 22–24, 2002, Copenhagen, Denmark. Lecture Notes In Computer Science (2391). Springer , Berlin / Heidelberg , pp. 133-140. ISBN 978-3-540-43928-8
Abstract
Simulation is the most widely used technique to prove data refinement. We define forward simulation for a language with recursive classes, inheritance, type casts and tests, dynamic binding, class based visibility, mutable state (without aliasing), and specification constructs from refinement calculi. It is a language based on sequential Java, but it also includes specification and deseign mechanisms appropriate for the construction of programs based on refinement. We show simulation to be sound for data refinement of classes in this language.
Metadata
| Authors/Creators: |
|
|---|---|
| Dates: |
|
| Institution: | The University of York |
| Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
| Depositing User: | York RAE Import |
| Date Deposited: | 08 Apr 2009 16:09 |
| Last Modified: | 08 Apr 2009 16:09 |
| Published Version: | http://dx.doi.org/10.1007/3-540-45614-7_27 |
| Status: | Published |
| Publisher: | Springer |
| Series Name: | Lecture Notes In Computer Science |
| Identification Number: | https://doi.org/10.1007/3-540-45614-7_27 |
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)