Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Bounded Correctness Checking of the Universal Fragment of eCTL

View through CrossRef
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.
Title: Bounded Correctness Checking of the Universal Fragment of eCTL
Description:
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.

Related Results

Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
Abstract Model-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as...
Bounded Model Checking of Continuous Stochastic Logic
Bounded Model Checking of Continuous Stochastic Logic
Model checking continuous stochastic logic has been proven to be a powerful technique for analyzing the dependability and performance of stochastic systems. The state space explosi...
COVID-19 Vaccine Fact-Checking Posts on Facebook: Observational Study (Preprint)
COVID-19 Vaccine Fact-Checking Posts on Facebook: Observational Study (Preprint)
BACKGROUND Effective interventions aimed at correcting COVID-19 vaccine misinformation, known as fact-checking messages, are needed to combat the mounting a...
Evolution of a course on model checking for practical applications
Evolution of a course on model checking for practical applications
Although model checking is expected as a practical formal verification approach for its automatic nature, it still suffers from difficulties in writing the formal descriptions to b...
Clock monitoring is associated with age-related decline in time-based prospective memory
Clock monitoring is associated with age-related decline in time-based prospective memory
AbstractIn laboratory time-based prospective memory tasks, older adults typically perform worse than younger adults do. It has been suggested that less frequent clock checking due ...
Bounded model checking for asynchronous concurrent systems
Bounded model checking for asynchronous concurrent systems
Complex hardware systems become more and more ubiquitous in mission critical applications such as military, satellite, and medical to name but a few. In such applications, reliabil...
Proofs of Correctness
Proofs of Correctness
AbstractA proof of correctness is a mathematical proof that a computer program or a part thereof will, when executed, yield correct results, i.e. results fulfilling specific requir...

Back to Top