In this paper concurrent dynamic logic (CDL) is introduced as an extension of dynamic logic
tailored toward handling concurrent programs. Properties of CDL are discussed, both on the …

Versions of Hoare logic have been introduced to prove partial and total correctness
properties of programs. In this paper it is shown how a Hoare-like proof system for while …

Most trace-based proof systems for networks of processes are known to be incomplete.
Extensions to achieve completeness are generally complicated and cumbersome. In this …

A two stage run time optimization algorithm is presented that combines two well-known
techniques in a Herbrand optimal manner:-Kildall's iterative method for data flow analysis …

A major trend in programming logic concerns proof systems that enable formal reasoning
about program properties. Various notions of completeness were defined and new …

Most trace-based proof systems for networks of processes are known to be incomplete.
Extensions to achieve completeness are generally complicated and cumbersome. In this …

Programming languages have traditionally been defined operationally, axiomatically or
denotationally. This work introduces Two-Level Grammar (TLG) as a programming language …

The usual theory of stacks is not expressive in the sense of Cook; that is, loop invariants
needed to prove programs that use stacks cannot be stated in the logic. We first prove this …

The notion of relative completeness of logics of programs was delineated almost ten years
ago, in particular by Wand, Cook and Clarke. More recently, it has been felt that Cook's …

This paper discusses some fundamental issues related to the construction of semantically
based axiomatic proof systems for reasoning about program behavior. We survey …