Sciweavers

1359 search results - page 142 / 272
» Black-Box Program Specialization
Sort
View
IJCAI
2003
13 years 10 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...
27
Voted
JTRES
2010
ACM
13 years 9 months ago
Exhaustive testing of safety critical Java
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...
Tomás Kalibera, Pavel Parizek, Michal Maloh...
CONCURRENCY
2008
83views more  CONCURRENCY 2008»
13 years 9 months ago
A definition of and linguistic support for partial quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
CORR
2008
Springer
144views Education» more  CORR 2008»
13 years 9 months ago
Modular Compilation of a Synchronous Language
Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing t...
Annie Ressouche, Daniel Gaffé, Valér...
JAR
2010
95views more  JAR 2010»
13 years 3 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney