skip to main content
10.1145/384198.384211acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
Article

Interval-Based Analysis of Software Processes

Authors Info & Claims
Published:01 August 2001Publication History

ABSTRACT

A typical characteristic of complex embedded systems is their large software share that consists of software processes either being directly written in an implementation language like C, or being created from abstract modeling tools (e. g. Simulink or StateMate) using standard code generators, or being reused from previous designs (e. g. legacy code). A major challenge is the safe integration of these separately designed system parts. This paper focuses on the formal analysis of software processes with respect to their non-functional properties like timing or power consumption. The proposed approach yields safe upper and lower bounds on these properties and has advantages over previous work in terms of accuracy and efficiency. Further, it is shown how the results of this process-level analysis can be utilized to generate a model for the system-wide validation of non-functional properties. The applicability of the approach is demonstrated using an example of a filter process operating on a packet stream.

References

  1. 1.A. V. Aho, R. Sethi, and J.D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, GB, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Th. Benner, A. . Osterling, and R. Ernst. Comparison of Context Switching Methods for Fine Grain Process Scheduling. Technical Report CY-96-1, Institute of Computer Engineering, Technical University of Braunschweig, Germany, 1996.Google ScholarGoogle Scholar
  3. 3.C. Ferdinand and R. Wilhelm. On predicting data cache behavior for real-time systems. In Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, Montreal, Canada, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.D. D. Gajski, J. Zhu, R. D.omer, A. Gerstlauer, and S. Zhao. SpecC: Specification Language and Methodology. Kluwer Academic Publishers, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5.R. Gerber, W. Pugh, and M. Saksena. Parametric dispatching of hard real-time taks. IEEE Transaction on Computers, 44(3):471-479, March 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.C. Healy, R. Arnold, F. M. uller, D. Whalley, and M. Harmon. Bounding pipeline and instruction cache performance. IEEE Transactions on Computers, pages 53-70, January 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.M. Hill. DINERO III Cache Simulator: Source Code, Libraries and Documentation. www.ece.cmu.edu/ ece548/tools/dinero/src/, 1998.Google ScholarGoogle Scholar
  8. 8.M. Jersak, D. Ziegenbein, F. Wolf, K. Richter, R. Ernst, F. Cieslok, J. Teich, K. Strehl, and L. Thiele. Embedded system design using the spi workbench. In Proceedings 3rd Forum on Design Languages, T. ubingen, Germany, September 2000.Google ScholarGoogle Scholar
  9. 9.P. V.Knudsen and J. Madsen. Communication estimation for hardware/software codesign. In Sixth International Workshop on Hardware/Software Codesign CODES/Cashe '98, pages 55-59, Seattle, USA, March 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Y. S. Li and S. Malik. Performance Analysis of Real-Time Embedded Software. Kluwer Academic Publishers, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.T. Lundquist and P. Stenstr. om. Integrating path and timing analysis using instruction level simulation techniques. In Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, Montreal, Canada, June 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Open SystemC Initiative. SystemC. http://www.systemc.org/.Google ScholarGoogle Scholar
  13. 13.L. Semeria, K. Sato, and G. De Micheli. Resolution of dynamic memory allocation and pointers for the behavioral synthesis from c. In Design Automation and Test in Europe DATE'00, pages 312-319, Paris, France, March 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.V. Tiwari, S. Malik, and A. Wolfe. Instruction level power analysis and optimisation of software. The Journal of VLSI Signal Processing, 13(2/3):223-238, August 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.F. Wolf and R. Ernst. Data ow based cache prediction using local simulation. In Proceedings of the IEEE High Level Design Validation and Test Workshop, pages 155-160, Berkeley, USA,November 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.F. Wolf and R. Ernst. Execution cost interval refinement in static software analysis. Journal of Systems Architecture, The EUROMICRO Journal, Special Issue on Modern Methods and Tools in Digital System Design, 47(3-4):339-356, April 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.F. Wolf, J. Kruse, and R. Ernst. Segment-wise timing and power measurement in software emulation. In Proceedings of the IEEE/ACM Design, Automation and Test in Europe Conference, Designers' Forum, pages 165-169, Munich, Germany, March 2001.Google ScholarGoogle Scholar
  18. 18.D. Ziegenbein, R. Ernst, K. Richter, J. Teich, and L. Thiele. Combining multiple models of computation for scheduling and allocation. In Proceedings Sixth International Workshop on Hardware/Software Co-Design (Codes/CASHE '98), pages 9-13, Seattle, USA, March 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.D. Ziegenbein, K. Richter, R. Ernst, J. Teich, and L. Thiele. Representation of process mode correlation for scheduling. In Proceedings International Conference on Computer-Aided Design (ICCAD '98), San Jose, USA, November 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Interval-Based Analysis of Software Processes

                      Recommendations

                      Comments

                      Login options

                      Check if you have access through your login credentials or your institution to get full access on this article.

                      Sign in
                      • Published in

                        cover image ACM Conferences
                        OM '01: Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
                        August 2001
                        250 pages
                        ISBN:1581134266
                        DOI:10.1145/384198

                        Copyright © 2001 ACM

                        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                        Publisher

                        Association for Computing Machinery

                        New York, NY, United States

                        Publication History

                        • Published: 1 August 2001

                        Permissions

                        Request permissions about this article.

                        Request Permissions

                        Check for updates

                        Qualifiers

                        • Article

                        Upcoming Conference

                        PLDI '24

                      PDF Format

                      View or Download as a PDF file.

                      PDF

                      eReader

                      View online with eReader.

                      eReader