Sciweavers

5904 search results - page 396 / 1181
» Requirements for a Composition Language
Sort
View
IFIP
2004
Springer
16 years 9 days ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
DOCENG
2003
ACM
16 years 6 days ago
Improving formatting documents by coupling formatting systems
In this paper, we present a framework for coupling an existing formatting system such as SMIL [7] and Madeus [13] with a formatting control system XEF [10]. This framework allows ...
Fateh Boulmaiz, Cécile Roisin, Fréd&...
EWSPT
2003
Springer
16 years 5 days ago
Process Support for Evolving Active Architectures
Long-lived, architecture-based software systems are increasingly important. Effective process support for these systems depends upon recognising their compositional nature and the ...
R. Mark Greenwood, Dharini Balasubramaniam, Sorana...
IFL
2003
Springer
128views Formal Methods» more  IFL 2003»
16 years 4 days ago
With-Loop Scalarization - Merging Nested Array Operations
Construction of complex array operations by composition of more basic ones allows for abstract and concise specifications of algorithms. Unfortunately, na¨ıve compilation of suc...
Clemens Grelck, Sven-Bodo Scholz, Kai Trojahner
EICS
2009
ACM
15 years 11 months ago
Support for authoring service front-ends
The success of service-oriented computing has important implications on how people develop user interfaces. This paper discusses a method for supporting the development of interac...
Fabio Paternò, Carmen Santoro, Lucio Davide...