Bib tweaks, fix typo.
This commit is contained in:
parent
4533a31cd0
commit
b45b01f897
205
bibs/myrefs.bib
205
bibs/myrefs.bib
|
@ -5,10 +5,10 @@
|
||||||
Gr{\'e}goire, Benjamin and
|
Gr{\'e}goire, Benjamin and
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Strub, {P}ierre-{Y}ves},
|
Strub, {P}ierre-{Y}ves},
|
||||||
year = {},
|
year = 2016,
|
||||||
jh = yes,
|
jh = yes,
|
||||||
eprint = yes,
|
eprint = yes,
|
||||||
url = {http://arxiv.org/abs/1607.03455}
|
url = {http://arxiv.org/abs/1607.03455},
|
||||||
}
|
}
|
||||||
|
|
||||||
@unpublished{BEGGHS16,
|
@unpublished{BEGGHS16,
|
||||||
|
@ -19,9 +19,9 @@
|
||||||
Gr{\'e}goire, Benjamin and
|
Gr{\'e}goire, Benjamin and
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Strub, {P}ierre-{Y}ves},
|
Strub, {P}ierre-{Y}ves},
|
||||||
year = {},
|
year = 2016,
|
||||||
jh = yes,
|
jh = yes,
|
||||||
docs = yes
|
docs = yes,
|
||||||
}
|
}
|
||||||
|
|
||||||
@unpublished{ACGHK16,
|
@unpublished{ACGHK16,
|
||||||
|
@ -31,9 +31,9 @@
|
||||||
Gaboardi, Marco and
|
Gaboardi, Marco and
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Katsumata, {Shin-ya}},
|
Katsumata, {Shin-ya}},
|
||||||
year = {},
|
year = 2016,
|
||||||
jh = yes,
|
jh = yes,
|
||||||
docs = yes
|
docs = yes,
|
||||||
}
|
}
|
||||||
|
|
||||||
@unpublished{HKM-verif16,
|
@unpublished{HKM-verif16,
|
||||||
|
@ -44,15 +44,15 @@
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Roth, Aaron and
|
Roth, Aaron and
|
||||||
Strub, Pierre-Yves},
|
Strub, Pierre-Yves},
|
||||||
year = {},
|
year = 2016,
|
||||||
url = {http://arxiv.org/abs/1502.04052},
|
url = {http://arxiv.org/abs/1502.04052},
|
||||||
jh = yes,
|
jh = yes,
|
||||||
eprint = yes
|
eprint = yes,
|
||||||
}
|
}
|
||||||
|
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
@inproceedings{BGGHS16c,
|
@inproceedings{BGGHS16c,
|
||||||
title = {Advanced Probabilistic Couplings for Differential Privacy},
|
title = {Advanced probabilistic couplings for differential privacy},
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
Fong, No{\'e}mie and
|
Fong, No{\'e}mie and
|
||||||
Gaboardi, Marco and
|
Gaboardi, Marco and
|
||||||
|
@ -225,7 +225,7 @@
|
||||||
Gaboardi, Marco and
|
Gaboardi, Marco and
|
||||||
Gallego Arias, Emilio Jes{\'u}s and
|
Gallego Arias, Emilio Jes{\'u}s and
|
||||||
Hsu, Justin},
|
Hsu, Justin},
|
||||||
title = {Really naturally linear indexed type-checking},
|
title = {Really natural linear indexed type-checking},
|
||||||
booktitle = {Symposium on Implementation and Application of Functional
|
booktitle = {Symposium on Implementation and Application of Functional
|
||||||
Programming Languages (IFL), Boston, Massachusetts},
|
Programming Languages (IFL), Boston, Massachusetts},
|
||||||
year = {2014},
|
year = {2014},
|
||||||
|
@ -400,13 +400,11 @@
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Pierce, Benjamin C},
|
Pierce, Benjamin C},
|
||||||
pages = {34--53},
|
pages = {34--53},
|
||||||
editor = {Murawski, Andrzej},
|
|
||||||
journal = {ACM SIGLOG News},
|
journal = {ACM SIGLOG News},
|
||||||
month = jan,
|
month = jan,
|
||||||
year = {2016},
|
year = {2016},
|
||||||
volume = {3},
|
volume = {3},
|
||||||
number = {1},
|
number = {1},
|
||||||
publisher = {ACM},
|
|
||||||
address = {New York, NY, USA},
|
address = {New York, NY, USA},
|
||||||
url = {http://siglog.hosting.acm.org/wp-content/uploads/2016/01/siglog_news_7.pdf},
|
url = {http://siglog.hosting.acm.org/wp-content/uploads/2016/01/siglog_news_7.pdf},
|
||||||
jh = yes,
|
jh = yes,
|
||||||
|
@ -943,7 +941,6 @@
|
||||||
journal = jufks,
|
journal = jufks,
|
||||||
volume = {10},
|
volume = {10},
|
||||||
number = {5},
|
number = {5},
|
||||||
month = oct,
|
|
||||||
year = {2002},
|
year = {2002},
|
||||||
pages = {557--570},
|
pages = {557--570},
|
||||||
url = {http://dl.acm.org/citation.cfm?id=774552}
|
url = {http://dl.acm.org/citation.cfm?id=774552}
|
||||||
|
@ -1000,7 +997,7 @@
|
||||||
year = {2011}
|
year = {2011}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{certipriv,
|
@article{BKOZ13-toplas,
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
K{\"{o}}pf, Boris and
|
K{\"{o}}pf, Boris and
|
||||||
Olmedo, Federico and
|
Olmedo, Federico and
|
||||||
|
@ -2534,9 +2531,6 @@ verification conditions},
|
||||||
C{\'{e}}sar Kunz and
|
C{\'{e}}sar Kunz and
|
||||||
Benedikt Schmidt and
|
Benedikt Schmidt and
|
||||||
Pierre{-}Yves Strub},
|
Pierre{-}Yves Strub},
|
||||||
editor = {Alessandro Aldini and
|
|
||||||
Javier Lopez and
|
|
||||||
Fabio Martinelli},
|
|
||||||
title = {EasyCrypt: {A} Tutorial},
|
title = {EasyCrypt: {A} Tutorial},
|
||||||
booktitle = {Foundations of Security Analysis and Design {VII} - {FOSAD} 2012/2013
|
booktitle = {Foundations of Security Analysis and Design {VII} - {FOSAD} 2012/2013
|
||||||
Tutorial Lectures},
|
Tutorial Lectures},
|
||||||
|
@ -2547,13 +2541,14 @@ verification conditions},
|
||||||
year = {2013}
|
year = {2013}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{Hoare69,
|
@article{hoare1969axiomatic,
|
||||||
author = {C. A. R. Hoare},
|
title={An axiomatic basis for computer programming},
|
||||||
title = {An Axiomatic Basis for Computer Programming},
|
author={Hoare, Charles Antony Richard},
|
||||||
journal = cacm,
|
journal=cacm,
|
||||||
year = {1969},
|
volume={12},
|
||||||
volume = {12},
|
number={10},
|
||||||
number = {10}
|
pages={576--580},
|
||||||
|
year={1969},
|
||||||
}
|
}
|
||||||
|
|
||||||
@incollection{Floyd67,
|
@incollection{Floyd67,
|
||||||
|
@ -2801,7 +2796,6 @@ language = {English}
|
||||||
volume = "49",
|
volume = "49",
|
||||||
number = "5",
|
number = "5",
|
||||||
pages = "672--713",
|
pages = "672--713",
|
||||||
month = sep,
|
|
||||||
year = "2002",
|
year = "2002",
|
||||||
journal-url = "http://portal.acm.org/browse_dl.cfm?idx = J401",
|
journal-url = "http://portal.acm.org/browse_dl.cfm?idx = J401",
|
||||||
}
|
}
|
||||||
|
@ -2997,7 +2991,6 @@ language = {English}
|
||||||
title = "A Linear Logical Framework",
|
title = "A Linear Logical Framework",
|
||||||
author = "Iliano Cervesato and Frank Pfenning",
|
author = "Iliano Cervesato and Frank Pfenning",
|
||||||
journal = ic,
|
journal = ic,
|
||||||
month = nov,
|
|
||||||
year = "2002",
|
year = "2002",
|
||||||
volume = "179",
|
volume = "179",
|
||||||
number = "1",
|
number = "1",
|
||||||
|
@ -3442,7 +3435,6 @@ year = {2011}
|
||||||
@Inproceedings {BBDSics11,
|
@Inproceedings {BBDSics11,
|
||||||
author = {Babaioff, Moshe and Blumrosen, Liad and Dughmi, Shaddin and Singer, Yaron},
|
author = {Babaioff, Moshe and Blumrosen, Liad and Dughmi, Shaddin and Singer, Yaron},
|
||||||
booktitle = itcs11,
|
booktitle = itcs11,
|
||||||
month = jan,
|
|
||||||
publisher = {Tsinghua University Press},
|
publisher = {Tsinghua University Press},
|
||||||
title = {Posting Prices with Unknown Distributions},
|
title = {Posting Prices with Unknown Distributions},
|
||||||
year = {2011},
|
year = {2011},
|
||||||
|
@ -3578,7 +3570,6 @@ author = "Faruk Gul and Ennio Stacchetti"
|
||||||
volume={10},
|
volume={10},
|
||||||
number={3},
|
number={3},
|
||||||
pages={853--865},
|
pages={853--865},
|
||||||
month=sep,
|
|
||||||
keywords={Substitutability; matching; combinatorial auctions; matroids},
|
keywords={Substitutability; matching; combinatorial auctions; matroids},
|
||||||
abstract={We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result implies that not every substitutable valuation function can be \"decomposed\" into a combination of unit-demand valuations.},
|
abstract={We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result implies that not every substitutable valuation function can be \"decomposed\" into a combination of unit-demand valuations.},
|
||||||
url={https://econtheory.org/ojs/index.php/te/article/viewFile/20150853/13867/412}
|
url={https://econtheory.org/ojs/index.php/te/article/viewFile/20150853/13867/412}
|
||||||
|
@ -3590,7 +3581,6 @@ isbn={978-3-540-61310-7},
|
||||||
booktitle=ipco06,
|
booktitle=ipco06,
|
||||||
volume={1084},
|
volume={1084},
|
||||||
series={Lecture Notes in Computer Science},
|
series={Lecture Notes in Computer Science},
|
||||||
editor={Cunningham, William H and McCormick, S Thomas and Queyranne, Maurice},
|
|
||||||
title={Convexity and {S}teinitz's exchange property},
|
title={Convexity and {S}teinitz's exchange property},
|
||||||
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
|
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
|
||||||
publisher={Springer Berlin Heidelberg},
|
publisher={Springer Berlin Heidelberg},
|
||||||
|
@ -3718,7 +3708,6 @@ keywords = "Underdemanded set "
|
||||||
volume = {58},
|
volume = {58},
|
||||||
number = {1},
|
number = {1},
|
||||||
year = 2015,
|
year = 2015,
|
||||||
month = jan,
|
|
||||||
pages = {61--103},
|
pages = {61--103},
|
||||||
url = {http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.58_01_061.pdf}
|
url = {http://www.orsj.or.jp/~archive/pdf/e_mag/Vol.58_01_061.pdf}
|
||||||
}
|
}
|
||||||
|
@ -3802,7 +3791,6 @@ Hartline, Jason D and Talwar, Kunal},
|
||||||
url = {http://reports-archive.adm.cs.cmu.edu/anon/2007/CMU-CS-07-154.pdf},
|
url = {http://reports-archive.adm.cs.cmu.edu/anon/2007/CMU-CS-07-154.pdf},
|
||||||
year = {2007},
|
year = {2007},
|
||||||
institution = {Carnegie Mellon University},
|
institution = {Carnegie Mellon University},
|
||||||
month = sep,
|
|
||||||
Date-Added = {09-01-2007},
|
Date-Added = {09-01-2007},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -3862,10 +3850,6 @@ language={English}
|
||||||
@inproceedings{BartheO13,
|
@inproceedings{BartheO13,
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
Olmedo, Federico},
|
Olmedo, Federico},
|
||||||
editor = {Fedor V. Fomin and
|
|
||||||
Rusins Freivalds and
|
|
||||||
Marta Z. Kwiatkowska and
|
|
||||||
David Peleg},
|
|
||||||
title = {Beyond Differential Privacy: Composition Theorems and Relational Logic
|
title = {Beyond Differential Privacy: Composition Theorems and Relational Logic
|
||||||
for $f$-divergences between Probabilistic Programs},
|
for $f$-divergences between Probabilistic Programs},
|
||||||
booktitle = icalp13,
|
booktitle = icalp13,
|
||||||
|
@ -3943,7 +3927,6 @@ url = {https://www.cs.colorado.edu/~srirams/papers/sas14-expectations.pdf}
|
||||||
@inproceedings{CousotM12,
|
@inproceedings{CousotM12,
|
||||||
author = {Patrick Cousot and
|
author = {Patrick Cousot and
|
||||||
Michael Monerau},
|
Michael Monerau},
|
||||||
editor = {Helmut Seidl},
|
|
||||||
title = {Probabilistic Abstract Interpretation},
|
title = {Probabilistic Abstract Interpretation},
|
||||||
booktitle = esop12,
|
booktitle = esop12,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = {Lecture Notes in Computer Science},
|
||||||
|
@ -3999,3 +3982,153 @@ url = {https://www.cs.colorado.edu/~srirams/papers/sas14-expectations.pdf}
|
||||||
year={2015},
|
year={2015},
|
||||||
publisher={American Association for the Advancement of Science}
|
publisher={American Association for the Advancement of Science}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@article{aldous93shift,
|
||||||
|
author = {Aldous, D. J. and Thorisson, H.},
|
||||||
|
citeulike-article-id = {4046853},
|
||||||
|
journal = {Stochastic Proc. Appl},
|
||||||
|
keywords = {aldousbib},
|
||||||
|
mrnumber = {1198659},
|
||||||
|
pages = {1--14},
|
||||||
|
posted-at = {2009-02-13 21:55:05},
|
||||||
|
priority = {2},
|
||||||
|
title = {{Shift-Coupling}},
|
||||||
|
volume = {44},
|
||||||
|
year = {1993}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{bubley1997path,
|
||||||
|
title={Path coupling: A technique for proving rapid mixing in {M}arkov chains},
|
||||||
|
author={Bubley, Russ and Dyer, Martin},
|
||||||
|
booktitle=focs97,
|
||||||
|
pages={223--231},
|
||||||
|
year={1997},
|
||||||
|
}
|
||||||
|
|
||||||
|
@unpublished{BunS2016,
|
||||||
|
author = {{Bun}, M. and {Steinke}, T.},
|
||||||
|
title = "{Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds}",
|
||||||
|
journal = {ArXiv e-prints},
|
||||||
|
archivePrefix = "arXiv",
|
||||||
|
eprint = {1605.02065},
|
||||||
|
primaryClass = "cs.CR",
|
||||||
|
keywords = {Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms, Computer Science - Information Theory, Computer Science - Learning},
|
||||||
|
year = 2016,
|
||||||
|
}
|
||||||
|
|
||||||
|
@unpublished{BunSU16,
|
||||||
|
author = {{Bun}, M. and {Steinke}, T. and {Ullman}, J.},
|
||||||
|
title = {Make Up Your Mind: The Price of Online Queries in Differential Privacy},
|
||||||
|
journal = {ArXiv e-prints},
|
||||||
|
archivePrefix = "arXiv",
|
||||||
|
eprint = {1604.04618},
|
||||||
|
primaryClass = "cs.CR",
|
||||||
|
keywords = {Computer Science - Cryptography and Security, Computer Science - Data Structures and Algorithms, Computer Science - Learning},
|
||||||
|
year = 2016,
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{moser2009constructive,
|
||||||
|
title={A constructive proof of the {Lov{\'a}sz Local Lemma}},
|
||||||
|
author={Moser, Robin A},
|
||||||
|
booktitle=stoc09,
|
||||||
|
pages={343--350},
|
||||||
|
year={2009},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{micciancio1997oblivious,
|
||||||
|
title={Oblivious data structures: applications to cryptography},
|
||||||
|
author={Micciancio, Daniele},
|
||||||
|
booktitle=stoc97,
|
||||||
|
pages={456--464},
|
||||||
|
year={1997},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{jonsson1991specification,
|
||||||
|
title={Specification and refinement of probabilistic processes},
|
||||||
|
author={Jonsson, Bengt and Larsen, Kim Guldstrand},
|
||||||
|
booktitle=lics91,
|
||||||
|
pages={266--277},
|
||||||
|
year={1991},
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{barthe2013probabilistic,
|
||||||
|
title={Probabilistic relational reasoning for differential privacy},
|
||||||
|
author={Barthe, Gilles and K{\"o}pf, Boris and Olmedo, Federico and
|
||||||
|
Zanella-B{\'e}guelin, Santiago},
|
||||||
|
journal=toplas,
|
||||||
|
volume={35},
|
||||||
|
number={3},
|
||||||
|
pages={9},
|
||||||
|
year={2013},
|
||||||
|
url={http://software.imdea.org/~bkoepf/papers/toplas13.pdf}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{rogers2016privacy,
|
||||||
|
title={Privacy Odometers and Filters: Pay-as-you-Go Composition},
|
||||||
|
author={Rogers, Ryan and Roth, Aaron and Ullman, Jonathan and Vadhan,
|
||||||
|
Salil},
|
||||||
|
journal={arXiv preprint arXiv:1605.08294},
|
||||||
|
year={2016},
|
||||||
|
url={http://arxiv.org/abs/1605.08294}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{sousa2016cartesian,
|
||||||
|
title={Cartesian hoare logic for verifying k-safety properties},
|
||||||
|
author={Sousa, Marcelo and Dillig, Isil},
|
||||||
|
booktitle=pldi16,
|
||||||
|
pages={57--69},
|
||||||
|
year={2016},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{BKOZ12-popl,
|
||||||
|
title={Probabilistic relational reasoning for differential privacy},
|
||||||
|
author={Barthe, Gilles and K{\"o}pf, Boris and Olmedo, Federico and
|
||||||
|
Zanella B{\'e}guelin, Santiago},
|
||||||
|
booktitle=popl12,
|
||||||
|
volume={47},
|
||||||
|
number={1},
|
||||||
|
pages={97--110},
|
||||||
|
year={2012},
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{zhang2016autopriv,
|
||||||
|
title={AutoPriv: Automating Differential Privacy Proofs},
|
||||||
|
author={Zhang, Danfeng and Kifer, Daniel},
|
||||||
|
journal={arXiv preprint arXiv:1607.08228},
|
||||||
|
year={2016}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{JerrumS89,
|
||||||
|
author = {Mark Jerrum and
|
||||||
|
Alistair Sinclair},
|
||||||
|
title = {Approximating the Permanent},
|
||||||
|
journal = siamjc,
|
||||||
|
volume = {18},
|
||||||
|
number = {6},
|
||||||
|
pages = {1149--1178},
|
||||||
|
year = {1989},
|
||||||
|
url = {http://dx.doi.org/10.1137/0218077},
|
||||||
|
doi = {10.1137/0218077},
|
||||||
|
timestamp = {Mon, 12 Sep 2011 16:10:07 +0200},
|
||||||
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/siamcomp/JerrumS89},
|
||||||
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{DBLP:journals/rsa/Jerrum95,
|
||||||
|
author = {Mark Jerrum},
|
||||||
|
title = {A Very Simple Algorithm for Estimating the Number of
|
||||||
|
k-Colorings of a Low-Degree Graph},
|
||||||
|
journal = {Random Struct. Algorithms},
|
||||||
|
volume = {7},
|
||||||
|
number = {2},
|
||||||
|
pages = {157--166},
|
||||||
|
year = {1995},
|
||||||
|
url = {http://dx.doi.org/10.1002/rsa.3240070205},
|
||||||
|
doi = {10.1002/rsa.3240070205},
|
||||||
|
timestamp = {Sat, 14 Apr 2012 16:35:21 +0200},
|
||||||
|
biburl =
|
||||||
|
{http://dblp.uni-trier.de/rec/bib/journals/rsa/Jerrum95},
|
||||||
|
bibsource = {dblp computer science bibliography,
|
||||||
|
http://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue