DOI: 10.1007/978-0-387-09680-3_28
|View full text |Cite
|
Sign up to set email alerts
|

Abstract: Abstract.A process terminates if all its reduction sequences are finite. We propose two type systems that ensure termination of π-calculus processes. Our first type system is purely static. It refines previous type systems by Deng and Sangiorgi by taking into account certain partial order information on names so to enhance the techniques from term rewriting (based on lexicographic and multiset orderings) that underpin the proof of termination. The second system is mixed, in that it combines a static and a dyna… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…On the other hand, complexity lattice may be an interesting tool to study small complexity classes and to to study the complexity of process calculus computation with respect to causality see e.g. [31].…”
Section: Discussionmentioning
confidence: 99%
“…On the other hand, complexity lattice may be an interesting tool to study small complexity classes and to to study the complexity of process calculus computation with respect to causality see e.g. [31].…”
Section: Discussionmentioning
confidence: 99%
“…The type system we have described above is further enriched in [DHS08]. In that more re ned system, one is able to type-check processes corresponding to tree structures.…”
Section: Enhancements Of the Basic Type Systemmentioning
confidence: 99%
“…Type inference in S1 boils down to searching for cycles in a directed graph: we construct a graph by associating a vertex to every name used in the process, and we draw an edge from a to b to represent the constraint lvl(a) > lvl(b). This algorithm is implemented in [Kob07], and in [Bou08], where a more expressive variant of S1, described in [DHS08], is also implemented.…”
Section: On the Complexity Of Type Inferencementioning
confidence: 99%
See 1 more Smart Citation