Logical clock requirements for reverse engineering scenarios from a distributed system

IEEE Transactions on Software Engineering

Volumn 28, Issue 4, 2002, Pages 321-339

  Hrischuk, Curtis E ^a,b   Woodside, C Murray ^a,c  

^a IEEE   (United States)

^b Rational Software   (United States)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Causal order; Debugging; Distributed programming; Event labeling; Graph grammar; Logical clock; Reverse engineering; Software tracing; Trace analysis; Web services

Indexed keywords

CAUSAL ORDER; EVENT LABELING; GRAPH GRAMMAR; LOGICAL CLOCK; SCENARIO EVENT GRAPH; SOFTWARE OBJECT; SOFTWARE TRACING; WEB SERVICES;

CONTEXT SENSITIVE GRAMMARS; DISTRIBUTED COMPUTER SYSTEMS; INFERENCE ENGINES; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; PROGRAM DEBUGGING; REQUIREMENTS ENGINEERING; SEQUENTIAL MACHINES; TIME SHARING SYSTEMS; WEB BROWSERS;

REVERSE ENGINEERING;

EID: 0036530164     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.2002.995416     Document Type: Article

References (68)

1. Using automated process clustering for design recovery and distributed debugging
2. High-level views of distributed executions: Convex abstract events
3. Determining possible event orders by analyzing sequential traces
4. Time, clocks, and the ordering of events in a distributed system
5. Detecting causal relationships in distributed computations: In search of the holy grail
6. Logical time in distributed computing systems
7. Time and global states of distributed systems
8. Timestamps in message-passing systems that preserve the partial ordering
9. Structuring the semantic definitions of graphical design notations
10. Ada-concurrency specified by graph grammars
11. An integrated formal model of scenarios based on statecharts
12. Basic notions of actor grammars
13. Algorithms for distributed termination detection
14. An efficient implementation of vector clocks
15. Causal distributed breakpoints
16. Characterizing the accuracy of distributed timestamps
17. Temporal interactions of intervals in distributed systems
18. A prototype debugger for hermes
19. Synchronous, asynchronous, and causally ordered communications
20. Interval approximations of message causality in distributed executions
21. Petri nets
22. Models for mobile computing agents
23. The semantics of blocking and nonblocking send and receive primitives
24. Repeatable and portable message-passing programs
25. Implementing remote procedure calls
26. Trace-based load characterization for generating performance software models
27. Message passing between sequential processes: The reply primitive and the administrator concept
28. Modeling concurrency with partial orders
29. Automatic generation of a software performance model using an object-oriented prototype
30. Trace-based load characterization for the automated development of software performance models
31. A model making automation process (MMAP) using a graph grammar formalism
32. Set theoretic approaches to graph grammars
33. Tutorial introduction to the algebraic approach of graph-grammars
34. Introduction to PROGRES, an attribute graph grammar based specification language
35. PROGRES: A VHL-language based on graph grammars
36. Graph grammar engineering with PROGRES
37. Programmed graph replacement systems
38. Global and logical time in distributed algorithms
39. Implementing and programming causal distributed shared memory
40. Lightweight causal and atomic group multicast
41. Distributed snapshots: Determining global states of distributed systems
42. Efficient algorithms for distributed snapshots and global virtual time approximations
43. Efficient distributed snapshots
44. Consistent detection of global predicates
45. Global events and global breakpoints in distributed systems
46. Modeling concurrency in parallel debugging
47. Optimal tracing and replay for debugging message-passing parallel programs
48. Debugging parallel programs with instant replay
49. Specification and analysis of system architecture using rapide
50. Rollback based on vector time
51. Combinatorics and geometry of consistent cuts: Application to concurrency theory
52. Exploiting virtual synchrony in distributed systems
53. Distributed programming in Argus
54. Performance of the BirLix operating aystem
55. Linda and friends
56. Linda in context
57. A tutorial and bibliographical survey on graph grammars