D. Naumann, Soundness of data refinement for a higher order imperative language, Theoretical Computer Science 278 (2002) 271--301. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Representation Independence, Confinement and Access Control.. - Banerjee, Naumann (Correct)
....to those in the literature [40, 25, 7] but to keep things simple, we do not distinguish read only access) Our results are proved on the basis of this semantic condition. A modular static analysis, which does not require code anno In the case of refinement, identity is replaced by inequality [28]. In this paper we do not emphasize refinement. As a property to be proved or, ideally, as an intrinsic feature of the semantic model [34, 29] tations, can be derived from the semantic definition [2] Overview of the paper. Section 2 introduces the language with an example showing the ....
....identity on any type T for which it is the identity on all base types b that occur in T . The reason is that no value of type b can occur in a value of type T if b does not occur in T . This fails with extensible records and structural subtyping, and with procedures that may have global variables [28]. It can be made to work using name based (declaration) subclassing [6] but it turns out that for our purposes it is enough to deal with the heap. In our language, T is the identity for every data type T (Fact 3.4) but that is only because the interesting data is in the heap which is not ....
[Article contains additional citation context not shown here]
D. A. Naumann. Soundness of data refinement for a higher order imperative language. Theoretical Comput. Sci., 2001. To appear.
Basic Laws of ROOL: an Object-Oriented Language - Borba, Sampaio (2000) (1 citation) (Correct)
....and subtyping. Furthermore, some of the laws of imperative programming are not even directly applicable to corresponding small grain object oriented units and constructs. For instance, due to dynamic binding, the laws of procedure call are not valid for method call. Recent work [Lei98, MS97, Nau00b, Nau00a] has considered some small grain constructs, but medium grain constructs have been largely neglected in the literature. In this article we describe work towards a comprehensive set of basic laws for rool (Refinement Object Oriented Language) CN99] which is based on Java [GJS96] but has ....
David Naumann. Soundness of data refinement for a higher order imperative language. Theoretical Computer Science, 2000. To appear.
State-Level and Value-Level Simulations in Data Refinement - Leal, Arora (Correct)
....consider the value level simulations mentioned in the literature. Nipkow presents a value level forward simulation [6] as do Leavens and Pigozzi [2] Liskov and Wing s behavioral subtyping [3] gives an abstraction function 11 that is both a value level forward and backward simulation. Naumann [5] gives forward and backward simulations that are induced from value level relations for a higher order language. RESOLVE [8] defines components that import existing data types and export new data types with parameterized operations. For our purposes this is equivalent to a data type with visible ....
D.A. Naumann. Soundness of data refinement for a higher order imperative language. Theoretical Computer Science. To appear, 2000.
On the Secure Implementation of Security Protocols - Giambiagi, Dam (2003) (4 citations) (Correct)
No context found.
D. Naumann, Soundness of data refinement for a higher order imperative language, Theoretical Computer Science 278 (2002) 271--301.
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