Sciweavers

1131 search results - page 202 / 227
» Logic Programming, Functional Programming, and Inductive Def...
Sort
View
EMSOFT
2004
Springer
14 years 24 days ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
CAISE
1999
Springer
13 years 11 months ago
Towards a Classification Framework for Application Granularity in Workflow Management Systems
The support of process enactment through the use of workflow management systems has gained considerable attention within the last few years. We develop a classification framework c...
Jörg Becker, Michael zur Muehlen
TCS
1998
13 years 7 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
EUROSYS
2009
ACM
14 years 4 months ago
xCalls: safe I/O in memory transactions
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
Haris Volos, Andres Jaan Tack, Neelam Goyal, Micha...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 1 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...