Logics of Programs and Their Applications: Proceedings, Poznan, August 23–29, 1980

Sharpening the characterization of the power of Floyd method....Pages 1-26
On proving program correctness by means of stepwise refinement method....Pages 27-44
Semantics and implementation of prefixing at many levels....Pages 45-80
Nonstandard models in Propositional Dynamic Logic....Pages 81-85
On priorities of parallelism: Petri nets under the maximum firing strategy....Pages 86-97
On four logics of programs and complexity of their satisfiability problems : Extended abstract....Pages 98-107
Are infinite behaviours of parallel system schemata necessary?....Pages 108-117
Algorithmic properties of finitely generated structures....Pages 118-131
Algebraic semantics and program logics: Algorithmic logic for program trees....Pages 132-147
Some model-theoretical properties of logic for programs with random control....Pages 148-155
A formal system for parallel programs in discrete time and space....Pages 156-165
On the propositional algorithmic theory of arithmetic....Pages 166-185
Nonstandard runs of Floyd-provable programs....Pages 186-204
On some extensions of dynamic logic....Pages 205-212
On algorithmic logic with partial operations....Pages 213-223
Towards a theory of parallelism and communications for increasing efficiency in applicative languages....Pages 224-249
An operational semantics for CSP....Pages 250-252
Programming languages and logics of programs....Pages 253-257
Concurrent programs....Pages 258-269
Axiomatic approach to the system of files....Pages 270-294
A sequent calculus for Kröger logic....Pages 295-303
On axiomatization of process logic....Pages 304-313
Filtration theorem for dynamic algebras with tests and inverse operator....Pages 314-324