Copyright Information
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of
scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other
copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying
this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without
the explicit permission of the copyright holder.
show main publications
On the Complexity of Termination Inference for Processes
@INPROCEEDINGS{DHKS07,
title = {{On the Complexity of Termination Inference for Processes}},
author = {{Romain} {Demangeon} and {Daniel} {Hirschkoff} and {Naoki} {Kobayashi} and {Davide} {Sangiorgi}},
booktitle = {Proceedings of TGC 2007},
editor = {Gilles Barthe and C\'edric Fournet},
pages = {140--155},
abstract = {We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done in polynomial time for two of these, but that this is not the case for the two most expressive systems. To remedy this, we study two modifications of these type systems that allow us to recover a polynomial type inference.
},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {4912},
year = {2007},
url = {http://rap.dsi.unifi.it/sensoriasite/inference.pdf},
doi = {10.1007/978-3-540-78663-4_11},
invited = {N},
keywords = {pi-calculus, process calculi, termination, type system},
partner = {UNIBO},
status = {public},
task = {T3.3},
}
|
