Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
Cristiano Calcagno, Dino Distefano, Peter W. O'Hea...
The virtual world is comprised of data items related to each other in a variety of contexts. Often such relations can be represented as graphs that evolve over time. Examples incl...
Olga Goussevskaia, Michael Kuhn 0002, Roger Watten...
Service Oriented Architecture (SOA) is an architectural style to reuse and integrate subsystems in existing systems for designing new applications. Each application is designed in...
Efficient memory allocation and data transfer for cluster-based data-intensive applications is a difficult task. Both changes in cluster interconnects and application workloads ...
The theory of reactive systems, introduced by Leifer and Milner and previously extended by the authors, allows the derivation of well-behaved labelled transition systems (LTS) for...