An axiom system for sequence-based specification

Authors:
Lan Lin;Stacy J. Prowell;Jesse H. Poore
Affiliations:
Department of Electrical Engineering and Computer Science, The University of Tennessee, 203 Claxton Complex, 1122 Volunteer Blvd., Knoxville, TN 37996, USA;Software Engineering Institute, Carnegie Mellon University, 4500 Forbes Avenue, Pittsburgh, PA 15213, USA;Department of Electrical Engineering and Computer Science, The University of Tennessee, 203 Claxton Complex, 1122 Volunteer Blvd., Knoxville, TN 37996, USA
Venue:
Theoretical Computer Science
Year:
2010

Citing 18
Cited 2

Communicating sequential processes

Communicating sequential processes
Stepwise Refinement and Verification in Box-Structured Systems

Computer
Model-checking CSP

A classical mind
Cleanroom software engineering: technology and process

Cleanroom software engineering: technology and process
Derivatives of Regular Expressions

Journal of the ACM (JACM)
The new math of computer programming

Communications of the ACM
Foundations of the Trace Assertion Method of Module Interface Specification

IEEE Transactions on Software Engineering
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Structured Programming; Theory and Practice the Systems Programming Series

Structured Programming; Theory and Practice the Systems Programming Series
Using assertions about traces to write abstract specifications for software modules

Proceedings of the 2nd Conference of the European Cooperation on Informatics: Information Systems Methodology
Foundations of Sequence-Based Software Specification

IEEE Transactions on Software Engineering
Academia and industry meet: Some experiences of formal methods in practice

APSEC '03 Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference
Representation of a class of nondeterministic semiautomata by canonical words

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
From Requirements to Statistical Testing of Embedded Systems

SEAS '07 Proceedings of the 4th International Workshop on Software Engineering for Automotive Systems
Management of requirements changes in sequence-based software specifications

Management of requirements changes in sequence-based software specifications
The impact of requirements changes on specifications and state machines

Software—Practice & Experience
Software for Dependable Systems: Sufficient Evidence?

Software for Dependable Systems: Sufficient Evidence?
Combining the Box Structure Development Method and CSP for Software Development

Electronic Notes in Theoretical Computer Science (ENTCS)

Augmenting sequence enumeration with string-rewriting for requirements analysis and behavioral specification

FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Applying string-rewriting to sequence-based specification

Formal Methods in System Design

Quantified Score

Hi-index	5.24

Visualization

Abstract

This paper establishes an axiomatic foundation and a representation theorem for the rigorous, constructive process, called sequence-based specification, of deriving precise specifications from ordinary (informal) statements of functional requirements. The representation theorem targets a special class of Mealy state machines, and algorithms are presented for converting from the set of sequences that define the specification to the equivalent Mealy machine, and vice versa. Since its inception, sequence-based specification has been effectively used in a variety of real applications, with gains reported in quality and productivity. This paper establishes the mathematical foundation independently of the process itself.