Paper Info
Title
Tableau Recycling
Abstract
In this paper we improve a model checking algorithm based on the tableau method of Stirling and Walker. The algorithm proves whether a property expressed in the modal mu-calculus holds for a state in a finite transition system. It makes subsequent use of subtableaux which were calculated earlier in the proof run. These subtableaux are reduced to expressions. Examples show that both size of tableaux and execution time of the algorithm are reduced.
Year
DOI
Venue
1992
10.1007/3-540-56496-9_26
CAV
Keywords
DocType
ISBN
Tableau Recycling
Conference
3-540-56496-9
Citations 
PageRank 
References 
2
0.49
5
Authors
1
Name
Order
Citations
PageRank
Angelika Mader119919.44