Linear approximation of execution-time constraints

DOI10.1007/S00165-003-0019-0MaRDI QIDQ706493zbMATH OpenOpenAlexFDO

Authors Karl Lermer, Colin Fidge, Ian Hayes

Publication date 8 February 2005

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://espace.library.uq.edu.au/view/UQ:10540/svrc_02_31.pdf

zbMATH Keywords

Automatic constraint determinationControl-flow analysisReal-time program analysisTiming predictionWorst-case and best-case execution times

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Approximate solution of a linear time-optimal problem
• scientific article; zbMATH DE number 19340
• Linear time algorithms for linear programming
• Time optimal linear schedules for algorithms with uniform dependencies
• scientific article; zbMATH DE number 3990208
• Approximation algorithms for time constrained scheduling
• Time optimization of linear program sections
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• scientific article; zbMATH DE number 1560345
• Scheduling under linear constraints

Cited in

(9)

• Symbolic worst case execution times
• scientific article; zbMATH DE number 5885664 (Why is no real title available?)
• scientific article; zbMATH DE number 1930748 (Why is no real title available?)
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• A theory for execution-time derivation in real-time programs
• scientific article; zbMATH DE number 1760152 (Why is no real title available?)
• A global constraint for over-approximation of real-time streams
• Formal Methods for Components and Objects
• Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices

This page was built for publication: Linear approximation of execution-time constraints

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