A logical theory for interface specification and verification of distributed, concurrent,
interactive, real-time systems is worked out based on a semantic foundation including …

Program logics typically reason about an over-approximation of program behaviour to prove
the absence of bugs. Recently, program logics have been proposed that instead prove the …

Sound over-approximation methods have been proved effective for guaranteeing the
absence of errors, but inevitably they produce false alarms that can hamper the …

In relational verification, judicious alignment of computational steps facilitates proof of
relations between programs using simple relational assertions. Relational Hoare logics …

Deductive verification of hybrid systems (HSs) increasingly attracts more attention in recent
years because of its power and scalability, where a powerful specification logic for HSs is …

We study transformational program logics for correctness and incorrectness that we extend
to explicitly handle both termination and nontermination. We show that the logics are …

Virtual Private Cloud (VPC) has become a widely used cloud computing service, serving as
a foundational web infrastructure for many organizations. Nevertheless, the growing …

This paper presents a proof system for reasoning about execution time bounds for a core
imperative programming language. Proof systems are defined for three different scenarios …

Professor Stephen A. Cook is a pioneer of the theory of computational complexity. His work
on NP-completeness and the P vs. NP problem remains a central focus of this field. Cook …

Blockchain technology has revolutionized various industries by providing secure transaction
mechanisms in a decentralized, trustless environment. In 2014, the Ethereum blockchain …