On-The-Fly Path Reduction

Authors:
Sebastian Biallas;Jörg Brauer;Dominique Gückel;Stefan Kowalewski
Affiliations:
Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany;Embedded Software Laboratory, RWTH Aachen University, Aachen, Germany
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2011

Citing 11
Cited 0

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Branching time and abstraction in bisimulation semantics

Journal of the ACM (JACM)
Progress on the State Explosion Problem in Model Checking

Informatics - 10 Years Back. 10 Years Ahead.
The Engineering of a Model Checker: The Gnu i-Protocol Case Study Revisited

Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
Static Analysis for State-Space Reductions Preserving Temporal Logics

Formal Methods in System Design
Explaining abstract counterexamples

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
A dead variable analysis for explicit model checking

Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Dynamic Path Reduction for Software Model Checking

IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
On-the-fly dynamic dead variable analysis

Proceedings of the 14th international SPIN conference on Model checking software
Application of static analyses for state-space reduction to the microcontroller binary code

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Path reduction is a well-known technique to alleviate the state-explosion problem incurred by explicit-state model checking, its key idea being to store states only at predetermined breaking points. This paper presents an adaptation of this technique which detects breaking points on-the-fly during state-space generation. This method is especially suitable for the detection of breaking points in systems where static analyses yield coarse over-approximations. We evaluate the effectiveness of this technique by applying it to binary code verification.