2010
DOI: 10.1007/978-3-642-15375-4_23
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract. An impure language is one that combines functional and imperative constructs. We propose a method for ensuring termination of impure concurrent languages that makes it possible to combine term rewriting measure-based techniques with traditional approaches for termination in functional languages such as logical relations. The method can be made parametric on the termination technique employed on the functional part; it can also be iterated. We illustrate the method in the case of a π-calculus with bot… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
2
1

Relationship

3
4

Authors

Journals

citations
Cited by 20 publications
(37 citation statements)
references
References 8 publications
(9 reference statements)
0
37
0
Order By: Relevance
“…As a future work, we would like to continue the study of the introduced equivalence by investigating a labelled characterisation of barbed congruence and algebraic characterisations, or transferring type-based techniques from the π-calculus (e.g. to control termination, lock-freedom and deadlock [32,14,18,19]). Moreover, we would like to investigate other approaches to observational semantics such as may and must testing.…”
Section: Resultsmentioning
confidence: 99%
“…As a future work, we would like to continue the study of the introduced equivalence by investigating a labelled characterisation of barbed congruence and algebraic characterisations, or transferring type-based techniques from the π-calculus (e.g. to control termination, lock-freedom and deadlock [32,14,18,19]). Moreover, we would like to investigate other approaches to observational semantics such as may and must testing.…”
Section: Resultsmentioning
confidence: 99%
“…Interesting results have been obtained recently indicating that those techniques can be quite useful in the concurrent context too, thus being potentially interesting for CBUS. Results in this direction have been published in [34], [25], [35], [36], [55], [32], [29], [14], [15], [50] In [34], techniques ensuring termination combining tools coming from term rewriting with logical relations are introduced and exploited in the context of a π-calculus with functional and imperative names. Noticeably, the introduced technique allows to capture a large class of programs and processes.…”
Section: Resource Controlmentioning
confidence: 99%
“…Techniques for ensuring termination, hence divergence freedom, for the π -calculus have been studied in, e.g., [6,27,32].…”
Section: E[ F ]mentioning
confidence: 99%