Sciweavers

5377 search results - page 235 / 1076
» Programming Languages For Interactive Computing
Sort
View
CP
2005
Springer
15 years 6 months ago
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
Philippe Jégou, Samba Ndiaye, Cyril Terriou...
CORR
2008
Springer
93views Education» more  CORR 2008»
15 years 1 months ago
A computer verified, monadic, functional implementation of the integral
We provide a computer verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the...
Russell O'Connor, Bas Spitters
POPL
2005
ACM
16 years 1 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid
ITICSE
2005
ACM
15 years 6 months ago
Interactive manipulation of regular objects with FAdo
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...
Nelma Moreira, Rogério Reis
ASPLOS
2000
ACM
15 years 5 months ago
Thread Level Parallelism and Interactive Performance of Desktop Applications
Multiprocessing is already prevalent in servers where multiple clients present an obvious source of thread-level parallelism. However, the case for multiprocessing is less clear f...
Krisztián Flautner, Richard Uhlig, Steven K...