We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
Aleksandar Nanevski, Paul Govereau, Greg Morrisett
Some initiatives towards Future Internet, e.g., GENI, DARPA’s Active Networks, argue the need for programmability of the network components. Some other initiatives extend this w...
Vagan Y. Terziyan, Dmytro Zhovtobryukh, Artem Kata...
Earth Science Markup Language (ESML) is efficient and effective in representing scientific data in an XML-based formalism. However, features of the data being represented are no...
L. Ian Lumb, J. I. Lederman, J. R. Freemantle, Kei...
An approach to extend process monitoring with the help of information agents (IA) handling semantic data is presented in this paper. According to this approach, an operator of a pr...
Teppo Pirttioja, Ilkka Seilonen, Antti Pakonen, Aa...
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...