Sciweavers

1239 search results - page 58 / 248
» Applying Model Checking to Concurrent UML Models
Sort
View
ISSTA
1998
ACM
14 years 1 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
ASPDAC
2006
ACM
113views Hardware» more  ASPDAC 2006»
14 years 2 months ago
Transition-based coverage estimation for symbolic model checking
— Lack of complete formal specification is one of the major obstacles for the deployment of model checking. Coverage estimation addresses this issue by revealing the unverified...
Xingwen Xu, Shinji Kimura, Kazunari Horikawa, Take...
VMCAI
2010
Springer
14 years 6 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
CAV
2006
Springer
110views Hardware» more  CAV 2006»
14 years 17 days ago
Improving Pushdown System Model Checking
Abstract. In this paper, we reduce pushdown system (PDS) model checking to a graphtheoretic problem, and apply a fast graph algorithm to improve the running time for model checking...
Akash Lal, Thomas W. Reps
UML
2005
Springer
14 years 2 months ago
Use Cases, Actions, and Roles
Abstract. Use Cases are widely used for specifying systems, but their semantics are unclear in ways that make it difficult to apply use cases to complex problems. In this paper, we...
Guy Genilloud, William F. Frank, Gonzalo Gé...