Abstract
This paper outlines the concept
of extit{probabilistic} program slicing. It walks through
a simple example before describing some algorithmic
concerns. Then three motivating applications are described.
Finally it highlights existing work that may be built upon,
and future work that needs immediate attention if
this idea is to succeed.
BibTeX - Entry
@InProceedings{singer:DagSemProc.05451.9,
author = {Singer, Jeremy},
title = {{Towards Probabilistic Program Slicing}},
booktitle = {Beyond Program Slicing},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5451},
editor = {David W. Binkley and Mark Harman and Jens Krinke},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/485},
URN = {urn:nbn:de:0030-drops-4856},
doi = {10.4230/DagSemProc.05451.9},
annote = {Keywords: Probability, slicing, speculation}
}
Keywords: |
|
Probability, slicing, speculation |
Collection: |
|
05451 - Beyond Program Slicing |
Issue Date: |
|
2006 |
Date of publication: |
|
07.07.2006 |