Efficient CTL* Model Checking for Analysis of Rainbow Designs
Advances in Hardware Design and Verification: IFIP TC10 WG10. 5 International …, 1997•Springer
We describe an efficient implementation of a CTL* model-checking algorithm based on
alternating automata. We use this to check properties of an asynchronous micropipeline
design described in the Rainbow framework, which operates at the micropipeline level and
leads to compact models of the hardware. We also use alternating automata to characterise
the expressive power and model-checking complexity for sub-logics of CTL*.
alternating automata. We use this to check properties of an asynchronous micropipeline
design described in the Rainbow framework, which operates at the micropipeline level and
leads to compact models of the hardware. We also use alternating automata to characterise
the expressive power and model-checking complexity for sub-logics of CTL*.
Abstract
We describe an efficient implementation of a CTL* model-checking algorithm based on alternating automata. We use this to check properties of an asynchronous micropipeline design described in the Rainbow framework, which operates at the micropipeline level and leads to compact models of the hardware. We also use alternating automata to characterise the expressive power and model-checking complexity for sub-logics of CTL*.
Springer
Showing the best result for this search. See all results