A provably correct compiler for efficient model checking of mobile processes (2005)
Cached
Download Links
- [www.lmc.cs.sunysb.edu]
- [www.lmc.cs.sunysb.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of PADL |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Yang05aprovably,
author = {Ping Yang and C. R. Ramakrishnan and Scott A. Smolka},
title = {A provably correct compiler for efficient model checking of mobile processes},
booktitle = {In Proceedings of PADL},
year = {2005},
pages = {113--127},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present an optimizing compiler for the π-calculus that significantly improves the time and space performance of the MMC model checker. MMC exploits the similarity between the manner in which resolution techniques handle variables in a logic program and the manner in which the operational semantics of the π-calculus handles names by representing π-calculus names in MMC as Prolog variables, with distinct names represented by distinct variables. Given a π-calculus process P, our compiler for MMC produces an extremely compact representation of P ’s symbolic state space as a set of transition rules. ItalsousesAC unification to recognize states that are equivalent due to symmetry.
