@inproceedings{ab6175ca9a4143b783368b2a813fef36,
title = "Bisimulations up-to: Beyond first-order transition systems",
abstract = "The bisimulation proof method can be enhanced by employing 'bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on the notion of compatible function for fixed-point theory. We transport this theory onto languages whose bisimilarity and LTS go beyond those of first-order models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the first-order ones. This allows us to reuse directly the large corpus of up-to techniques that are available on first-order LTSs. The only ingredient that has to be manually supplied is the compatibility of basic up-to techniques that are specific to the new languages. We investigate the method on the π-calculus, the λ-calculus, and a (call-by-value) λ-calculus with references.",
author = "Madiot, \{Jean Marie\} and Damien Pous and Davide Sangiorgi",
year = "2014",
month = jan,
day = "1",
doi = "10.1007/978-3-662-44584-6\_8",
language = "English",
isbn = "9783662445839",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "93--108",
booktitle = "Concurrency Theory - 25th International Conference, CONCUR 2014, Proceedings",
note = "25th International Conference on Concurrency Theory, CONCUR 2014 ; Conference date: 02-09-2014 Through 05-09-2014",
}