Cesar: a static sequencing constraint analyzer

  • Authors:
  • K. Olender;L. Osterweil

  • Affiliations:
  • Department of Computer Science, University of Colorado, Boulder, CO;Department of Computer Science, University of Colorado, Boulder, CO

  • Venue:
  • TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper relates experience with building and using a programmable sequencing analyzer based on data flow analysis algorithms. An earlier paper described both the motivation for and the specification of Cecil, a powerful language for defining constraints on the sequencing of events and gave an algorithm for mapping the sequencing specifications defined by Cecil to data flow analysis algorithms. In this paper, we sketch the architecture of Cesar, a system for carrying out the analysis of Cecil sequencing constraints, describe the problems arising in the analysis of real-world programs, and indicate how we resolved these problems. Finally, we describe our experience in using Cesar, citing speed and efficiency characteristics of the current implementation, and suggesting the error-detection features and powers of Cesar.