Sciweavers

1472 search results - page 123 / 295
» On Model Checking Infinite-State Systems
Sort
View
TSE
2011
134views more  TSE 2011»
14 years 11 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
127
Voted
ADAEUROPE
2008
Springer
15 years 6 months ago
On the Timed Automata-Based Verification of Ravenscar Systems
The Ravenscar profile for Ada enforces several restrictions on the usage of general-purpose tasking constructs, thereby facilitating most analysis tasks and in particular functiona...
Iulian Ober, Nicolas Halbwachs
MODELS
2007
Springer
15 years 10 months ago
A Metamodel-Based Approach for Analyzing Security-Design Models
Abstract We have previously proposed an expressive UML-based language for constructing and transforming security-design models, which are models that combine design specifications...
David A. Basin, Manuel Clavel, Jürgen Doser, ...
146
Voted
ECSA
2010
Springer
15 years 4 months ago
Linking Design Decisions to Design Models in Model-Based Software Development
Abstract. Numerous design decisions are made in model-based software development which often are not documented explicitly. Hence, the design knowledge is 'in the designers mi...
Patrick Könemann, Olaf Zimmermann
145
Voted
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 7 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...