Invariants, composition, and substitution

DOI10.1007/BF01178381zbMath0827.68073OpenAlexW4246478125MaRDI QIDQ1894676

Ekkart Kindler

Publication date: 24 July 1995

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178381

zbMATH Keywords

invariant setscomposition ruleinductive sets

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

A foundation for modular reasoning about safety and progress properties of state-based concurrent programs

Uses Software

• UNITY

Cites Work

• Eliminating the substitution axiom from UNITY logic
• The Hoare logic of concurrent programs
• Comments on ``On the proof of a distributed algorithm: Always-true is not invariant
• Comments on Always-true is not invariant: Assertional reasoning about invariance
• An axiomatic proof technique for parallel programs
• Formal verification of parallel programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Invariants, composition, and substitution