Sciweavers

55 search results - page 7 / 11
» Relational Reasoning for Recursive Types and References
Sort
View
POPL
1993
ACM
13 years 11 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
CAISE
2005
Springer
14 years 1 months ago
Capability Matching and Similarity Reasoning in Service Discovery
Abstract. Ontologies play a relevant role to support service matchmaking in the discovery process. In fact, the elements used for service capability description refer to concepts t...
Devis Bianchini, Valeria De Antonellis, Michele Me...
OOPSLA
2007
Springer
14 years 1 months ago
Component nextgen: a sound and expressive component framework for java
Developing a general component system for a statically typed, object-oriented language is a challenging design problem for two reasons. First, mutually recursive references across...
James Sasitorn, Robert Cartwright
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 7 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 11 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton