Knowledge-based synthesis of distributed systems using event structures (2005)
Cached
Download Links
| Venue: | In Proc. 11th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), Lecture Notes in Computer Science |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Bickford05knowledge-basedsynthesis,
author = {Mark Bickford and Robert C. Constable and Joseph Y. Halpern and Sabina Petride},
title = {Knowledge-based synthesis of distributed systems using event structures},
booktitle = {In Proc. 11th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), Lecture Notes in Computer Science},
year = {2005},
pages = {449--465},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a high-level language that makes it easy for designers to specify their goals. We consider a high-level specification language that results from adding knowledge to a fragment of Nuprl specifically tailored for specifying distributed protocols, called event theory. We then show how high-level knowledge-based programs can be synthesized from the knowledge-based specifications using a proof development system such as Nuprl. Methods of Halpern and Zuck [1992] then apply to convert these knowledge-based protocols to ordinary protocols. These methods can be expressed as heuristic transformation tactics in Nuprl. 1
