LTL Model Checking for Recursive Programs

Authors:
Geng-Dian Huang;Lin-Zan Cai;Farn Wang
Affiliations:
Dept. of Electrical Engineering, National Taiwan University,;Dept. of Electrical Engineering, National Taiwan University,;Dept. of Electrical Engineering, National Taiwan University, and Grad. Inst. of Electronic Engineering, National Taiwan University,
Venue:
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Year:
2009

Citing 15
Cited 0

Generalized dominators and post-dominators

POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise interprocedural dataflow analysis via graph reachability

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic model checking using SAT procedures instead of BDDs

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Local model checking for context-free processes

Nordic Journal of Computing
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Efficient Algorithms for Model Checking Pushdown Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A BDD-Based Model Checker for Recursive Programs

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automata-theoretic model checking revisited

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
A SAT characterization of boolean-program correctness

SPIN'03 Proceedings of the 10th international conference on Model checking software
SAT-based summarization for Boolean programs

Proceedings of the 14th international SPIN conference on Model checking software
Complete SAT-based model checking for context-free processes

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
A complete bounded model checking algorithm for pushdown systems

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
F-SOFT: software verification platform

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Proving ∀µ-calculus properties with SAT-based model checking

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a complete algorithm to model check LTL (Linear Temporal Logic) formulas with recursive programs. Our program models are control flow graphs extended with procedure calls. The LTL formulas may then be used to specify constraints on the global variables and the local variables in the current scope. Our algorithm is based on semi-symbolic simulation of control-flow graphs to search for counter-examples. We apply post-dominance relation to reduce the number of the exploration traces. The existence of counter-examples is reduced to Boolean satisfiability while the termination of the exploration is reduced to Boolean unsatisfiability. We report our implementation and experiment.