Article

Verifying Implementation Relations

Authors:

Giuseppe PappalardoAuthors Info & Claims

FME '01: Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity

Pages 364 - 383

Published: 12 March 2001 Publication History

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.

References

[1]

J. Burton, M. Koutny and G. Pappalardo: Modelling and Verification of Communicating Processes in the Event of Interface Difference. Technical Report CS-TR-696, Department of Computing Science, University of Newcastle upon Tyne (2000).

Google Scholar

[2]

P. Collette and C. B. Jones: Enhancing the Tractability of Rely/Guarantee Specifications in the Development of Interfering Operations. Technical Report CUMCS- 95-10-3, Department of Computing Science, Manchester University (1995).

Google Scholar

[3]

M. Hennessy: Algebraic Theory of Processes. MIT Press (1988).

Crossref

Google Scholar

[4]

C. A. R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).

Crossref

Google Scholar

[5]

M. Koutny and G. Pappalardo: A Model of Behaviour Abstraction for Communicating Processes. Proc. of 16th Symposium on Theoretical Aspects of Computer Science, STACS'99, C. Meinel and S. Tison (Eds.). Springer-Verlag, Lecture Notes in Computer Science 1563 (1999) 313-322.

Crossref

Google Scholar

[6]

M. Koutny, L. Mancini and G. Pappalardo: Two Implementation Relations and the Correctness of Communicated Replicated Processing. Formal Aspects of Computing 9 (1997) 119-148.

Google Scholar

[7]

J. Burton and M. Koutny: Verification of Communicating Processes in the Event of Interface Difference. Proc. of International Workshop on Verification and Computational Logic, VCL2000, M. Leuschel, A. Podelski, C. Ramakrishnan and U. Ulrich-Nitsche(Eds.). Technical Report DSSE-TR-2000-6, University of Southampton (2000).

Google Scholar

[8]

R. Milner: Communication and Concurrency. Prentice Hall (1989).

Crossref

Google Scholar

[9]

A. W. Roscoe: The Theory and Practice of Concurrency. Prentice-Hall (1998).

Crossref

Google Scholar

[10]

R. Sedgewick: Algorithms in C++. Addison-Wesley (1992).

Crossref

Google Scholar

Index Terms

Verifying Implementation Relations

Index terms have been assigned to the content through auto-classification.

Recommendations

Verifying while loops with invariant relations

Traditionally, invariant assertions are used to verify the partial correctness of while loops with respect to pre/post specifications. In this paper we discuss a related but distinct concept, namely invariant relations, and show how invariant relations ...
Verifying a Logic-Synthesis Algorithm and Implementation: A Case Study in Software Verification

We describe the verification of a logic-synthesis tool with the Nuprl proof-development system. The logic-synthesis tool, Pbs, implements the weak-division algorithm. Pbs consists of approximately 1,000 lines of code implemented in a functional subset ...
Extracting and Verifying Hyponymy Relations Based on Multiple Patterns and Features
KI '08: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence

Hyponymy relations play a crucial role in various natural language processing systems. Automatic acquisition and verification of hyponymy relations is a basic problem in knowledge acquisition from text. We present a method that acquires and verifies ...

Comments

Information & Contributors

Information

Published In

FME '01: Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity

March 2001

625 pages

ISBN:3540417915

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 12 March 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations

Verifying while loops with invariant relations

Verifying a Logic-Synthesis Algorithm and Implementation: A Case Study in Software Verification

Extracting and Verifying Hyponymy Relations Based on Multiple Patterns and Features

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations