Slicing Event Spaces
نویسندگان
چکیده
منابع مشابه
Formal Modeling of a Slicing Algorithm for Java Event Spaces in PVS
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...
متن کاملSlicing Event Traces of Large Software Systems
Debugging of large software systems consisting of many processes accessing shared resources is a very difficult task. Many commercial systems record essential events during system execution for post-mortem analysis. However, the event traces of large and long-running systems can be quite voluminous. Analysis of such event traces to identify sources of incorrect behavior can be very tedious, err...
متن کاملEvent-Driven, Personalizable, Mobile Interactive Spaces
An infrastructure is currently being deployed for delivering multimedia services using IP endto-end. Mobile devices and application resources, because of their computing capabilities, can be enabled with adaptive functionality to shape the services according to the communication conditions and the user's context. This raises the question of how events should be managed to create a common awaren...
متن کاملOn the structure of numerical event spaces
The probability p(s) of the occurrence of an event pertaining to a physical system which is observed in different states s determines a function p from the set S of states of the system to [0, 1]. The function p is called a numerical event or multidimensional probability. When appropriately structured, sets P of numerical events form so-called algebras of Sprobabilities. Their main feature is t...
متن کاملEvent Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurrency. Petri nets treat these symmetrically but not algebraically, while event structures treat them algebraically but not symmetrically. Here we achieve both via the notion of an event space as a poset with all nonempt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80809-0