As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Bounded model checking as a complementary approach to BDD based symbolic model checking applies satisfiability checking to the verification of temporal properties, especially, for efficient error detection. The successes of bounded model checking have led to extensive research on bounded semantics for various (fragments of) temporal logics such as ACTL, ECTL, and ACTL*. We in this paper further study AeCTL formulas (universal fragment of extended Computation Tree Logic) in light of bounded semantics. On the theoretical aspect, we propose a bounded correctness checking algorithm for AeCTL properties. On the practical aspect, we apply the bounded semantics of AeCTL to derive a SAT-based characterization of AeCTL properties.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.