On the logic of UNITY

DOI10.1016/0304-3975(94)00043-IzbMath0874.68032MaRDI QIDQ673960

Peter Paeppinghaus

Publication date: 28 February 1997

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

zbMATH Keywords

UNITY approachUNITY program

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of software (68N99)

Uses Software

• UNITY

Cites Work

• Eliminating the substitution axiom from UNITY logic
• A predicate transformer for progress
• Proof rules and transformations dealing with fairness
• While-programs with nondeterministic assignments and the logic ALNA
• A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
• Classical recursion theory. The theory of functions and sets of natural numbers.
• Proof systems for infinite behaviours
• Elementary induction on abstract structures
• First-order dynamic logic
• Countable nondeterminism and random assignment
• Ten Years of Hoare's Logic: A Survey—Part I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the logic of UNITY