Sciweavers

5863 search results - page 169 / 1173
» On Model-Checking of P Systems
Sort
View
ICSE
2009
IEEE-ACM
16 years 7 months ago
Learning operational requirements from goal models
Goal-oriented methods have increasingly been recognised as an effective means for eliciting, elaborating, analysing and specifying software requirements. A key activity in these a...
Alessandra Russo, Dalal Alrajeh, Jeff Kramer, Seba...
SAS
2009
Springer
119views Formal Methods» more  SAS 2009»
16 years 7 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
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
160
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...