Sciweavers

20 search results - page 2 / 4
» Solvability in Resource Lambda-Calculus
Sort
View
FUIN
2010
111views more  FUIN 2010»
13 years 3 months ago
Linearity, Non-determinism and Solvability
We study the notion of solvability in the resource calculus, an extension of the -calculus modelling resource consumption. Since this calculus is non-deterministic, two different ...
Michele Pagani, Simona Ronchi Della Rocca
ICFP
2003
ACM
14 years 6 months ago
Dynamic rebinding for marshalling and update, with destruct-time?
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Gavin M. Bierman, Michael W. Hicks, Peter Sewell, ...
TCS
2010
13 years 28 days ago
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
Andreas Darmann, Ulrich Pferschy, Joachim Schauer
FORMATS
2003
Springer
13 years 11 months ago
Folk Theorems on the Determinization and Minimization of Timed Automata
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
Stavros Tripakis
JSA
2010
95views more  JSA 2010»
13 years 1 months ago
Multi-level reconfigurable architectures in the switch model
In this paper we study multi-level dynamically reconfigurable architectures. These are extensions of standard reconfigurable architectures where ordinary reconfiguration operation...
Sebastian Lange, Martin Middendorf