Sciweavers

4426 search results - page 414 / 886
» Concurrent Constraint Programming
Sort
View
AMAST
1998
Springer
15 years 11 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
EOR
2010
113views more  EOR 2010»
15 years 7 months ago
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its v...
Marie-Christine Plateau, Yasmin A. Rios-Solis
SMALLTALK
2007
Springer
16 years 1 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
ICFEM
2004
Springer
16 years 28 days ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
AAAI
2008
15 years 10 months ago
A Reductive Semantics for Counting and Choice in Answer Set Programming
In a recent paper, Ferraris, Lee and Lifschitz conjectured that the concept of a stable model of a first-order formula can be used to treat some answer set programming expressions...
Joohyung Lee, Vladimir Lifschitz, Ravi Palla