444 search results - page 15 / 89 » Termination by Abstraction |
BPM
2003
Springer
14 years 24 days ago
2003
Springer
Abstract. We address cross-organizational workflows, such as document workflows, which consist of multiple workflow modules each of which can interact with others by sending and re...
ISPA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. This paper presents an efficient parallel algorithm for volume rendering of large-scale datasets. Our algorithm focuses on an optimization technique, namely early ray te...
SAS
2000
Springer
14 years 21 days ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
FSEN
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
LISP
2008
13 years 9 months ago
2008
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...