2 search results - page 1 / 1 » Tree Schemata and Fair Termination |
SAS
2000
Springer
13 years 8 months ago
2000
Springer
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
KBSE
2005
IEEE
13 years 10 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...