Add auto-coupling preprint.
This commit is contained in:
parent
7f9e70c8e4
commit
b4d672bd50
|
@ -4,6 +4,8 @@
|
||||||
author = {Albarghouthi, Aws and
|
author = {Albarghouthi, Aws and
|
||||||
Hsu, Justin},
|
Hsu, Justin},
|
||||||
year = 2017,
|
year = 2017,
|
||||||
|
jh = yes,
|
||||||
|
url = {http://arxiv.org/abs/1709.05361},
|
||||||
note = {In submission.}
|
note = {In submission.}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -6067,3 +6069,67 @@ publisher=springer
|
||||||
year = 2017
|
year = 2017
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@article{Callahan1988,
|
||||||
|
author="Callahan, David and Kennedy, Ken",
|
||||||
|
title="Compiling programs for distributed-memory multiprocessors",
|
||||||
|
journal="The Journal of Supercomputing",
|
||||||
|
year="1988",
|
||||||
|
month="Oct",
|
||||||
|
volume="2",
|
||||||
|
number="2",
|
||||||
|
pages="151--169",
|
||||||
|
abstract="We describe a new approach to programming distributed-memory
|
||||||
|
computers. Rather than having each node in the system explicitly programmed, we
|
||||||
|
derive an efficient message-passing program from a sequential shared-memory
|
||||||
|
program annotated with directions on how elements of shared arrays are
|
||||||
|
distributed to processors. This article describes one possible input language
|
||||||
|
for describing distributions and then details the compilation process and the
|
||||||
|
optimization necessary to generate an efficient program.",
|
||||||
|
issn="1573-0484",
|
||||||
|
doi="10.1007/BF00128175",
|
||||||
|
url="https://doi.org/10.1007/BF00128175"
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{Chatterjee:2016:AAQ:2837614.2837639,
|
||||||
|
author = {Chatterjee, Krishnendu and Fu, Hongfei and Novotn\'{y}, Petr and Hasheminezhad, Rouzbeh},
|
||||||
|
title = {Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs},
|
||||||
|
booktitle = popl16,
|
||||||
|
year = {2016},
|
||||||
|
isbn = {978-1-4503-3549-2},
|
||||||
|
pages = {327--342},
|
||||||
|
numpages = {16},
|
||||||
|
url = {http://doi.acm.org/10.1145/2837614.2837639},
|
||||||
|
doi = {10.1145/2837614.2837639},
|
||||||
|
acmid = {2837639},
|
||||||
|
keywords = {Concentration, Probabilistic Programs, Ranking Supermartingale, Termination},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{Chatterjee2016,
|
||||||
|
author= {Chatterjee, Krishnendu and Fu, Hongfei and Goharshady, Amir
|
||||||
|
Kafshdar},
|
||||||
|
title= {Termination Analysis of Probabilistic Programs Through Positivstellensatz's},
|
||||||
|
bookTitle=cav16,
|
||||||
|
year="2016",
|
||||||
|
publisher=springer,
|
||||||
|
series=lncs,
|
||||||
|
volume=9779,
|
||||||
|
pages="3--22",
|
||||||
|
isbn="978-3-319-41528-4",
|
||||||
|
doi="10.1007/978-3-319-41528-4_1",
|
||||||
|
url="https://doi.org/10.1007/978-3-319-41528-4_1"
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{Chatterjee:2017:SIP:3009837.3009873,
|
||||||
|
author = {Chatterjee, Krishnendu and Novotn\'{y}, Petr and \v{Z}ikeli\'{c}, {\DH}or{\dj}e},
|
||||||
|
title = {Stochastic Invariants for Probabilistic Termination},
|
||||||
|
booktitle = popl17,
|
||||||
|
year = {2017},
|
||||||
|
isbn = {978-1-4503-4660-3},
|
||||||
|
pages = {145--160},
|
||||||
|
numpages = {16},
|
||||||
|
url = {http://doi.acm.org/10.1145/3009837.3009873},
|
||||||
|
doi = {10.1145/3009837.3009873},
|
||||||
|
acmid = {3009873},
|
||||||
|
keywords = {Concentration, Martingales, Probabilistic Programs, Termination},
|
||||||
|
}
|
||||||
|
|
||||||
|
|
|
@ -1,3 +1,5 @@
|
||||||
|
+ **09/2017** Our preprint **Synthesizing Coupling Proofs of Differential
|
||||||
|
Privacy** is now available.
|
||||||
+ **07/2017** Slides now available for **\*-Liftings for differential privacy**.
|
+ **07/2017** Slides now available for **\*-Liftings for differential privacy**.
|
||||||
+ **07/2017** Our preprint **Proving expected sensitivity of probabilistic
|
+ **07/2017** Our preprint **Proving expected sensitivity of probabilistic
|
||||||
programs** is now available.
|
programs** is now available.
|
||||||
|
|
Loading…
Reference in New Issue