Ingrid M. Rewitzky  Home/Search
Context
Related
| comlab.ox.ac.uk/pub/Doc...TR198.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: comlab.oxford.ac.uk/ouc...TR198 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : Simulation rules provide a simple, sound and complete technique for proving that one data type refines another. This paper expresses the dependence of the soundness and completeness on the programming language by showing how sound and complete simulation rules for a given language are derived from those for its sublanguages. The dependence of the completeness on the semantic model is expressed using a J'onsson/Tarski duality translation between the relational and predicate transformer... (Update)
Active bibliography (related documents): More All
0.1: Categories of Relational Structures - Walicki, Bialasik (1998) (Correct)
0.1: Hyperboolean Algebras and Hyperboolean Modal Logic - Goranko, Vakarelov (Correct)
0.1: Axiomatizing Complex Algebras By Games - Hodkinson, Mikulás, Venema (1999) (Correct)
Similar documents based on text: More All
0.4: Towards Automated Testing - Towards Automated Testing (2001) (Correct)
0.3: A Functorial Approach to Refinement - Yoshiki Kinoshita And (Correct)
0.1: The Orthogonal QD-Algorithm - von Matt (1994) (Correct)
BibTeX entry: (Update)
@misc{ rewitzky-approximating,
author = "Ingrid M. Rewitzky",
title = "Approximating Simulations",
url = "citeseer.ist.psu.edu/227568.html" }
Citations (may not include all citations):652 A Discipline of Programming (context) - Dijkstra - 1976
357 Algebraic laws for nondeterminism and concurrency Journal of.. (context) - Hennessy, Milner - 1985
118 Boolean algebras with operators (context) - J'onsson, Tarski - 1951
108 Communications of the ACM (context) - Hoare, Programming - 1987
106 An algebraic definition of simulation between programs (context) - Milner - 1971
40 Non-deterministic data types: models and implementations (context) - Nipkow - 1986
39 The theory of representations for Boolean algebras (context) - Stone - 1956
38 Lecture Notes in Computer Science (context) - Park, automata et al. - 1981
36 Prespecification in data refinement (context) - Hoare, Jifeng et al. - 1987
30 Annals of Pure and Applied Logic (context) - Goldblatt, complex - 1989
29 A single complete rule for data refinement (context) - Gardiner, Morgan - 1993
21 An algebraic construction of predicate transformers - Gardiner, Martin et al. - 1994
9 Algebra Universalis (context) - Brink - 1993
1 Predicate transformers as power operations (context) - Rewitzky, Brink - 1995
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC