Sciweavers

3387 search results - page 389 / 678
» Model-Checking for Real-Time Systems
Sort
View
194
Voted
SAS
2009
Springer
119views Formal Methods» more  SAS 2009»
16 years 8 months ago
Abstraction Refinement for Quantified Array Assertions
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
Mohamed Nassim Seghir, Andreas Podelski, Thomas Wi...
RTSS
2008
IEEE
16 years 1 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
179
Voted
IPPS
2007
IEEE
16 years 1 months ago
FixD : Fault Detection, Bug Reporting, and Recoverability for Distributed Applications
Model checking, logging, debugging, and checkpointing/recovery are great tools to identify bugs in small sequential programs. The direct application of these techniques to the dom...
Cristian Tapus, David A. Noblet
170
Voted
FMICS
2007
Springer
16 years 1 months ago
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization
Using PVS (Prototype Verification System), we prove that an industry designed scheduler for a smartcard personalization machine is safe and optimal. This scheduler has previously ...
Leonard Lensink, Sjaak Smetsers, Marko C. J. D. va...
TASE
2008
IEEE
15 years 7 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen