Sciweavers

595 search results - page 78 / 119
» The Graph Programming Language GP
Sort
View
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 9 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
ICALP
2011
Springer
13 years 10 days ago
Improved Approximation for the Directed Spanner Problem
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
Piotr Berman, Arnab Bhattacharyya, Konstantin Maka...
PVM
1997
Springer
14 years 1 months ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis
ICLP
2005
Springer
14 years 2 months ago
A Generic Framework for the Analysis and Specialization of Logic Programs
The relationship between abstract interpretation and partial deduction has received considerable attention and (partial) integrations have been proposed starting from both the part...
Germán Puebla, Elvira Albert, Manuel V. Her...
EMSOFT
2009
Springer
14 years 3 months ago
Clock-driven distributed real-time implementation of endochronous synchronous programs
An important step in model-based embedded system design consists in mapping functional specifications and their tasks/operations onto execution architectures and their ressources...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...