Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
Data flow analysis of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data flow analysis for verifying properties of concurrent programs
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Internetworking with TCP/IP, Volume 1: Principles, Protocols, and Architectures, Fourth Edition
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Monitoring Programs Using Rewriting
Proceedings of the 16th IEEE international conference on Automated software engineering
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Analyzing the impact of protocol changes on tests
TestCom'06 Proceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems
Hi-index | 0.00 |
While verifying complex protocols, it is often fruitful to consider all protocol contexts in which an interesting set of transitions may appear. The contexts are represented as yet another protocol called observable protocol that may be further analyzed. An efficient approach based on static analysis to compute an over-approximated protocol that includes all the runs of an observable protocol is described. The approach uses dominator relations over state and message dependency graphs. An over-approximation of transitions that occur with an interesting transition in any run are produced, from which a transition relation of the overapproximated protocol is automatically generated. To facilitate systematic state space exploration of the over approximated protocol, it is shown how a series of underapproximations can be generated by identifying parallelism among the transitions using dominators. The effectiveness of the proposed approach is illustrated by model checking several examples including several coherence protocols.