Linear approximation of execution-time constraints
DOI10.1007/S00165-003-0019-0zbMATH Open1093.68025OpenAlexW1970456879MaRDI QIDQ706493FDOQ706493
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
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
Automatic constraint determinationControl-flow analysisReal-time program analysisTiming predictionWorst-case and best-case execution times
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cited In (9)
- Symbolic worst case execution times
- Title not available (Why is that?)
- Title not available (Why is that?)
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK
- A theory for execution-time derivation in real-time programs
- Title not available (Why is that?)
- Formal Methods for Components and Objects
- A global constraint for over-approximation of real-time streams
- 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)
