Counterexample-based refinement for a boundedness test for CFSM languages

Authors:
Stefan Leue;Wei Wei
Affiliations:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Konstanz, Germany
Venue:
SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Year:
2005

Citing 7
Cited 3

Efficient distributed implementation of semi-replicated synchronous groupware

Proceedings of the 9th annual ACM symposium on User interface software and technology
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Improving the Precision of INCA by Eliminating Solutions with Spurious Cycles

IEEE Transactions on Software Engineering
Relative Completeness of Abstraction Refinement for Software Model Checking

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Spin model checker, the: primer and reference manual

Spin model checker, the: primer and reference manual

Dependency Analysis for Control Flow Cycles in Reactive Communicating Processes

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
A livelock freedom analysis for infinite state asynchronous reactive systems

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
A region graph based approach to termination proofs

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In precursory work we suggested an abstraction-based highly scalable semi-test for the boundedness of Communicating Finite State Machine (CFSM) based modelling and programming languages. We illustrated its application to Promela and UML-RT models. The test is sound with respect to determining boundedness, but may return inconclusive ”counterexamples” when boundedness cannot be established. In this paper we turn to the question how to effectively determine the spuriousness of these counterexamples, and how to refine the abstraction based on the analysis. We employ methods from program analysis and illustrate the application of our refinement method to a number of Promela examples.