Exploiting Transition Locality in the Disk Based Murϕ Verifier

Penna, Giuseppe Della; Intrigila, Benedetto; Tronci, Enrico; Zilli, Marisa Venturini

doi:10.1007/3-540-36126-x_13

Cited by 13 publications

(24 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was done as illustrated, respectively, in [9] and [2]. The resulting verifiers are called, respectively, Cached-Murϕ and Disk-Murϕ.…”

Section: Resultsmentioning

confidence: 99%

“…Our goal is to devise a serialization scheme for the RAM based state exploration algorithm presented in [9] (CBF, for Cached Breadth First visit in the following) and the disk based state exploration algorithm presented in [2] (DBF, for Disk Breadth First visit in the following). Figure 1 shows the algorithm and data structures used by a Breadth First (BF) visit.…”

Section: State Space Exploration Algorithmsmentioning

confidence: 99%

“…In this section we present a serialization scheme for the RAM based state space exploration algorithm CBF [9] and the disk based state space exploration algorithm DBF [2].…”

Section: Course a Serialization Scheme For Algorithms A And B Is Intementioning

confidence: 99%

“…Disk based verification algorithms [4,5,8,3,2] turn out to be very useful to counteract state explosion (i.e. the huge amount of memory required to complete state space exploration).…”

Section: Introductionmentioning

confidence: 99%

“…-We present (Section 3) an integration scheme (we call it serialization scheme) for the RAM based verification algorithm presented in [9] and the disk based verification algorithm presented in [2]. -We present (Section 4) experimental results on using our serialization scheme implemented within the Murϕ verifier.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Integrating RAM and Disk Based Verification within the Murϕ Verifier

Penna

Intrigila

Melatti

et al. 2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a verification algorithm that can automatically switch from RAM based verification to disk based verification without discarding the work done during the RAM based verification phase. This avoids having to choose beforehand the proper verification algorithm. Our experimental results show that typically our integrated algorithm is as fast as (sometime faster than) the fastest of the two base (i.e. RAM based and disk based) verification algorithms.

show abstract

“…This was done as illustrated, respectively, in [9] and [2]. The resulting verifiers are called, respectively, Cached-Murϕ and Disk-Murϕ.…”

Section: Resultsmentioning

confidence: 99%

Section: State Space Exploration Algorithmsmentioning

confidence: 99%

“…In this section we present a serialization scheme for the RAM based state space exploration algorithm CBF [9] and the disk based state space exploration algorithm DBF [2].…”

Section: Course a Serialization Scheme For Algorithms A And B Is Intementioning

confidence: 99%

“…Disk based verification algorithms [4,5,8,3,2] turn out to be very useful to counteract state explosion (i.e. the huge amount of memory required to complete state space exploration).…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Integrating RAM and Disk Based Verification within the Murϕ Verifier

Penna

Intrigila

Melatti

et al. 2003

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Exploiting Hub States in Automatic Verification

Penna

Melatti

Intrigila

et al. 2005

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage

Hartmanns

Hermanns

2015

Automated Technology for Verification and Analysis

View full text Add to dashboard Cite

The applicability of model checking is hindered by the state space explosion problem in combination with limited amounts of main memory. To extend its reach, the large available capacities of secondary storage such as hard disks can be exploited. Due to the specific performance characteristics of secondary storage technologies, specialised algorithms are required. In this paper, we present a technique to use secondary storage for probabilistic model checking of Markov decision processes. It combines state space exploration based on partitioning with a block-iterative variant of value iteration over the same partitions for the analysis of probabilistic reachability and expected-reward properties. A sparse matrix-like representation is used to store partitions on secondary storage in a compact format. All file accesses are sequential, and compression can be used without affecting runtime. The technique has been implemented within the Modest Toolset. We evaluate its performance on several benchmark models of up to 3.5 billion states. In the analysis of time-bounded properties on real-time models, our method neutralises the state space explosion induced by the time bound in its entirety.

show abstract

Exploiting Transition Locality in the Disk Based Murϕ Verifier

Cited by 13 publications

References 15 publications

Integrating RAM and Disk Based Verification within the Murϕ Verifier

Integrating RAM and Disk Based Verification within the Murϕ Verifier

Exploiting Hub States in Automatic Verification

Explicit Model Checking of Very Large MDP Using Partitioning and Secondary Storage

Contact Info

Product

Resources

About