While-programs with nondeterministic assignments and the logic ALNA

DOI10.1016/0304-3975(85)90167-7zbMath0603.68032OpenAlexW2029054266MaRDI QIDQ1082808

Marisa Venturini Zilli, Gianfranco Mascari

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90167-7

zbMATH Keywords

Algorithmic Logic for while-programs with Nondeterministic Assignmentsif-then-else-programsunbounded countable nondeterminismwellfounded while computation trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (2)

On the logic of UNITY ⋮ A logic of recursion

Cites Work

• Proving total correctness of nondeterministic programs in infinitary logic
• Looping vs. repeating in dynamic logic
• Countable nondeterminism and random assignment
• A Weaker Precondition for Loops
• A proof of the completeness theorem of Grödel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: While-programs with nondeterministic assignments and the logic ALNA