Results 11  20
of
24
Ownership Transfer and Abstraction
, 2003
"... Ownership confinement expresses encapsulation in heap structures, in support of modular reasoning about e#ects, representation independence, and other properties. This paper studies heap encapsulation from the perspective of substitutability for the class construct of Javalike languages and a p ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Ownership confinement expresses encapsulation in heap structures, in support of modular reasoning about e#ects, representation independence, and other properties. This paper studies heap encapsulation from the perspective of substitutability for the class construct of Javalike languages and a particular form of confinement is justified by a representation independence result. A syntaxdirected static analysis is specified and proved sound for checking confinement in the presence of ownership transfer.
Assertionbased encapsulation, object invariants and simulations
 In FMCO postproceedings
, 2005
"... Abstract. In objectoriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial paper surveys recent progress using auxiliary state (ghost fields) to describe and achieve encapsulation. Encaps ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Abstract. In objectoriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial paper surveys recent progress using auxiliary state (ghost fields) to describe and achieve encapsulation. Encapsulation is assessed in terms of modular reasoning about invariants and simulations. 1
A Simple Adequate Categorical Model for PCF
 In Proceedings of Third International Conference on Typed Lambda Calculi and Applications
, 1997
"... Usually types of PCF are interpreted as cpos and terms as continuous functions. It is then the case that nontermination of a closed term of ground type corresponds to the interpretation being bottom; we say that the semantics is adequate. We shall here present an axiomatic approach to adequacy for ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Usually types of PCF are interpreted as cpos and terms as continuous functions. It is then the case that nontermination of a closed term of ground type corresponds to the interpretation being bottom; we say that the semantics is adequate. We shall here present an axiomatic approach to adequacy for PCF in the sense that we will introduce categorical axioms enabling an adequate semantics to be given. We assume the presence of certain "bottom" maps with the role of being the interpretation of nonterminating terms, but the orderstructure is left out. This is different from previous approaches where some kind of ordertheoretic structure has been considered as part of an adequate categorical model for PCF. We take the point of view that partiality is the fundamental notion from which orderstructure should be derived, which is corroborated by the observation that our categorical model induces an ordertheoretic model for PCF in a canonical way.
Theory for Software Verification
, 2009
"... Semantic models are the basis for specification and verification of software. Operational, denotational, and axiomatic or algebraic methods offer complementary insights and reasoning techniques which are surveyed here. Unifying theories are needed to link models. Also considered are selected program ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Semantic models are the basis for specification and verification of software. Operational, denotational, and axiomatic or algebraic methods offer complementary insights and reasoning techniques which are surveyed here. Unifying theories are needed to link models. Also considered are selected programming features for which new models are needed.
An arithmetical proof of the strong normalization for the λcalculus with recursive equations on types
, 2009
"... ..."
An arithmetical proof of the strong normalization for the λcalculus with recursive equations on types
, 2007
"... ..."
General Terms Languages, Theory
"... We give a semantics to a polymorphic effect analysis that tracks possiblythrown exceptions and possible nontermination for a higherorder language. The semantics is defined using partial equivalence relations over a standard monadic, domaintheoretic model of the original language and establishes ..."
Abstract
 Add to MetaCart
(Show Context)
We give a semantics to a polymorphic effect analysis that tracks possiblythrown exceptions and possible nontermination for a higherorder language. The semantics is defined using partial equivalence relations over a standard monadic, domaintheoretic model of the original language and establishes the correctness of both the analysis itself and of the contextual program transformations that it enables.
Logical relations for PCF
, 2013
"... We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallelor and the Plotkin existential are not definable in PCF, that the continuation semantics ..."
Abstract
 Add to MetaCart
We apply Andy Pitts’s methods of defining relations over domains to several classical results in the literature. We show that the Y combinator coincides with the domaintheoretic fixpoint operator, that parallelor and the Plotkin existential are not definable in PCF, that the continuation semantics for PCF coincides with the direct semantics, and that our domaintheoretic semantics for PCF is adequate for reasoning about contextual equivalence in an operational semantics. Our version of PCF is untyped and has both strict and nonstrict function abstractions. The development is carried out in HOLCF.