Specifying and checking method call sequences of Java programs

Authors:
Yoonsik Cheon;Ashaveena Perumandla
Affiliations:
Department of Computer Science, The University of Texas at El Paso, El Paso, USA 79968;Department of Computer Science, The University of Texas at El Paso, El Paso, USA 79968
Venue:
Software Quality Control
Year:
2007

Citing 0
Cited 6

Specifying and checking protocols of multithreaded classes

Proceedings of the 2009 ACM symposium on Applied Computing
A Formal Connection between Security Automata and JML Annotations

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Prototyping a tool environment for run-time assertion checking in JML with communication histories

Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
Enriching Java Enterprise interfaces with formal sequential contracts

Proceedings of the Third Workshop on Behavioural Modelling
Monitoring method call sequences using annotations

FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Run-time checking of data- and protocol-oriented properties of Java programs: an industrial case study

Proceedings of the 28th Annual ACM Symposium on Applied Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a pre and postcondition-style specification, it is difficult to specify the allowed sequences of method calls, referred to as protocols. The protocols are essential properties of reusable object-oriented classes and application frameworks, and the approaches based on the pre and postconditions, such as design by contracts (DBC) and formal behavioral interface specification languages (BISL), are being accepted as a practical and effective tool for describing precise interfaces of (reusable) program modules. We propose a simple extension to the Java Modeling Language (JML), a BISL for Java, to specify protocol properties in an intuitive and concise manner. The key idea of our approach is to separate protocol properties from functional properties written in pre and post-conditions and to specify them in a regular expression-like notation. The semantics of our extension is formally defined and provides a foundation for implementing runtime checks. Case studies have been performed to show the effectiveness our approach. We believe that our approach can be adopted by other BISLs.