Analyzing multi-threaded programs is hard due to the number of thread interleavings. Partial
orders can be used for modeling and analyzing multi-threaded programs. However, there is …

Abstract Concurrent Kleene Algebra (CKA) was introduced by Hoare, Moeller, Struth and
Wehrman in 2009 as a framework to reason about concurrent programs. We prove that the …

Lazy sequentialization is one of the most effective approaches for the bounded verification of
concurrent programs. Existing tools assume sequential consistency (SC), thus the feasibility …

Concurrent Kleene algebras support equational reasoning about computing systems with
concurrent behaviours. Their natural semantics is given by series (parallel) rational pomset …

Automatically verifying multi-threaded programs is difficult because of the vast number of
thread interleavings, a problem aggravated by weak memory consistency. Partial orders can …

Sequentialization translates concurrent programs into equivalent nondeterministic
sequential programs so that the different concurrent schedules no longer need to be …

As multi-core processors gain popularity in safety-critical systems, multi-threaded programs
are increasingly used. Concurrency introduces a new level of complexity into software …

Sequentialization is one of the most promising approaches for the symbolic analysis of
concurrent programs. However, existing sequentializations assume sequential consistency …

Cyber physical systems are usually complex systems which are often critical, meaning their
failure can have significant negative impacts on human lives. A key point in their …

We describe an approach to design static analysis and verification tools for concurrent
programs that separates intra-thread computation from inter-thread communication by …