Entry Li:1995:PAE from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Li:1995:PAE,
  author =       "Yau-Tsun Steven Li and Sharad Malik",
  title =        "Performance analysis of embedded software using
                 implicit path enumeration",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "11",
  pages =        "88--98",
  month =        nov,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:12 MST 2003",
  bibsource =    "http://portal.acm.org/; http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/plan/216636/p88-li/",
  abstract =     "Embedded computer systems are characterized by the
                 presence of a processor running application specific
                 dedicated software. A large number of these systems
                 must satisfy real-time constraints. The paper examines
                 the problem of determining the extreme (best and worst)
                 case bounds on the running time of a given program on a
                 given processor. This has several applications in the
                 design of embedded systems with real-time constraints.
                 An important aspect of this problem is determining
                 which paths in the program are exercised in the extreme
                 cases. The state of the art solution relies on an
                 explicit enumeration of program paths. This runs out of
                 steam rather quickly since the number of feasible
                 program paths is typically exponential in the size of
                 the program. We present a solution for this problem
                 that does not require an explicit enumeration of
                 program paths, i.e., the paths are considered
                 implicitly. This solution is implemented in the program
                 cinderella which currently targets a popular embedded
                 processor-the Intel i960. The preliminary results of
                 using this tool are also presented.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Electr. Eng., Princeton Univ., NJ, USA",
  classification = "C6150G (Diagnostic, testing, debugging and
                 evaluating systems)",
  confname =     "LCT-RTS '95. Proceedings of the ACM SIGPLAN 1995
                 workshop on Languages, compilers, \& tools for
                 real-time systems, June 21--22, 1995, La Jolla,
                 California",
  keywords =     "Application specific dedicated software; Cinderella
                 program; design; Embedded computer systems; Embedded
                 software; Embedded system design; experimentation;
                 Implicit path enumeration; Intel i960; measurement;
                 performance; Performance analysis; Processor; Program
                 running time; Real-time constraints; theory",
  subject =      "{\bf D.4.7} Software, OPERATING SYSTEMS, Organization
                 and Design, Real-time systems and embedded systems.
                 {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language
                 Constructs and Features.",
  thesaurus =    "Real-time systems; Software performance evaluation;
                 System monitoring",
}

Related entries