Sciweavers

1938 search results - page 264 / 388
» Dependable Software
Sort
View
AOSD
2007
ACM
14 years 1 months ago
Highly configurable transaction management for embedded systems
Embedded systems are an important field of research and will gain momentum in the near future. Many of these systems require data management functionality. Due to the resource con...
Mario Pukall, Thomas Leich, Martin Kuhlemann, Mark...
CASES
2007
ACM
14 years 1 months ago
Compiler generation from structural architecture descriptions
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
Florian Brandner, Dietmar Ebner, Andreas Krall
EMSOFT
2007
Springer
14 years 1 months ago
Necessary and sufficient conditions for deterministic desynchronization
Synchronous reactive formalisms associate concurrent behaviors to precise schedules on global clock(s). This allows a non-ambiguous notion of "absent" signal, which can ...
Dumitru Potop-Butucaru, Robert de Simone, Yves Sor...
FOSSACS
2007
Springer
14 years 28 days ago
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
Michael Bauland, Thomas Schneider 0002, Henning Sc...
EUROMICRO
2009
IEEE
14 years 28 days ago
Automated Feature Model-Based Generation of Refinement Transformations
Model-driven application engineering builds on the concept of model transformations. To weave additional refinement parts into an application model, so-called refinement transform...
Lucia Kapová, Thomas Goldschmidt