Resources, concurrency and local reasoning
PW O'hearn - International Conference on Concurrency Theory, 2004 - Springer
LNCS 3170 - Resources, Concurrency and Local Reasoning Page 1 Resources, Concurrency
and Local Reasoning Peter W. O’Hearn Queen Mary, University of London Abstract. In this …
and Local Reasoning Peter W. O’Hearn Queen Mary, University of London Abstract. In this …
Typestates for objects
R DeLine, M Fähndrich - European Conference on Object-Oriented …, 2004 - Springer
Today's mainstream object-oriented compilers and tools do not support declaring and
statically checking simple pre-and postconditions on methods and invariants on object …
statically checking simple pre-and postconditions on methods and invariants on object …
[图书][B] Semantics of types for mutable state
AJ Ahmed - 2004 - search.proquest.com
Proof-carrying code (PCC) is a framework for mechanically verifying the safety of machine
language programs. A program that is successfully verified by a PCC system is guaranteed …
language programs. A program that is successfully verified by a PCC system is guaranteed …
Region analysis and transformation for Java programs
S Cherem, R Rugina - Proceedings of the 4th international symposium …, 2004 - dl.acm.org
This paper presents a region analysis and transformation framework for Java programs.
Given an input Java program, the compiler automatically translates it into an equivalent …
Given an input Java program, the compiler automatically translates it into an equivalent …
Tridirectional typechecking
J Dunfield, F Pfenning - ACM SIGPLAN Notices, 2004 - dl.acm.org
In prior work we introduced a pure type assignment system that encompasses a rich set of
property types, including intersections, unions, and universally and existentially quantified …
property types, including intersections, unions, and universally and existentially quantified …
Experience with safe manual memory-management in Cyclone
The goal of the Cyclone project is to investigate type safety for low-level languages such as
C. Our most difficult challenge has been providing programmers control over memory …
C. Our most difficult challenge has been providing programmers control over memory …
Local reasoning about a copying garbage collector
L Birkedal, N Torp-Smith, JC Reynolds - Proceedings of the 31st ACM …, 2004 - dl.acm.org
We present a programming language, model, and logic appropriate for implementing and
reasoning about a memory management system. We then state what is meant by …
reasoning about a memory management system. We then state what is meant by …
Early identification of incompatibilities in multi-component upgrades
S McCamant, MD Ernst - European Conference on Object-Oriented …, 2004 - Springer
Previous work proposed a technique for predicting problems resulting from replacing one
version of a software component by another. The technique reports, before performing the …
version of a software component by another. The technique reports, before performing the …
Dependent types
D Aspinall, M Hofmann - Advanced topics in types and …, 2004 - research.ed.ac.uk
In the most general sense, dependent types are type-valued functions. This definition
includes, for example, the type operators of Fω such as Pair. When applied to two types S …
includes, for example, the type operators of Fω such as Pair. When applied to two types S …
On spatial conjunction as second-order logic
Spatial conjunction is a powerful construct for reasoning about dynamically allocated data
structures, as well as concurrent, distributed and mobile computation. While researchers …
structures, as well as concurrent, distributed and mobile computation. While researchers …