Minimizing Counterexample of ACTL Property

Shen, ShengYu and Qin, Ying and Li, SiKun Minimizing Counterexample of ACTL Property., 2005 . In 13th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'05), Saarbrücken (Germany), 3-6 October 2005. [Conference paper]

Preview

PDF charme05.pdf Download (124kB) | Preview

English 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.

Item type:	Conference paper
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.
Depositing user:	ShengYu Shen
Date deposited:	01 Aug 2006
Last modified:	02 Oct 2014 12:04
URI:	http://hdl.handle.net/10760/7865

References

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.

Downloads

Actions (login required)

View Item