Sciweavers

686 search results - page 95 / 138
» Foundations for Bidirectional Programming
Sort
View
ECOOP
2008
Springer
14 years 11 months ago
Integrating Nominal and Structural Subtyping
Nominal and structural subtyping each have their own strengths and weaknesses. Nominal subtyping allows programmers to explicitly express design intent, and, when types are associa...
Donna Malayeri, Jonathan Aldrich
LMO
1996
14 years 11 months ago
Using Metaobjects to Model Concurrent Objects with PICT
We seek to support the development of open, distributed applications from patible software abstractions. In order to rigorously specify these abstractions, we are elaborating a for...
Markus Lumpe, Jean-Guy Schneider, Oscar Nierstrasz
AIPS
2010
14 years 10 months ago
Forward-Chaining Partial-Order Planning
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
CASES
2010
ACM
14 years 7 months ago
Instruction selection by graph transformation
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
Sebastian Buchwald, Andreas Zwinkau
PLDI
2009
ACM
15 years 4 months ago
Snugglebug: a powerful approach to weakest preconditions
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
Satish Chandra, Stephen J. Fink, Manu Sridharan