Logics of Programs and Their Applications

Proceedings, Poznan, August 23-29, 1980

herausgegeben von A. Salwicki

Sharpening the characterization of the power of Floyd method.
On proving program correctness by means of stepwise refinement method.
Semantics and implementation of prefixing at many levels.
Nonstandard models in Propositional Dynamic Logic.
On priorities of parallelism: Petri nets under the maximum firing strategy.
On four logics of programs and complexity of their satisfiability problems : Extended abstract.
Are infinite behaviours of parallel system schemata necessary?.
Algorithmic properties of finitely generated structures.
Algebraic semantics and program logics: Algorithmic logic for program trees.
Some model-theoretical properties of logic for programs with random control.
A formal system for parallel programs in discrete time and space.
On the propositional algorithmic theory of arithmetic.
Nonstandard runs of Floyd-provable programs.
On some extensions of dynamic logic.
On algorithmic logic with partial operations.
Towards a theory of parallelism and communications for increasing efficiency in applicative languages.
An operational semantics for CSP.
Programming languages and logics of programs.
Concurrent programs.
Axiomatic approach to the system of files.
A sequent calculus for Kröger logic.
On axiomatization of process logic.
Filtration theorem for dynamic algebras with tests and inverse operator.