Computer Science – Logic in Computer Science
Scientific paper
2009-12-10
EPTCS 13, 2009, pp. 27-39
Computer Science
Logic in Computer Science
Scientific paper
10.4204/EPTCS.13.3
This paper presents a novel approach for augmenting proof-based verification with performance-style analysis of the kind employed in state-of-the-art model checking tools for probabilistic systems. Quantitative safety properties usually specified as probabilistic system invariants and modeled in proof-based environments are evaluated using bounded model checking techniques. Our specific contributions include the statement of a theorem that is central to model checking safety properties of proof-based systems, the establishment of a procedure; and its full implementation in a prototype system (YAGA) which readily transforms a probabilistic model specified in a proof-based environment to its equivalent verifiable PRISM model equipped with reward structures. The reward structures capture the exact interpretation of the probabilistic invariants and can reveal succinct information about the model during experimental investigations. Finally, we demonstrate the novelty of the technique on a probabilistic library case study.
No associations
LandOfFree
Quantitative Safety: Linking Proof-Based Verification with Model Checking for Probabilistic Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantitative Safety: Linking Proof-Based Verification with Model Checking for Probabilistic Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantitative Safety: Linking Proof-Based Verification with Model Checking for Probabilistic Systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-594215