Sciweavers

555 search results - page 29 / 111
» Complexity of Operations on Cofinite Languages
Sort
View
IJWGS
2006
125views more  IJWGS 2006»
13 years 7 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
SIGMOD
2003
ACM
147views Database» more  SIGMOD 2003»
14 years 7 months ago
Formal semantics and analysis of object queries
Modern database systems provide not only powerful data models but also complex query languages supporting powerful features such as the ability to create new database objects and ...
Gavin M. Bierman
GG
2008
Springer
13 years 8 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 2 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
COGSCI
2004
105views more  COGSCI 2004»
13 years 7 months ago
Intention, interpretation and the computational structure of language
I show how a conversational process that takes simple, intuitively meaningful steps may be understood as a sophisticated computation that derives the richly detailed, complex repr...
Matthew Stone