Sciweavers

8828 search results - page 106 / 1766
» Formal methods in practice
Sort
View
172
Voted
AGTIVE
2007
Springer
15 years 8 months ago
Generating Domain-Specific Model Editors with Complex Editing Commands
Abstract. Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of d...
Gabriele Taentzer, André Crema, René...
FORMATS
2006
Springer
15 years 7 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
127
Voted
ICDCSW
2000
IEEE
15 years 7 months ago
Compositional Verification of a Third Generation Mobile Communication Protocol
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
Sari Leppänen, Matti Luukkainen
FM
2008
Springer
148views Formal Methods» more  FM 2008»
15 years 5 months ago
Precise Interval Analysis vs. Parity Games
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
Thomas Gawlitza, Helmut Seidl
144
Voted
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
15 years 2 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers