Modeling concurrency with partial orders
International Journal of Parallel Programming
Computer
Debugging Parallel Programs with Instant Replay
IEEE Transactions on Computers
Exploiting virtual synchrony in distributed systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
Distributed programming in Argus
Communications of the ACM
Global events and global breakpoints in distributed systems
Proceedings of the Twenty-First Annual Hawaii International Conference on Software Track
Communications of the ACM
Introduction to PROGRESS, an attribute graph grammar based specification language
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
Modeling concurrency in parallel debugging
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Introduction to OSF DCE (rev. 1.0)
Introduction to OSF DCE (rev. 1.0)
An efficient implementation of vector clocks
Information Processing Letters
Optimal tracing and replay for debugging message-passing parallel programs
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Characterizing the accuracy of distributed timestamps
PADD '93 Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debugging
Repeatable and portable message-passing programs
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Specification and Analysis of System Architecture Using Rapide
IEEE Transactions on Software Engineering - Special issue on software architecture
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
Models for mobile computing agents
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Programmed graph replacement systems
Handbook of graph grammars and computing by graph transformation
Building tightly integrated software development environments: the IPSEN approach
Building tightly integrated software development environments: the IPSEN approach
The Unified Modeling Language user guide
The Unified Modeling Language user guide
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
Trace-Based Load Characterization for Generating Performance Software Models
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Java Virtual Machine Specification
Java Virtual Machine Specification
The Java Language Specification
The Java Language Specification
High-Level Views of Distributed Executions: Convex Abstract Events
Automated Software Engineering
Determining Possible Event Orders by Analyzing Sequential Traces
IEEE Transactions on Parallel and Distributed Systems
Using Automatic Process Clustering for Design Recovery and Distributed Debugging
IEEE Transactions on Software Engineering
Graph Grammar Engineering with PROGRES
Proceedings of the 5th European Software Engineering Conference
An Integrated Formal Model of Scenarios Based on Statecharts
Proceedings of the 5th European Software Engineering Conference
The Semantics of Blocking and Nonblocking Send and Receive Primitives
Proceedings of the 8th International Symposium on Parallel Processing
A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory
Proceedings of the 3rd International Workshop on Distributed Algorithms
Performance of the BirLiX Operating System
Proceedings of the Workshop on Micro-kernels and Other Kernel Architectures
Interval Approximations of Message Causality in Distributed Executions
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Generation of a Software Performance Model Using an Object-Oriented Prototype
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A Tutorial and Bibliographical Survey on Graph Grammars
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Set theoretic approaches to graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
ADA-Concurrency specified by Graph Grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Basic notions of actor grammars: A graph grammar model for actor computation
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Tutorial introduction to the algebraic approach of graph grammars
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
PROGRESS: A VHL-Language Based on Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Implementing Remote procedure calls
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Trace-based load characterization for the automated development of software performance models
Trace-based load characterization for the automated development of software performance models
A prototype debugger for Hermes
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
The Future of Software Performance Engineering
FOSE '07 2007 Future of Software Engineering
Neural, Parallel & Scientific Computations
An automatic trace based performance evaluation model building for parallel distributed systems
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Using vector clocks to monitor dependencies among services at runtime
Proceedings of the International Workshop on Quality Assurance for Service-Based Applications
Hi-index | 0.00 |
To reverse engineer scenarios from event traces, one must infer causal relationships between events. The inferences are usually based on a trace with sequence numbers or timestamps corresponding to some kind of logical clock. In practice, there is an explosion of potentially causal relationships in the trace, which limits one's ability to extract scenarios. This work defines a more parsimonious form of causality called scenario causality that concentrates on certain major causal relationships and ignores more subtle potentially causal links. The influence of an event is restricted to the particular scenario it is part of. An event which is not a message reception is defined to be caused by the previous event in the same software object, while a message reception is caused by a sending event in another object. The events are ordered to form a scenario event graph where typed nodes are events and the typed edges are certain causal relationships. Intuitively, we might say that most logical clocks, which identify events which 驴happened before驴 a given event and, thus, are potentially causal, give an upper bound on the set of causal events; scenario causality identifies a lower bound. The much smaller lower bound set makes it possible to reverse engineer and automate the analysis of scenarios.