8109 search results - page 186 / 1622 » A Model of Component-Based Programming |
137
click to vote
OOPSLA
2004
Springer
15 years 10 months ago
2004
Springer
The main goal of this PhD thesis is to propose and implement a methodology for the construction of programs based on the SCOOP model, and for modular reasoning about their correct...
127
click to vote
FMCAD
2006
Springer
15 years 8 months ago
2006
Springer
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
126
click to vote
WSC
1998
15 years 6 months ago
1998
We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
111
click to vote
EACL
1989
ACL Anthology
15 years 6 months ago
1989
ACL Anthology
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
120
click to vote
CP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...