780 search results - page 150 / 156 » Case Study: Model Transformations for Time-triggered Languag... |
129
click to vote
OOPSLA
2004
Springer
15 years 7 months ago
2004
Springer
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
113
click to vote
TSE
2011
14 years 8 months ago
2011
Abstract— The Publish-Subscribe (P/S) communication paradigm fosters high decoupling among distributed components. This facilitates the design of dynamic applications, but also i...
206
click to vote
FOSSACS
2011
Springer
14 years 5 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
120
click to vote
SIGSOFT
2007
ACM
16 years 2 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
120
Voted
HYBRID
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we present a new design methodology for synchronous reactive systems, based on a clear separation between control and data flow parts. This methodology allows to fa...