Reasoning about non-terminating loops using deadline commands

DOI10.1007/10722010_5MaRDI QIDQ2721094zbMATH OpenFDO

Authors Ian Hayes

Publication date 1 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Reasoning about real-time repetitions: Terminating and nonterminating
• Real-time refinement in Manna and Pnueli's temporal logic
• scientific article; zbMATH DE number 2088653
• Termination of Real-Time Programs: Definitely, Definitely Not, or Maybe
• A sequential real-time refinement calculus

Cited in

(2)

• Termination of Real-Time Programs: Definitely, Definitely Not, or Maybe
• Reasoning about real-time repetitions: Terminating and nonterminating

This page was built for publication: Reasoning about non-terminating loops using deadline commands

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721094)