Partial Evaluation Scheme for Concurrent Languages and Its Correctness
Lists
Only you see this
Abstract
A simple, general, and well-formalized partial evaluation method for concurrent languages is proposed. In spite of many potential benefits, there are few partial evaluation techniques for concurrent languages. We choose a process calculus for the target language because it has theoretical clarity, and yet has expressive power enough to represent various high-level constructs in concurrent object-oriented languages. We realize effective optimization by allowing elimination of even nondeterministic interprocess communications. Furthermore, we prove correctness of our method with respect to barb-agreed simulation.
BibTeX
@inproceedings{hosoya1996partial,
author = {Haruo Hosoya and Naoki Kobayashi and Akinori Yonezawa},
title = {{Partial Evaluation Scheme for Concurrent Languages and Its Correctness}},
booktitle = {Euro-Par, Vol. I},
year = {1996},
doi = {10.1007/3-540-61626-8\_83},
}| Compositional Analysis for Concurrent Constraint Programming | Lics · 1993 |
| Quantitative Synthesis for Concurrent Programs | arXiv · 2011 |
| Advances in Analyzing Coroutines by Abstract Conjunctive Partial Deduction | Iclp (technical Communications) · 2015 |
| Concurrency in Proof Normalization and Logic Programming | IJCAI · 1985 |
| Unfolding-based Partial Order Reduction | arXiv · 2015 |
| Value-centric Dynamic Partial Order Reduction | arXiv · 2019 |