Expressing program looping in regular dynamic logic

DOI10.1016/0304-3975(82)90071-8zbMath0478.68031OpenAlexW2010360535WikidataQ127363102 ScholiaQ127363102MaRDI QIDQ1161284

Karl Winklmann, Albert R. Meyer

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90071-8

zbMATH Keywords

nondeterminismrandom assignments

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (6)

``During cannot be expressed by ``after ⋮ Role of determinism in query languages for data bases ⋮ More on looping vs. repeating in dynamic logic ⋮ The propositional dynamic logic of deterministic, well-structured programs ⋮ Equivalences among logics of programs ⋮ Decidability of finite probabilistic propositional dynamic logics

Cites Work

• Definability in dynamic logic
• Theory of program structures: Schemes, semantics, verification
• On static logics, dynamic logics, and complexity classes
• Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
• Some Properties of Predicate Transformers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Expressing program looping in regular dynamic logic