Garbage collection in OOP languages provides facilities to hook code that is executed upon object finalization. Semantically, the point in time that finalizer code is executed is not determined by the application logic, but by the garbage collection system. This fact renders a potential mismatch, since application-specific code, i.e. the finalizer implementation, normally affecting program state and control flow, is called automatically at a point in time that is indifferent to the application semantics. Although an analogous situation is observed in event-based systems, since event processors are called-back asynchronously by the underlying system, there is a fundamental difference: while event generation is essentially nondeterministic, o...
Many techniques have been devised for garbage collecting main memory heaps for programming languages...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
This paper investigates some problems associated with an expression evaluation order that we call ...
Automatic finalization is a common but inherently complex language facility that makes the garbage c...
We compare two different facilities for running cleanup actions for objects that are about to reach ...
The reactive programming model is largely different to what we’re used to as we don’t have full cont...
AbstractIt is generally thought that reasoning about programs in memory safe, garbage collected lang...
We describe a concurrent garbage collector (GC) for object-oriented databases. Our GC uses a new sy...
We present a case study in using the PVS interactive theorem prover to formally model and verify pro...
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such alg...
This paper describes a new language feature that allows dynamically allocated objects to be saved fr...
As the development of hardware progresses, computers are expected to solve increasingly complex prob...
We show how abstract requirements of garbage collection can be captured using temporal logic. The te...
We propose an effective methodology in which a distributed garbage collector may be derived from a d...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
Many techniques have been devised for garbage collecting main memory heaps for programming languages...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
This paper investigates some problems associated with an expression evaluation order that we call ...
Automatic finalization is a common but inherently complex language facility that makes the garbage c...
We compare two different facilities for running cleanup actions for objects that are about to reach ...
The reactive programming model is largely different to what we’re used to as we don’t have full cont...
AbstractIt is generally thought that reasoning about programs in memory safe, garbage collected lang...
We describe a concurrent garbage collector (GC) for object-oriented databases. Our GC uses a new sy...
We present a case study in using the PVS interactive theorem prover to formally model and verify pro...
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such alg...
This paper describes a new language feature that allows dynamically allocated objects to be saved fr...
As the development of hardware progresses, computers are expected to solve increasingly complex prob...
We show how abstract requirements of garbage collection can be captured using temporal logic. The te...
We propose an effective methodology in which a distributed garbage collector may be derived from a d...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
Many techniques have been devised for garbage collecting main memory heaps for programming languages...
This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms o...
This paper investigates some problems associated with an expression evaluation order that we call ...