Local model checking of Java bytecode

Authors:
Antonella Santone;Gigliola Vaglini
Affiliations:
Technology University of Sannio, Benevento, Italy;Università di Pisa, Italy
Venue:
SEKE '02 Proceedings of the 14th international conference on Software engineering and knowledge engineering
Year:
2002

Citing 11
Cited 1

An introduction to modal and temporal logics for CCS

Proceedings of the UK/Japan workshop on Concurrency : theory, language, and architecture: theory, language, and architecture
First leaves: a tutorial introduction to Maple V

First leaves: a tutorial introduction to Maple V
Local model checking for infinite state spaces

Selected papers of the Second Workshop on Concurrency and compositionality
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A type system for Java bytecode subroutines

ACM Transactions on Programming Languages and Systems (TOPLAS)
A deadlock detection tool for concurrent Java programs

Software—Practice & Experience
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
Symbolic Model Checking

Symbolic Model Checking
Java Virtual Machine Specification

Java Virtual Machine Specification
Software Model Checking

FORTE XII / PSTV XIX '99 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XII) and Protocol Specification, Testing and Verification (PSTV XIX)
Model Checking Programs

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering

A local approach for temporal model checking of Java bytecode

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model checking procedure to verify a subset of the Java Virtual Machine Language. The procedure works on a finite tractable state representation of the program: in fact, abstraction techniques are employed, driven by the temporal logic formula representing the property to be checked. A tableau-based method is developed to proof the satisfaction of the formulae: thus not all the program computations are checked, but only those ones interested in the goal of the property verification.