Verifying Implementation Relations

Authors:
Jonathan Burton;Maciej Koutny;Giuseppe Pappalardo
Affiliations:
-;-;-
Venue:
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Year:
2001

Citing 6
Cited 2

Communicating sequential processes

Communicating sequential processes
Algebraic theory of processes

Algebraic theory of processes
Algorithms in C++

Algorithms in C++
Communication and Concurrency

Communication and Concurrency
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
A model of behaviour abstraction for communicating processes

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Relating Communicating Processes with Different Interfaces

Fundamenta Informaticae
Behaviour Abstraction for Communicating Sequential Processes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Implementation relations are a means to relate the behaviour of implementation and specification systems built of communicating processes in the event that respective implementation and specification processes have differing interfaces. In this paper we first present a graph-theoretic statement of such relations, and then derive algorithms for their automatic verification.