Computing Invariants for Parameter Abstraction

Authors:
Yi Lv;Huimin Lin;Hong Pan
Affiliations:
State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Bo;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Bo;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Bo
Venue:
MEMOCODE '07 Proceedings of the 5th IEEE/ACM International Conference on Formal Methods and Models for Codesign
Year:
2007

Citing 0
Cited 4

Going with the flow: parameterized verification using message flows

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Automatic non-interference lemmas for parameterized model checking

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Specification-based Verification in a Distributed Shared Memory Simulation Model

Simulation
Parameterized verification of deadlock freedom in symmetric cache coherence protocols

Proceedings of the International Conference on Formal Methods in Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new approach to combining invariants computing and guard strengthening methods is presented in the context of parameter abstraction for parameterized model checking of cache coherence protocols. The approach uses a small instance of a parameterized protocol as a "reference model" to compute candidate invariants. References to a specific node in these candidate invariants are then abstracted away, and the resulting formulas are used to strengthen guards of the transition rules in the abstract node. The correctness of the approach is guaranteed by symmetry which exists in many parameterized systems. A number of case studies have been carried out to illustrate the effectiveness of the approach. During the process a data consistency error was identified and fixed in the German 2004 cache coherence protocol.