Sciweavers

1895 search results - page 150 / 379
» Using ATL for Checking Models
Sort
View
FM
2005
Springer
112views Formal Methods» more  FM 2005»
15 years 10 months ago
Dynamic Component Substitutability Analysis
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
Natasha Sharygina, Sagar Chaki, Edmund M. Clarke, ...
149
Voted
RE
2008
Springer
15 years 4 months ago
Requirements Capture with RCAT
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
Margaret H. Smith, Klaus Havelund
VMCAI
2010
Springer
16 years 2 months ago
Best Probabilistic Transformers
This paper investigates relative precision and optimality of analyses for concurrent probabilistic systems. Aiming at the problem at the heart of probabilistic model checking ? com...
Björn Wachter, Lijun Zhang
WLP
2004
Springer
15 years 10 months ago
Solving Alternating Boolean Equation Systems in Answer Set Programming
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
Misa Keinänen, Ilkka Niemelä
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
15 years 8 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu