Sciweavers

3535 search results - page 481 / 707
» Logic Program Specialisation
Sort
View
257
Voted
POPL
2009
ACM
16 years 6 months ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
POPL
2005
ACM
16 years 6 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
ICFP
2002
ACM
16 years 6 months ago
Type classes with more higher-order polymorphism
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
Matthias Neubauer, Peter Thiemann
SAC
2009
ACM
16 years 28 days ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
SECON
2007
IEEE
16 years 12 days ago
High-Level Application Development is Realistic for Wireless Sensor Networks
—Programming Wireless Sensor Network (WSN) applications is known to be a difficult task. Part of the problem is that the resource limitations of typical WSN nodes force programm...
Marcin Karpinski, Vinny Cahill