Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination Detection of Diffusing Computations in Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
A Discipline of Programming
How to cook a temporal proof system for your pet language
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Distributed Termination with Interval Assertions
Proceedings of the International Colloquium on Formalization of Programming Concepts
Dynamic systems and their distributed termination
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A distributed algorithm for detecting resource deadlocks in distributed systems
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed State Exploration for Protocol Validation
Distributed State Exploration for Protocol Validation
Detection of stable properties in distributed applications
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A verified connection management protocol for the transport layer
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Language and visualization support for large-scale concurrency
ICSE '88 Proceedings of the 10th international conference on Software engineering
Verified data transfer protocols with variable flow control
ACM Transactions on Computer Systems (TOCS)
Parallel processing of recursive queries in distributed architectures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A framework for the parallel processing of Datalog queries
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency
IEEE Transactions on Software Engineering
An object-based programming model for shared data
ACM Transactions on Programming Languages and Systems (TOPLAS)
A stepwise refinement heuristic for protocol construction
ACM Transactions on Programming Languages and Systems (TOPLAS)
An introduction to assertional reasoning for concurrent systems
ACM Computing Surveys (CSUR)
A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Garbage collecting the world: one car at a time
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Distributed termination detection in a mobile wireless network
ACM-SE 36 Proceedings of the 36th annual Southeast regional conference
Bounded and Minimum Global Snapshots
IEEE Parallel & Distributed Technology: Systems & Technology
Architecture-Directed Refinement
IEEE Transactions on Software Engineering
A Global-State-Triggered Fault Injector for Distributed System Evaluation
IEEE Transactions on Parallel and Distributed Systems
Efficient detection of a class of stable properties
Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
An Algebra for Features and Feature Composition
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
An algebraic foundation for automatic feature-based program synthesis
Science of Computer Programming
| Hi-index | 0.00 |
We propose a methodology for the development of concurrent programs and apply it to an important class of problems: quiescence detection. The methodology is based on a novel view of programs. A key feature of the methodology is the separation of concerns between the core problem to be solved and details of the forms of concurrency employed in the target architecture and programming language. We begin development of concurrent programs by ignoring issues dealing with concurrency and introduce such concerns in manageable doses. The class of problems solved includes termination and deadlock detection.