CCE
2007
14 years 17 days ago
2007
Design and control of recycle systems must be integrated at an early design stage. By placing together the pieces of the design puzzle we developed a novel methodology that allows...
MSV
2007
14 years 2 months ago
2007
Abstract—Service requests are the origin of every service provisioning process and therefore the entities to be considered first. Similar to Physics and Engineering Sciences, ser...
CONCUR
1995
Springer
14 years 4 months ago
1995
Springer
We provide a category theoretic reformulation of control structures, which avoids explicit reference to names. The basis of the formulation is what we call a binding structure, wh...
EUROCOLT
1997
Springer
14 years 4 months ago
1997
Springer
In any learnability setting, hypotheses are conjectured from some hypothesis space. Studied herein are the influence on learnability of the presence or absence of certain control ...
AICCSA
2001
IEEE
14 years 4 months ago
2001
IEEE
In the visual programming domain, the stress of research is laid on the use of visual formalism, which is considered to be more intuitive than the textual formalism, in the progra...
BIRTHDAY
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
ICDCS
1990
IEEE
14 years 4 months ago
1990
IEEE
This paper develops some control structures suitable for composing fault-tolerant distrib uted applications using atomic actions (atomic transactions) as building blocks, and then...
KBSE
2000
IEEE
14 years 5 months ago
2000
IEEE
Little-JIL, a new language for programming the coordination of agents is an executable, high-level process programming language with a formal (yet graphical) syntax and rigorously...
CPAIOR
2005
Springer
14 years 6 months ago
2005
Springer
Hybrid algorithms combining local and systematic search often use nondeterminism in fundamentally different ways. They may differ in the strategy to explore the search tree and/o...
MFCS
2007
Springer
14 years 6 months ago
2007
Springer
In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt h...