Model checking büchi pushdown systems

Authors:
Juncao Li;Fei Xie;Thomas Ball;Vladimir Levin
Affiliations:
Department of Computer Science, Portland State University, Portland, OR;Department of Computer Science, Portland State University, Portland, OR;Microsoft Corporation, Redmond, WA;Microsoft Corporation, Redmond, WA
Venue:
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 10
Cited 1

Computer-aided verification of coordinating processes: the automata-theoretic approach

Computer-aided verification of coordinating processes: the automata-theoretic approach
Model checking

Model checking
Static Partial Order Reduction

TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Reachability Analysis of Pushdown Automata: Application to Model-Checking

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Testing closed-source binary device drivers with DDT

USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
An automata-theoretic approach to hardware/software co-verification

An automata-theoretic approach to hardware/software co-verification
An automata-theoretic approach to hardware/software co-verification

FASE'10 Proceedings of the 13th international conference on Fundamental Approaches to Software Engineering
Efficient reachability analysis of büchi pushdown systems for hardware/software co-verification

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification

Formalizing hardware/software interface specifications

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an approach to model checking Linear Temporal Logic (LTL) properties of Büchi Pushdown Systems (BPDS). Such BPDS models are suitable for Hardware/Software (HW/SW) co-verification. Since a BPDS represents the asynchronous transitions between hardware and software, some transition orders are unnecessary to be explored in verification. We design an algorithm to reduce BPDS transition rules, so that these transition orders will not be explored by model checkers. Our reduction algorithm is applied at compile time; therefore, it is also suitable to runtime techniques such as co-simulation. As a proof of concept, we have implemented our approach in our co-verification tool, CoVer. CoVer not only verifies LTL properties on the BPDS models represented by Boolean programs, but also accepts assumptions in LTL formulae. The evaluation demonstrates that our reduction algorithm can reduce the verification cost by 80% in time usage and 35% in memory usage on average.