Sciweavers

4008 search results - page 467 / 802
» An expressive language of signatures
Sort
View
ICFP
2010
ACM
15 years 7 months ago
Total parser combinators
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion, is described. The library's interface is simil...
Nils Anders Danielsson
ACTA
2010
104views more  ACTA 2010»
15 years 7 months ago
Reachability results for timed automata with unbounded data structures
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
CONCURRENCY
2010
114views more  CONCURRENCY 2010»
15 years 6 months ago
A step towards refining and translating B control annotations to Handel-C
Research augmenting B machines presented at B2007 has demonstrated how fragments of control flow expressed as annotations can be added to associated machine operations, and shown t...
Wilson Ifill, Steve A. Schneider
CORR
2010
Springer
150views Education» more  CORR 2010»
15 years 6 months ago
A Middleware Framework for Constraint-Based Deployment and Autonomic Management of Distributed Applications
We propose a middleware framework for deployment and subsequent autonomic management of component-based applications. An initial deployment goal is specified using a declarative c...
Alan Dearle, Graham N. C. Kirby, Andrew McCarthy
ENTCS
2008
131views more  ENTCS 2008»
15 years 6 months ago
Connector Rewriting with High-Level Replacement Systems
Reo is a language for coordinating autonomous components in distributed environments. Coordination in Reo is performed by circuit-like connectors, which are constructed from primi...
Christian Koehler, Alexander Lazovik, Farhad Arbab