Sciweavers

2702 search results - page 31 / 541
» Practically Applicable Formal Methods
Sort
View
RTS
2008
131views more  RTS 2008»
15 years 5 months ago
Formal verification of multitasking applications based on timed automata model
The aim of this paper is to show, how a multitasking application running under a real-time operating system compliant with an OSEK/VDX standard can be modeled by timed automata. Th...
Libor Waszniowski, Zdenek Hanzálek
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 6 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
TFM
2009
Springer
113views Formal Methods» more  TFM 2009»
16 years 28 days ago
Teaching Concurrency: Theory in Practice
Teaching courses that rely on sound mathematical principles is nowadays a challenging task at many universities. On the one hand there is an increased demand for educating students...
Luca Aceto, Anna Ingólfsdóttir, Kim ...
ISOLA
2010
Springer
15 years 4 months ago
Seamless Model-Driven Development Put into Practice
SMT—building flexible yet efficient abstraction/refinement solvers. International Journal on Software Tools for Technology Transfer, 12(1):23–37, February 2010. Wolfgang Hab...
Wolfgang Haberl, Markus Herrmannsdoerfer, Stefan K...
NFM
2011
306views Formal Methods» more  NFM 2011»
15 years 1 months ago
Generalized Rabin(1) Synthesis with Applications to Robust System Synthesis
Synthesis of finite-state machines from linear-time temporal logic (LTL) formulas is an important formal specification debugging technique for reactive systems and can quickly ge...
Rüdiger Ehlers