2005 | OriginalPaper | Chapter
Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS
Author : Néstor Cataño
Published in: Theorem Proving in Higher Order Logics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.