Sciweavers

227 search results - page 25 / 46
» Formal verification of systems with an unlimited number of c...
Sort
View
CAV
2006
Springer
132views Hardware» more  CAV 2006»
14 years 4 days ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
FORMATS
2010
Springer
13 years 6 months ago
Layered Composition for Timed Automata
Abstract. We investigate layered composition for real-time systems modelled as (networks of) timed automata (TA). We first formulate the principles of layering and transition indep...
Ernst-Rüdiger Olderog, Mani Swaminathan
IFM
2005
Springer
100views Formal Methods» more  IFM 2005»
14 years 1 months ago
Embedding the Stable Failures Model of CSP in PVS
We present an embedding of the stable failures model of CSP in the PVS theorem prover. Our work, extending a previous embedding of the traces model of CSP in [6], provides a platfo...
Kun Wei, James Heather
FORMATS
2004
Springer
14 years 1 months ago
Bounded Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
Fang Yu, Bow-Yaw Wang, Yao-Wen Huang
SIGSOFT
2002
ACM
14 years 9 months ago
Secure systems development based on the common criteria: the PalME project
Security is a very important issue in information processing, especially in open network environments like the Internet. The Common Criteria (CC) is the standard requirements cata...
Monika Vetterling, Guido Wimmel, Alexander K. Wi&s...