Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…We now turn our attention to an instance of the generic type system that captures a liveness property. Demangeon et al [7] present a type system for checking termination in variants of the HOπ-calculus: for any well-typed process P we have that P → * P →. These authors study HOpi 2 , a higher-order process calculus in which only processes can be communicated.…”
Section: A Type System For Terminationmentioning
confidence: 99%
See 1 more Smart Citation
“…We now turn our attention to an instance of the generic type system that captures a liveness property. Demangeon et al [7] present a type system for checking termination in variants of the HOπ-calculus: for any well-typed process P we have that P → * P →. These authors study HOpi 2 , a higher-order process calculus in which only processes can be communicated.…”
Section: A Type System For Terminationmentioning
confidence: 99%
“…Not surprisingly, there is therefore little work on type systems for higher-order calculi, since these encodings allow us to disregard the higher-order behaviour and instead just type the first-order translations. One exception is the type system for termination in variants of HOπ, due to Demangeon et al [7]. As these authors argue, it may not always be desirable (or even possible) to type a higher-order language through a first-order representation, if the language contains features that are difficult (or impossible) to encode.…”
Section: Introductionmentioning
confidence: 99%
“…As mentioned in Section 1, there have been a number of studies on termination of the π-calculus [13,11,26,19,29,12,28], but most of them have been rather theoretical, and few tools have been developed. Our technique has been partially inspired by Deng and Sangiorgi's work [13], especially by their observation that a process is terminating just if there is no infinite chain of communications on replicated input processes.…”
Section: Related Workmentioning
confidence: 99%
“…We propose a fully automated method for proving termination of π-calculus processes. Although there have been a lot of studies on termination analysis for the π-calculus and related calculi [13,11,26,19,29,12,28], most of them have been rather theoretical, and there have been surprisingly little efforts in developing fully automated termination verification methods and tools based on them. To our knowledge, Kobayashi's TyPiCal [18,19] is the only exception that can prove termination of π-calculus processes (extended with natural numbers) fully automatically, but its termination analysis is quite limited (see Section 6).…”
Section: Introductionmentioning
confidence: 99%
“…Proving properties for concurrent systems is still a challenge, even though type systems offering guarantees of various forms of safety have been explored extensively. There are, for example, type systems guaranteeing deadlock and livelock freedom of processes [55,58,64,76], type systems for checking the correctness of communications among processes, such as session types [51], and type systems for proving the termination of processes [35,82]. However, little was known about the existence of type systems able not only to guarantee but also to characterise some relevant property of concurrent processes, i.e., yielding completeness in addition to soundness, until the intersection type system in [33].…”
Section: Behaviour Of π -Processesmentioning
confidence: 99%