Linear and structural event sequence analysis

Authors:
W. E. Howden;G. M. Shi
Affiliations:
Computer Science and Engineering, UCSD, La Jolla, CA;Computer Science and Engineering, UCSD, La Jolla, CA
Venue:
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Year:
1996

Citing 5
Cited 3

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
A general-purpose algorithm for analyzing concurrent programs

Communications of the ACM
Cecil: A Sequencing Constraint Language for Automatic Static Analysis Generation

IEEE Transactions on Software Engineering
Data flow analysis for verifying properties of concurrent programs

SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
QDA - A Method for Systematic Informal Program Analysis

IEEE Transactions on Software Engineering

Verification of communication protocols using data flow analysis

SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Automatic Analysis of Consistency between Requirements and Designs

IEEE Transactions on Software Engineering
Generic program monitoring by trace analysis

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach to systematic informal program analysis is discussed in which comments that describe hypotheses and assertions about the behavior of programs are analyzed. Event sequence comments analysis methods analyze the consistency of comments that describe events. Two event sequence analysis methods are discussed, one of which uses a linear event sequence model, and which has been applied to the analysis of large data processing systems. The other uses a new approach involving rule-based structural models, and has been applied to the analysis of Ada programs.