Sciweavers

686 search results - page 64 / 138
» Foundations for Bidirectional Programming
Sort
View
ICFP
2003
ACM
15 years 9 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
POPL
2009
ACM
15 years 10 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
JFP
2000
91views more  JFP 2000»
14 years 9 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
DOCENG
2008
ACM
14 years 11 months ago
A concise XML binding framework facilitates practical object-oriented document engineering
Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and int...
Andruid Kerne, Zachary O. Toups, Blake Dworaczyk, ...
BIRTHDAY
2009
Springer
15 years 4 months ago
Is the World Linear?
Super-resolution is the art of creating nice high-resolution raster images from given low-resolution raster images. Since “nice” is not a well-defined term in mathematics and ...
Rudolf Fleischer