Partial Program Admission
Michael Wilson,Ron K. Cytron,Jonathan S. Turner +2 more
- 13 Apr 2009
- pp 295-304
TL;DR: A new technique is presented, called partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET without adding runtime overhead, by means of code duplication.
read more
Abstract: Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statically is possible, computing its true WCET is difficult. We present a new technique we call partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET without adding runtime overhead, by means of code duplication. We apply this technique to real programs from the virtual networking arena and present the results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Distributed Differential Privacy and Applications
Arjun Narayan
- 01 Jan 2015
TL;DR: This research presents a novel and scalable approach called “Smart grids” that combines “smart cities” with smart grids to provide real-time information about smart grids and their applications.
Partial Program Admission
Michael Wilson,Ron K. Cytron,Jonathan S. Turner +2 more
- 13 Apr 2009
TL;DR: A new technique is presented, called partial program admission, a means of statically enforcing an otherwise untrusted assertion of WCET without adding runtime overhead, by means of code duplication.
•Proceedings Article
Differential privacy under fire
Andreas Haeberlen,Benjamin C. Pierce,Arjun Narayan +2 more
- 08 Aug 2011
TL;DR: This work presents a detailed design for one specific solution, based on a new primitive the authors call predictable transactions and a simple differentially private programming language, that is effective against remotely exploitable covert channels, at the expense of a higher query completion time.
References
•Book
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft,Rajeev Motwani,Rotwani,Jeffrey D. Ullman +3 more
- 01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
14.5K
The worst-case execution-time problem—overview of methods and survey of tools
Reinhard Wilhelm,Jakob Engblom,Andreas Ermedahl,Niklas Holsti,Stephan Thesing,David Whalley,Guillem Bernat,Christian Ferdinand,Reinhold Heckmann,Tulika Mitra,Frank Mueller,Isabelle Puaut,Peter Puschner,Jan Staschulat,Per Stenström +14 more
TL;DR: Different approaches to the determination of upper bounds on execution times are described and several commercially available tools1 and research prototypes are surveyed.
•Book
Introduction To Automata Theory, Languages And Computation, 3Rd Edition
John E. Hopcroft,Rajeev Motwani,Jeffrey D. Ullman +2 more
- 01 Jan 2012
TL;DR: The introduction to formal languages and automata wasolutionary rather than rcvolrrtionary and addressed Initially, I felt that giving solutions to exercises was undesirable hecause it lirrritcd the Chapter 1 fntroduction to the Theory of Computation.
1.5K
Performance Analysis of Embedded Software Using Implicit Path Enumeration
Yau-Tsun Steven Li,Sharad Malik +1 more
- 01 Jan 1995
TL;DR: A solution for this problem is presented, which considers all paths implicitly by using integer linear programming, which is implemented in the program cinderella which currently targets a popular embedded processor - the Intel i960.
Predicting program execution times by analyzing static and dynamic program paths
TL;DR: A formal path model for dynamic path analysis is introduced, where user execution information is represented by a set of program paths and a method to verify given user information with known program verification techniques is introduced.
Related Papers (5)
Claire Maiza,Pascal Raymond,Catherine Parent-Vigouroux,Armelle Bonenfant,Fabienne Carrier,Hugues Cassé,Philippe Cuenot,Denis Claraz,Nicolas Halbwachs,Erwan Jahier,Hanbing Li,Marianne de Michiel,Vincent Mussot,Isabelle Puaut,Christine Rochange,Erven Rohou,Jordy Ruiz,Pascal Sotin,Wei-Tsun Sun +18 more
- 27 Jun 2017