Sciweavers

644 search results - page 105 / 129
» Precedence Automata and Languages
Sort
View
RTA
2007
Springer
14 years 2 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
DFG
2004
Springer
14 years 1 months ago
Executable HybridUML and Its Application to Train Control Systems
Abstract. In this paper, the authors introduce an extension of UML for the purpose of hybrid systems modeling. The construction uses the profile mechanism of UML 2.0 which is the ...
Kirsten Berkenkötter, Stefan Bisanz, Ulrich H...
FCT
1991
Springer
14 years 14 hour ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
SDL
2001
110views Hardware» more  SDL 2001»
13 years 10 months ago
Timed Extensions for SDL
In this paper we propose some extensions necessary to enable the speci cation and description language SDL to become an appropriate formalism for the design of real-time and embedd...
Marius Bozga, Susanne Graf, Laurent Mounier, Iulia...
DAGSTUHL
2007
13 years 10 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis