Logics of Programs and Their Applications

A. Salwicki

ISBN 10: 3540119817 / ISBN 13: 9783540119814

Published by Springer Berlin Heidelberg, J.B. Metzler Jan 1983, 1983

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 336 pp. Englisch.

Seller Inventory # 9783540119814

Bibliographic Details

• Title: Logics of Programs and Their Applications
• Publisher: Springer Berlin Heidelberg, J.B. Metzler Jan 1983
• Publication Date: 1983
• Language: English
• ISBN 10: 3540119817
• ISBN 13: 9783540119814
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 19D millimeters 235 millimeters width by 155 millimeters height by 19 millimeters depth
• Weight: 511 grams

About this title

Synopsis

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 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 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.