Hostname: page-component-6bf8c574d5-b4m5d Total loading time: 0 Render date: 2025-02-21T03:31:40.825Z Has data issue: false hasContentIssue false
  • English
  • Français

General conditions for full abstraction

Published online by Cambridge University Press:  10 November 2014

JOACHIM PARROW
JOACHIM PARROW*
Affiliation:
Department of Information Technology, Uppsala University, Uppsala, Sweden Email: joachim@it.uu.se
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Full abstraction, i.e. that a function preserves equivalence from a source to a target, has been used extensively as a correctness criterion for mappings between models of computation. I here show that with fixed equivalences, fully abstract functions almost always exist. Also, with the function and one of the equivalences fixed the other equivalence can almost always be found.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 26 , Issue 4 , May 2016 , pp. 655 - 657
Copyright
Copyright © Cambridge University Press 2014 

References

Beauxis, R., Palamidessi, C. and Valencia, F. D. (2008) On the asynchronous nature of the asynchronous pi-calculus. In: Degano, P., De Nicola, R. and Meseguer, J. (eds.) Concurrency, Graphs and Models. Springer Lecture Notes in Computer Science 5065 473–492.Google Scholar
Gorla, D. and Nestmann, U. (2014) Full abstraction for expressiveness: History, myths and facts. In this issue of Mathematical Structures in Computer Scinece.Google Scholar