Using Multiple Levels of Abstractions in Embedded Software Design

  • Jerry R. Burch
  • Roberto Passerone
  • Alberto L. Sangiovanni-Vincentelli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2211)


The methodologies that are in use today for software development rely on representations and techniques appropriate for the applications (compilers, business applications, CAD, etc.) that have been traditionally implemented on programmable processors. Embedded software is different: by virtue of being embedded in a surrounding system, the software must be able to continuously react to stimula in the desired way. Verifying the correctness of the system requires that the model of the software be transformed to include (refine) or exclude (abstract) information to retain only what is relevant to the task at hand. In this paper, we outline a framework that we inted to use for studying the problems of abstraction and refinement in the context of embedded software for hybrid systems.


Conservative Approximation Sequential Composition Parallel Composition Time Trace Partial Trace 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Balluchi, M. D. Benedetto, C. Pinello, C. Rossi, and A. Sangiovanni-Vincentelli. Cut-off in engine control: a hybrid system approach. In IEEE Conf. on Decision and Control, 1997.Google Scholar
  2. 2.
    J. R. Burch. Trace Algebra for Automatic Verification of Real-Time Concurrent Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Aug. 1992. Technical Report CMU-CS-92-179.Google Scholar
  3. 3.
    J. R. Burch, R. Passerone, and A. Sangiovanni-Vincentelli. Overcoming heterophobia: Modeling concurrency in heterogeneous systems. In M. Koutny and A. Yakovlev, editors, Application of Concurrency to System Design, 2001.Google Scholar
  4. 4.
    J. Davis II, M. Goel, C. Hylands, B. Kienhuis, E. A. Lee, J. Liu, X. Liu, L. Muliadi, S. Neuendorffer, J. Reekie, N. Smyth, J. Tsay, and Y. Xiong. Overview of the ptolemy project. ERL Technical Report UCB/ERL No. M99/37, Dept. EECS, University of California, Berkeley, July 1999.Google Scholar
  5. 5.
    J. Davis II, C. Hylands, B. Kienhuis, E. A. Lee, J. Liu, X. Liu, L. Muliadi, S. Neuendorffer, J. Tsay, B. Vogel, and Y. Xiong. Heterogeneous concurrent modeling and design in java. Technical Memorandum UCB/ERL M01/12, EECS, University of California, Berkeley, Mar. 2001.Google Scholar
  6. 6.
    S. Edwards, L. Lavagno, E. Lee, and A. Sangiovanni-Vincentelli. Design of embedded systems: Formal models, validation, and synthesis. Proceedings of the IEEE, 85(3):366–390, Mar. 1997.CrossRefGoogle Scholar
  7. 7.
    T. Henzinger. Masaccio: a formal model for embedded components. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. Mosses, and T. Ito, editors, TCS 00: Theoretical Computer Science, volume 1872 of Lecture Notes in Computer Science, pages 549–563. Springer-Verlag, 2000.Google Scholar
  8. 8.
    T. Henzinger, M. Minea, and V. Prabhu. Assume-guarantee reasoning for hierarchical hybrid systems. In M. di Benedetto and A. Sangiovanni-Vincentelli, editors, HSCC 00: Hybrid Systems—Computation and Control, volume 2034 of Lecture Notes in Computer Science, pages 275–290. Springer-Verlag, 2001.Google Scholar
  9. 9.
    E. A. Lee and A. L. Sangiovanni-Vincentelli. A framework for comparing models of computation. IEEE Trans. Comput.-Aided Design Integrated Circuits, 17(12):1217–1229, Dec. 1998.CrossRefGoogle Scholar
  10. 10.
    R. Negulescu. Process Spaces and the Formal Verification of Asynchronous Circuits. PhD thesis, University of Waterloo, Canada, 1998.Google Scholar
  11. 11.
    R. Negulescu. Process spaces. In C. Palamidessi, editor, CONCUR, volume 1877 of Lecture Notes in Computer Science. Springer-Verlag, 2000.Google Scholar
  12. 12.
    V. R. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, 15(1):33–71, Feb. 1986.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jerry R. Burch
    • 1
  • Roberto Passerone
    • 1
  • Alberto L. Sangiovanni-Vincentelli
    • 2
  1. 1.Cadence Berkeley LaboratoriesBerkeleyUSA
  2. 2.Department of EECSUniversity of California at BerkeleyBerkeleyUSA

Personalised recommendations