Minimizing Counterexample of ACTL Property

Shen, ShengYu and Qin, Ying and Li, SiKun (2005) Minimizing Counterexample of ACTL Property. In Proceedings 13th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'05) LNCS 3725, pp. 393-397, Saarbrücken (Germany).

Full text available as: PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

Counterexample minimization tries to remove irrelevant variables from counterexamples, such that they are easier to be understood. For the first time, we proposes a novel approach to minimize looplike and path-like counterexamples of ACTL properties. For a counterexample s0 . . . sk, our algorithm tries to extract a succinct cube sequence c0 . . . ck, such that paths run through c0 . . . ck are all valid counterexamples. Experimental result shows that our algorithm can significantly minimize ACTL counterexamples.

Keywords:	Model Checking Counterexample Minimization
Subjects:	L. Information technology and library technology. > LJ. Software. L. Information technology and library technology. > LK. Software methodologies and engineering.
ID Code:	6790
Deposited By:	Shen, ShengYu
Deposited On:	01 August 2006
All fields:	Show all fields

K.L.McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.

K. Ravi and F. Somenzi. Minimal assignments for bounded model checking. In TACAS’04,LNCS 2988, pages 31-45, 2004.

Archive Staff Only: edit this record