We examine modal and temporal logics for processes. In section 1 we introduce concurrent
processes as terms of an algebraic language comprising a few basic operators, as …

This expository paper simplifies and clarifies Steffen's depiction of data flow analysis (dfa) as
model checking: By employing abstract interpretation (ai) to generate program traces and by …

Recent years have seen increasing interest in systems that reason about and manipulate
executable code. Such systems can generally benefit from information about aliasing …

Software Product Line (SPL) engineering is a software engineering paradigm that exploits
the commonality between similar software products to reduce life cycle costs and time-to …

We present trace-based abstract interpretation, a unification of severallines of research on
applying Cousot-Cousot-style abstract interpretation ai tooperational semantics definitions …

In model checking for temporal logic, the correctness of a system with respect to a desired
behavior is verified by checking whether a structure that models the system satisfies a …

Equivalence checking plays a crucial role in formal verification to ensure the correctness of
concurrent systems. However, this method cannot be scaled as easily with the increasing …

Equivalence checking plays a crucial role in formal verification since it is a natural relation
for expressing the matching of a system implementation against its specification. In this …

Verification of a concurrent system can be accomplished by model checking the properties
on a structure representing the system; this structure is, in general, a transition system which …

The box calculus is a process algebra with a simple Petri net semantics. We show that it
provides for the concise translation of parallel programs and for the combination of …