Extending rely-guarantee thinking to handle real-time scheduling

DOI10.1007/S10703-023-00441-YMaRDI QIDQ6564175

C. B. Jones, Alan Burns

Publication date: 28 June 2024

Published in: Formal Methods in System Design (Search for Journal in Brave)

zbMATH Keywords

real-time systemsformal specificationfault-tolerancemixed criticality schedulingrely-guarantee conditions

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A timeband framework for modelling real-time systems
• A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
• Concurrency verification. Introduction to compositional and noncompositional methods
• A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing
• Mixed-Criticality Scheduling of Sporadic Task Systems
• A Marriage of Rely/Guarantee and Separation Logic
• Tentative steps toward a development method for interfering programs
• The B-Book
• An axiomatic basis for computer programming
• Proof of a program
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning

This page was built for publication: Extending rely-guarantee thinking to handle real-time scheduling

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