Model checking requires a specification of the target system's desirable properties, some of
which are temporal. Formulating a temporal property of the system based on either its …

We describe a reduction from temporal property verification to a program analysis problem.
We produce an encoding which, with the use of recursion and nondeterminism, enables off …

Due to the nature in dealing only with observed executions of a real system, runtime
verification is being pursued as a lightweight verification technique. However, the overhead …

We describe a reduction from temporal property verification to a program analysis problem.
First we present a proof system that, unlike the standard formulation, is more amenable to …

It is important that program maintainers understand important properties of the programs
they modify and ensure that the changes they make do not alter essential properties in …

Runtime verification techniques are used to continuously check whether software execution
satisfies or violates a given correctness property. In this paper, we extend our previous work …

In this paper, we present a new algorithm for partial program verification that runs in
polynomial time and space. We are interested in checking that a program satisfies a given …

Verification of programs in code-level has attracted more and more attentions since the cost
is high to extract models from source code. Most of the approaches available for code-level …

Program verification tools (such as model checkers and static analyzers) can find many
errors in programs. These tools need formal specifications of correct program behavior, but …

We describe a method for using abstraction to reduce the complexity of temporal-logic
model checking. Using techniques similar to those involved in abstract interpretation, we …