We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
Farhad Arbab, Tom Chothia, Sun Meng, Young-Joo Moo...
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
This paper is based on the results from the project PROTEUS sponsored by the French Ministry of Economy, Finance and Industry and the Federal Ministry of Education and Research of...
Thomas Bangemann, Xavier Rebeuf, Denis Reboul, And...
Abstract. In future ubiquitous communication environments, users expect to move freely while continuously interacting with the available applications through a variety of devices. ...
Anders Nickelsen, Miquel Martin, Hans-Peter Schwef...