Reasoning about programs by exploiting the environment

DOI10.1007/3-540-58201-0_79zbMath1418.68054OpenAlexW1480998494MaRDI QIDQ4632437

Fred B. Schneider, Limor Fix

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6191

zbMATH Keywords

temporal logicdeductive systemprogramming logicsafety propertyprogram reduction

Mathematics Subject Classification ID

Logic in computer science (03B70) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Reasoning about programs by exploiting the environment ⋮ Verification, refinement and scheduling of real-time programs

Uses Software

• UNITY

Cites Work

• The Hoare logic of concurrent programs
• An axiomatic proof technique for parallel programs
• Program composition via unification
• Verification of schedulability for real-time programs
• Alternative semantics for temporal logics
• The ``Hoare Logic of CSP, and All That
• “Sometimes” and “not never” revisited
• Proofs of Networks of Processes
• Reasoning about programs by exploiting the environment
• Priority inheritance protocols: an approach to real-time synchronization
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reasoning about programs by exploiting the environment