Sciweavers

12741 search results - page 2210 / 2549
» Editorial and call for papers
Sort
View
LFCS
2009
Springer
16 years 1 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
MFCS
2009
Springer
16 years 1 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
MIDDLEWARE
2009
Springer
16 years 1 months ago
DR-OSGi: Hardening Distributed Components with Network Volatility Resiliency
Abstract. Because middleware abstractions remove the need for lowlevel network programming, modern distributed component systems expose network volatility (i.e., frequent but inter...
Young-Woo Kwon, Eli Tilevich, Taweesup Apiwattanap...
OOPSLA
2009
Springer
16 years 1 months ago
Enhancing source-level programming tools with an awareness of transparent program transformations
Programs written in managed languages are compiled to a platform-independent intermediate representation, such as Java bytecode. The relative high level of Java bytecode has engen...
Myoungkyu Song, Eli Tilevich
179
Voted
PPDP
2009
Springer
16 years 1 months ago
Session types for linear multithreaded functional programming
The construction of reliable concurrent and distributed systems is an extremely difficult endeavour. For complex systems, it requires modular development strategies based on prec...
Vasco Thudichum Vasconcelos
« Prev « First page 2210 / 2549 Last » Next »