Sciweavers

632 search results - page 90 / 127
» Explicit Substitutions and Programming Languages
Sort
View
APAL
2008
104views more  APAL 2008»
13 years 7 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
SIGSOFT
2008
ACM
14 years 8 months ago
Improving robustness of evolving exceptional behaviour in executable models
Executable models are increasingly being employed by development teams to implement robust software systems. Modern executable models offer powerful composition mechanisms that al...
Alessandro Garcia, Nélio Cacho, Thomas Cott...
VMCAI
2009
Springer
14 years 2 months ago
Thread-Modular Shape Analysis
We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource ...
Alexey Gotsman, Josh Berdine, Byron Cook, Mooly Sa...
OOPSLA
2001
Springer
14 years 1 days ago
Object-Oriented Composition Untangled
Object-oriented languages come with pre-defined composition mechanisms, such as inheritance, object composition, or delegation, each characterized by a certain set of composition...
Klaus Ostermann, Mira Mezini
SIGSOFT
2010
ACM
13 years 5 months ago
Building scalable software systems in the multicore era
Software systems must face two challenges today: growing complexity and increasing parallelism in the underlying computational models. The problem of increased complexity is often...
Hridesh Rajan