Adequate proof principles for invariance and liveness properties of concurrent programs
Science of Computer Programming
The logical basis for computer programming. Volume 1: deductive reasoning
The logical basis for computer programming. Volume 1: deductive reasoning
Communicating sequential processes
Communicating sequential processes
The state of the art in protocol engineering
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Current trends in concurrency. Overviews and tutorials
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Service specification and protocol construction for the transport layer
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A verified connection management protocol for the transport layer
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Parallel program design: a foundation
Parallel program design: a foundation
A simple approach to specifying concurrent systems
Communications of the ACM
Verified data transfer protocols with variable flow control
ACM Transactions on Computer Systems (TOCS)
A stepwise refinement heuristic for protocol construction
A stepwise refinement heuristic for protocol construction
What it means for a concurrent program to satisfy a specification: why no one has specified priority
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
An HDLC protocol specification and its verification using image protocols
ACM Transactions on Computer Systems (TOCS)
Predicative programming Part I
Communications of the ACM
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
IEEE Transactions on Software Engineering
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Specifying Modules to Satisfy Interfaces: a State Transition System
Specifying Modules to Satisfy Interfaces: a State Transition System
Formalization of Protocol Engineering Concepts
IEEE Transactions on Computers - Special issue on protocol engineering
Specification of Real-Time Broadcast Networks
IEEE Transactions on Computers - Special issue on protocol engineering
A stepwise refinement heuristic for protocol construction
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Automated Approach to Information Systems Decomposition
IEEE Transactions on Software Engineering
An introduction to assertional reasoning for concurrent systems
ACM Computing Surveys (CSUR)
A methodology for designing communication protocols
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Formal Derivation of Concurrent Programs: An Example from Industry
IEEE Transactions on Software Engineering
A Theory of Interfaces and Modules - I: Composition Theorem
IEEE Transactions on Software Engineering
Reasoning About Places, Times, and Actions in the Presence of Mobility
IEEE Transactions on Software Engineering
Deriving Software Specifications from Event Based Models
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
Constraint-based structuring of network protocols
Distributed Computing
Specifying modules to satisfy interfaces: a state transition system approach
Distributed Computing - Special issue: Specification of concurrent systems
Automated composition of Web services via planning in asynchronous domains
Artificial Intelligence
| Hi-index | 0.00 |
A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches.