Formal modeling of a slicing algorithm for java event spaces in PVS

Authors:
Néstor Cataño
Affiliations:
Department of Computer Science, The University of York, U.K
Venue:
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Year:
2005

Citing 8
Cited 0

Fixing the Java memory model

JAVA '99 Proceedings of the ACM 1999 conference on Java Grande
Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem
Java Language Specification, Second Edition: The Java Series

Java Language Specification, Second Edition: The Java Series
An Event-Based Structural Operational Semantics of Multi-Threaded Java

Formal Syntax and Semantics of Java
Towards a Machine-Checked Java Specification Book

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Decision procedures and expressiveness in the temporal logic of branching time

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Saturation unbound

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the formalization of an algorithm for slicing Java event spaces in PVS. In short, Java event spaces describe how multi-threaded Java programs operate in memory. We show that Java event spaces can be sliced following an algorithm introduced in previous work and still preserve properties in a subset of CTL. The formalization and proof presented in this paper can be extended to other state-space reduction techniques as long as some sufficient conditions are fulfilled.