Timing analysis of concurrent programs

OpenAccess Series in Informatics

Volumn 23, Issue , 2012, Pages 59-68

  Mittermayr, Robert ^a   Blieberger, Johann ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Concurrency; Kronecker algebra; Program analysis; Thread synchronization; Worst case execution time analysis (WCET)

Indexed keywords

CONCURRENCY; KRONECKER ALGEBRA; PROGRAM ANALYSIS; THREAD SYNCHRONIZATION; WORST-CASE EXECUTION TIME ANALYSIS;

GRAPHIC METHODS; MULTIPROCESSING PROGRAMS; SYNCHRONIZATION;

CONCURRENCY CONTROL;

EID: 84880085535     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.WCET.2012.59     Document Type: Conference Paper

References (15)

1. R. Bellman. Introduction to Matrix Analysis. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, 2nd edition, 1997.
2. J. Blieberger. Data-Flow Frameworks for Worst-Case Execution Time Analysis. Real-Time Systems, 22(3):183-227, 2002.
3. P. Buchholz and P. Kemper. Efficient Computation and Representation of Large Reachability Sets for Composed Automata. Discrete Event Dyn. Systems, 12(3):265-286, 2002.
4. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
5. M. Davio. Kronecker Products and Shuffle Algebra. IEEE Trans. Computers, 30(2):116-125, 1981.
6. A. Graham. Kronecker Products and Matrix Calculus with Applications. Ellis Horwood Ltd., New York, 1981.
7. J. Gustafsson, A. Betts, A. Ermedahl, and B. Lisper. The Mälardalen WCET Benchmarks: Past, Present And Future. In Proc. 10th International Workshop on Worst-Case Execution Time Analysis, pages 136-146, 2010.
8. A. Gustavsson, A. Ermedahl, B. Lisper, and P. Pettersson. Towards WCET Analysis of Multicore Architectures Using UPPAAL. In Proc. 10th International Workshop on Worst- Case Execution Time Analysis, pages 101-112, 2010.
9. P. Henderson and J. H. Morris, Jr. A Lazy Evaluator. In 3rd ACM Symposium on Principles of Programming Languages, POPL '76, pages 95-103, January 1976.
10. W. Kuich and A. Salomaa. Semirings, Automata, Languages. Springer, 1986.
11. G. Küster. On the Hurwitz Product of Formal Power Series and Automata. Theor. Comput. Sci., 83(2):261-273, 1991.
12. R. Mittermayr and J. Blieberger. Shared Memory Concurrent System Verification using Kronecker Algebra. Technical Report 183/1-155, Automation Systems Group, TU Vienna, http://arxiv.org/abs/1109.5522, Sept. 2011.
13. B. Plateau. On the Stochastic Structure of Parallelism and Synchronization Models for Distributed Algorithms. In ACM SIGMETRICS, volume 13, pages 147-154, 1985.
14. V. C. Sreedhar, G. R. Gao, and Y.-F. Lee. A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphs. ACM Trans. Program. Lang. Syst., 20(2):388-435, 1998.
15. R. E. Tarjan. A Unified Approach to Path Problems. J. ACM, 28(3):577-593, 1981.