Sciweavers

4940 search results - page 433 / 988
» On the Complexity of Universal Programs
Sort
View
WWW
2005
ACM
16 years 7 months ago
Composite event queries for reactivity on the web
Reactivity on the Web is an emerging issue. The capability to automatically react to events (such as updates to Web resources) is essential for both Web services and Semantic Web ...
François Bry, James Bailey, Paula-Lavinia P...
CADE
2008
Springer
16 years 7 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
ICSE
2003
IEEE-ACM
16 years 7 months ago
Scaling Step-Wise Refinement
Step-wise refinement is a powerful paradigm for developing a complex program from a simple program by adding features incrementally. We present the AHEAD (Algebraic Hierarchical Eq...
Don S. Batory, Jacob Neal Sarvela, Axel Rauschmaye...
199
Voted
ICFP
2007
ACM
16 years 6 months ago
Lazy call-by-value evaluation
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
Bernd Braßel, Frank Huch, Germán Vida...
164
Voted
PERCOM
2009
ACM
16 years 1 months ago
Opening Pervasive Computing to the Masses Using the SEAP Middleware
— The increasing availability of sensing devices has made the possibility of context-aware pervasive computing applications real. However, constructing this software requires ext...
Seth Holloway, Drew Stovall, Jorge Lara-Garduno, C...