Sciweavers

1895 search results - page 136 / 379
» Using ATL for Checking Models
Sort
View
155
Voted
ICFEM
2007
Springer
15 years 8 months ago
Automating Refinement Checking in Probabilistic System Design
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...
Carlos Gonzalia, Annabelle McIver
ISOLA
2010
Springer
15 years 3 months ago
Enforcing Applicability of Real-Time Scheduling Theory Feasibility Tests with the Use of Design-Patterns
Abstract. This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory...
Alain Plantec, Frank Singhoff, Pierre Dissaux, J&e...
RTSS
2008
IEEE
15 years 11 months ago
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...
Alessandro Cimatti, Luigi Palopoli, Yusi Ramadian
IWFM
2000
107views Formal Methods» more  IWFM 2000»
15 years 6 months ago
A Comparison of Three Model Checkers Applied to a Distributed Database Problem
ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
A. J. Currie
SIGSOFT
2006
ACM
16 years 5 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...