Sciweavers

HPCC
2007
Springer
14 years 1 months ago
Towards a Complexity Model for Design and Analysis of PGAS-Based Algorithms
Many new Partitioned Global Address Space (PGAS) programming languages have recently emerged and are becoming ubiquitously available on nearly all modern parallel architectures. PG...
Mohamed Bakhouya, Jaafar Gaber, Tarek A. El-Ghazaw...
GPCE
2007
Springer
14 years 1 months ago
Oz/K: a kernel language for component-based open programming
Programming in an open environment remains challenging because it requires combining modularity, security, concurrency, distribution, and dynamicity. In this paper, we propose an ...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
FSTTCS
2007
Springer
14 years 1 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
ESOP
2007
Springer
14 years 1 months ago
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning
We study the relationship between Concurrent Separation Logic (CSL) and the assume-guarantee (A-G) method (a.k.a. rely-guarantee method). We show in three steps that CSL can be tre...
Xinyu Feng, Rodrigo Ferreira, Zhong Shao
ESOP
2007
Springer
14 years 1 months ago
Using History Invariants to Verify Observers
Abstract. This paper contributes a technique that expands the set of object invariants that one can reason about in modular verification. The technique uses history invariants, tw...
K. Rustan M. Leino, Wolfram Schulte
ESOP
2007
Springer
14 years 1 months ago
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlockand race-freedom) of operating system kernels...
Kohei Suenaga, Naoki Kobayashi
ESOP
2007
Springer
14 years 1 months ago
Interprocedurally Analysing Linear Inequality Relations
In this paper we present an alternative approach to interprocedurally g linear inequality relations. We propose an abstraction of the effects of procedures through convex sets of t...
Helmut Seidl, Andrea Flexeder, Michael Petter
ESOP
2007
Springer
14 years 1 months ago
Modular Shape Analysis for Dynamically Encapsulated Programs
We present a modular static analysis which identifies structural (shape) invariants for a subset of heap-manipulating programs. The subset is defined by means of a non-standard ...
Noam Rinetzky, Arnd Poetzsch-Heffter, Ganesan Rama...