Automated program repair (APR) techniques have shown a promising ability to generate
patches that fix program bugs automatically. Typically such APR tools are dynamic in the …

We study a syntax for specifying quantitative assertions—functions mapping program states
to numbers—for probabilistic program verification. We prove that our syntax is expressive in …

Dynamic automated program repair (APR) techniques, which use test suites for bug
localization and evaluating candidate patches, have promising results. However, many …

In this chapter we retrace the main steps in the development of Hoare's logic and try to
answer the question of what made it a successful approach to program ver ification. To …

Relational Hoare logics (RHL) provide rules for reasoning about relations between
programs. Several RHLs include a rule we call sequential product that infers a relational …

This paper concerns the relation between process algebra and Hoare logic. We investigate
the question whether and how a Hoare logic can be used for reasoning about how data …

We provide a sound and relatively complete Hoare logic for reasoning about partial
correctness of recursive procedures in presence of local variables and the call-by-value …

We overview the logic of Bunched Implications (BI) and Separation Logic (SL) from a
perspective inspired by Hiroakira Ono's algebraic approach to substructural logics. We …

Abstract The Clock Constraint Specification Language (CCSL) is a clock-based specification
language for real-time embedded systems. With logical clocks defined as first-class citizens …

Most modern (classical) programming languages support recursion. Recursion has also
been successfully applied to the design of several quantum algorithms and introduced in a …