Add SODA acceptance.
This commit is contained in:
parent
86eb4a6f37
commit
52cdd93510
|
@ -324,6 +324,7 @@
|
||||||
@STRING{soda11 = soda # ", San Francisco, California"}
|
@STRING{soda11 = soda # ", San Francisco, California"}
|
||||||
@STRING{soda12 = soda # ", Kyoto, Japan"}
|
@STRING{soda12 = soda # ", Kyoto, Japan"}
|
||||||
@STRING{soda14 = soda # ", Portland, Oregon"}
|
@STRING{soda14 = soda # ", Portland, Oregon"}
|
||||||
|
@STRING{soda16 = soda # ", Arlington, Virginia"}
|
||||||
|
|
||||||
% ----
|
% ----
|
||||||
@STRING{tcc = "{IACR} {T}heory of {C}ryptography {C}onference (TCC)"}
|
@STRING{tcc = "{IACR} {T}heory of {C}ryptography {C}onference (TCC)"}
|
||||||
|
|
181
bibs/myrefs.bib
181
bibs/myrefs.bib
|
@ -13,18 +13,6 @@
|
||||||
eprint = yes
|
eprint = yes
|
||||||
}
|
}
|
||||||
|
|
||||||
@unpublished{HHRW15,
|
|
||||||
author = {Hsu, Justin and
|
|
||||||
Huang, Zhiyi and
|
|
||||||
Roth, Aaron and
|
|
||||||
Wu, Zhiwei Steven},
|
|
||||||
title = {Jointly private convex programming},
|
|
||||||
year = {2015},
|
|
||||||
url = {http://arxiv.org/abs/1411.0998},
|
|
||||||
jh = yes,
|
|
||||||
eprint = yes
|
|
||||||
}
|
|
||||||
|
|
||||||
@unpublished{BEGGHS15,
|
@unpublished{BEGGHS15,
|
||||||
title = {Formal Certification of Randomized Algorithms},
|
title = {Formal Certification of Randomized Algorithms},
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
|
@ -39,6 +27,20 @@
|
||||||
}
|
}
|
||||||
|
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
|
@inproceedings{HHRW16,
|
||||||
|
author = {Hsu, Justin and
|
||||||
|
Huang, Zhiyi and
|
||||||
|
Roth, Aaron and
|
||||||
|
Wu, Zhiwei Steven},
|
||||||
|
title = {Jointly private convex programming},
|
||||||
|
booktitle = soda16,
|
||||||
|
year = {2016},
|
||||||
|
url = {http://arxiv.org/abs/1411.0998},
|
||||||
|
jh = yes,
|
||||||
|
eprint = yes,
|
||||||
|
note = {To appear.}
|
||||||
|
}
|
||||||
|
|
||||||
@inproceedings{BEGHSS15,
|
@inproceedings{BEGHSS15,
|
||||||
title = {Relational reasoning via probabilistic coupling},
|
title = {Relational reasoning via probabilistic coupling},
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
|
@ -621,7 +623,7 @@
|
||||||
booktitle = sp08,
|
booktitle = sp08,
|
||||||
year = {2008},
|
year = {2008},
|
||||||
pages = {111--125},
|
pages = {111--125},
|
||||||
url = {http://arxiv.org/abs/cs/0610105.pdf}
|
url = {http://arxiv.org/abs/cs/0610105}
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{BLST10,
|
@inproceedings{BLST10,
|
||||||
|
@ -1170,7 +1172,7 @@ url={http://goto.ucsd.edu/~nvazou/refinement_types_for_haskell.pdf}
|
||||||
|
|
||||||
@book{McIver:2005,
|
@book{McIver:2005,
|
||||||
Author = {{M}c{I}ver, A. and Morgan, C.},
|
Author = {{M}c{I}ver, A. and Morgan, C.},
|
||||||
Publisher = {Springer},
|
Publisher = springer,
|
||||||
Series = {Monographs in Computer Science},
|
Series = {Monographs in Computer Science},
|
||||||
Title = {Abstraction, Refinement, and Proof for Probabilistic Systems},
|
Title = {Abstraction, Refinement, and Proof for Probabilistic Systems},
|
||||||
Year = {2005}}
|
Year = {2005}}
|
||||||
|
@ -1322,7 +1324,7 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pd
|
||||||
title = {Information Flow Analysis in Logical Form},
|
title = {Information Flow Analysis in Logical Form},
|
||||||
booktitle = sas04,
|
booktitle = sas04,
|
||||||
pages = {100--115},
|
pages = {100--115},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
address = {Heidelberg},
|
address = {Heidelberg},
|
||||||
series = lncs,
|
series = lncs,
|
||||||
volume = {3148},
|
volume = {3148},
|
||||||
|
@ -1349,7 +1351,7 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pd
|
||||||
booktitle = crypto11,
|
booktitle = crypto11,
|
||||||
year = {2011},
|
year = {2011},
|
||||||
pages = {71--90},
|
pages = {71--90},
|
||||||
url = {http://dx.doi.org/10.1007/978--3-642--22792--9_5},
|
url = {http://software.imdea.org/~szanella/Zanella.2011.CRYPTO.pdf},
|
||||||
bibsource = {DBLP, http://dblp.uni-trier.de}
|
bibsource = {DBLP, http://dblp.uni-trier.de}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1394,8 +1396,8 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pd
|
||||||
year = {2013},
|
year = {2013},
|
||||||
pages = {23--40},
|
pages = {23--40},
|
||||||
url = {http://dx.doi.org/10.1007/978--3-319--07602--7_4},
|
url = {http://dx.doi.org/10.1007/978--3-319--07602--7_4},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
volume = {8348},
|
volume = {8348},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1408,8 +1410,8 @@ url = {http://research.microsoft.com/pubs/208236/asplos077-bornholtA.pd
|
||||||
year = {2007},
|
year = {2007},
|
||||||
pages = {288--297},
|
pages = {288--297},
|
||||||
url = {http://dx.doi.org/10.1007/978--3-540--75254--7_29},
|
url = {http://dx.doi.org/10.1007/978--3-540--75254--7_29},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
volume = {4696},
|
volume = {4696},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -1470,8 +1472,8 @@ year = {2014}
|
||||||
title = {A Qualitative Comparison of the Suitability of Four Theorem
|
title = {A Qualitative Comparison of the Suitability of Four Theorem
|
||||||
Provers for Basic Auction Theory},
|
Provers for Basic Auction Theory},
|
||||||
booktitle = {MKM/Calculemus/DML},
|
booktitle = {MKM/Calculemus/DML},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
volume = {7961},
|
volume = {7961},
|
||||||
year = {2013},
|
year = {2013},
|
||||||
pages = {200--215},
|
pages = {200--215},
|
||||||
|
@ -1491,16 +1493,18 @@ year = {2014}
|
||||||
url = {http://dl.acm.org/citation.cfm?id=2240262}
|
url = {http://dl.acm.org/citation.cfm?id=2240262}
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{BartheDR04,
|
@article{BartheDR04,
|
||||||
author = {Gilles Barthe and
|
title={Secure information flow by self-composition},
|
||||||
Pedro R. D'Argenio and
|
author={Barthe, Gilles and
|
||||||
Tamara Rezk},
|
D'Argenio, Pedro R and
|
||||||
title = {Secure Information Flow by Self-Composition},
|
Rezk, Tamara},
|
||||||
booktitle = csfw04,
|
journal=mscs,
|
||||||
year = {2004},
|
volume={21},
|
||||||
pages = {100--114},
|
number={06},
|
||||||
url = {http://doi.ieeecomputersociety.org/10.1109/CSFW.2004.17},
|
pages={1207--1252},
|
||||||
bibsource = {DBLP, http://dblp.uni-trier.de}
|
year={2011},
|
||||||
|
publisher=cup,
|
||||||
|
url = {http://www-sop.inria.fr/lemme/Tamara.Rezk/publication/Barthe-DArgenio-Rezk-Journal.pdf}
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{ZaksP08,
|
@inproceedings{ZaksP08,
|
||||||
|
@ -1508,9 +1512,9 @@ year = {2014}
|
||||||
title = {{CoVaC}: Compiler Validation by Program Analysis of the Cross-Product},
|
title = {{CoVaC}: Compiler Validation by Program Analysis of the Cross-Product},
|
||||||
booktitle = fm08,
|
booktitle = fm08,
|
||||||
pages = {35--51},
|
pages = {35--51},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
address = {Heidelberg},
|
address = {Heidelberg},
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
volume = {5014},
|
volume = {5014},
|
||||||
year = {2008},
|
year = {2008},
|
||||||
url = {http://llvm.org/pubs/2008-05-CoVaC.pdf}
|
url = {http://llvm.org/pubs/2008-05-CoVaC.pdf}
|
||||||
|
@ -1522,8 +1526,8 @@ year = {2014}
|
||||||
Author = {Terauchi, Tachio and Aiken, Alex},
|
Author = {Terauchi, Tachio and Aiken, Alex},
|
||||||
Booktitle = sas05,
|
Booktitle = sas05,
|
||||||
Pages = {352--367},
|
Pages = {352--367},
|
||||||
Publisher = {Springer},
|
Publisher = springer,
|
||||||
Series = {Lecture Notes in Computer Science},
|
Series = lncs,
|
||||||
Title = {Secure Information Flow as a Safety Problem},
|
Title = {Secure Information Flow as a Safety Problem},
|
||||||
Volume = {3672},
|
Volume = {3672},
|
||||||
Year = {2005},
|
Year = {2005},
|
||||||
|
@ -1539,8 +1543,7 @@ year = {2014}
|
||||||
booktitle = fm11,
|
booktitle = fm11,
|
||||||
year = {2011},
|
year = {2011},
|
||||||
pages = {200--214},
|
pages = {200--214},
|
||||||
url = {http://dx.doi.org/10.1007/978--3-642--21437--0_17},
|
url = {http://software.imdea.org/~ckunz/rellog/long-rellog.pdf},
|
||||||
bibsource = {DBLP, http://dblp.uni-trier.de}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{BartheCK13,
|
@inproceedings{BartheCK13,
|
||||||
|
@ -1654,7 +1657,7 @@ year = {2014}
|
||||||
booktitle={Advanced Functional Programming},
|
booktitle={Advanced Functional Programming},
|
||||||
pages={130--170},
|
pages={130--170},
|
||||||
year={2005},
|
year={2005},
|
||||||
publisher={Springer},
|
publisher=springer,
|
||||||
url={http://cs.ru.nl/~freek/courses/tt-2010/tvftl/epigram-notes.pdf}
|
url={http://cs.ru.nl/~freek/courses/tt-2010/tvftl/epigram-notes.pdf}
|
||||||
}
|
}
|
||||||
@inproceedings{Vytiniotis+13,
|
@inproceedings{Vytiniotis+13,
|
||||||
|
@ -2182,12 +2185,20 @@ year = {2014}
|
||||||
publisher = {ACM}
|
publisher = {ACM}
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{Barthe11,
|
@inproceedings{BartheGHZ11,
|
||||||
Author = {Gilles Barthe and Benjamin Gr{\'e}goire and Sylvain Heraud and Santiago Zanella B{\'e}guelin},
|
author = {Gilles Barthe and
|
||||||
|
Benjamin Gr{\'e}goire and
|
||||||
|
Sylvain Heraud and
|
||||||
|
Santiago Zanella B{\'e}guelin},
|
||||||
|
title = {Computer-Aided Security Proofs for the Working Cryptographer},
|
||||||
Booktitle = crypto11,
|
Booktitle = crypto11,
|
||||||
Pages = {71-90},
|
year = {2011},
|
||||||
Title = {Computer-Aided Security Proofs for the Working Cryptographer},
|
Pages = {71--90},
|
||||||
Year = {2011}}
|
publisher = springer,
|
||||||
|
series = lncs,
|
||||||
|
volume = {6841}
|
||||||
|
}
|
||||||
|
|
||||||
@inproceedings{flanagan2001,
|
@inproceedings{flanagan2001,
|
||||||
title={Avoiding exponential explosion: Generating compact
|
title={Avoiding exponential explosion: Generating compact
|
||||||
verification conditions},
|
verification conditions},
|
||||||
|
@ -2205,14 +2216,17 @@ verification conditions},
|
||||||
C{\'{e}}sar Kunz and
|
C{\'{e}}sar Kunz and
|
||||||
Benedikt Schmidt and
|
Benedikt Schmidt and
|
||||||
Pierre{-}Yves Strub},
|
Pierre{-}Yves Strub},
|
||||||
title = {Easy{C}rypt: {A} Tutorial},
|
editor = {Alessandro Aldini and
|
||||||
|
Javier Lopez and
|
||||||
|
Fabio Martinelli},
|
||||||
|
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},
|
||||||
pages = {146--166},
|
series = lncs,
|
||||||
series = {LNCS},
|
|
||||||
year = {2014},
|
|
||||||
volume = {8604},
|
volume = {8604},
|
||||||
publisher = {Springer}
|
pages = {146--166},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2013}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{Hoare69,
|
@article{Hoare69,
|
||||||
|
@ -2297,7 +2311,7 @@ verification conditions},
|
||||||
booktitle=cp03,
|
booktitle=cp03,
|
||||||
pages={19--36},
|
pages={19--36},
|
||||||
year={2003},
|
year={2003},
|
||||||
organization={Springer}
|
organization=springer
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{BP14,
|
@inproceedings{BP14,
|
||||||
|
@ -2401,7 +2415,7 @@ language={English}
|
||||||
booktitle = {{CEEMAS 2007}},
|
booktitle = {{CEEMAS 2007}},
|
||||||
year = {2007},
|
year = {2007},
|
||||||
pages = {288--297},
|
pages = {288--297},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {LNCS},
|
series = {LNCS},
|
||||||
volume = {4696},
|
volume = {4696},
|
||||||
}
|
}
|
||||||
|
@ -2430,13 +2444,13 @@ language={English}
|
||||||
title = {A Qualitative Comparison of the Suitability of Four Theorem
|
title = {A Qualitative Comparison of the Suitability of Four Theorem
|
||||||
Provers for Basic Auction Theory},
|
Provers for Basic Auction Theory},
|
||||||
booktitle={Intelligent Computer Mathematics},
|
booktitle={Intelligent Computer Mathematics},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
volume = {7961},
|
volume = {7961},
|
||||||
year = {2013},
|
year = {2013},
|
||||||
pages = {200--215},
|
pages = {200--215},
|
||||||
url = {http://dx.doi.org/10.1007/978--3-642--39320--4_13},
|
url = {http://dx.doi.org/10.1007/978--3-642--39320--4_13},
|
||||||
publisher={Springer}
|
publisher=springer
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{DBLP:journals/ipl/Vestergaard06,
|
@article{DBLP:journals/ipl/Vestergaard06,
|
||||||
|
@ -2506,7 +2520,7 @@ language={English}
|
||||||
number={1},
|
number={1},
|
||||||
pages={17--33},
|
pages={17--33},
|
||||||
year={1971},
|
year={1971},
|
||||||
publisher={Springer}
|
publisher=springer
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{groves73,
|
@article{groves73,
|
||||||
|
@ -2522,8 +2536,8 @@ language={English}
|
||||||
author = {Bellare, Mihir and Rogaway, Phillip},
|
author = {Bellare, Mihir and Rogaway, Phillip},
|
||||||
booktitle = eucrypt06,
|
booktitle = eucrypt06,
|
||||||
pages = {409--426},
|
pages = {409--426},
|
||||||
publisher = {Springer},
|
publisher = springer,
|
||||||
series = {Lecture Notes in Computer Science},
|
series = lncs,
|
||||||
title = {The Security of Triple Encryption and a Framework for
|
title = {The Security of Triple Encryption and a Framework for
|
||||||
Code-Based Game-Playing Proofs},
|
Code-Based Game-Playing Proofs},
|
||||||
volume = {4004},
|
volume = {4004},
|
||||||
|
@ -2971,3 +2985,56 @@ year={2011}
|
||||||
pages={159--169},
|
pages={159--169},
|
||||||
year={2008},
|
year={2008},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@book{Thorisson00,
|
||||||
|
author = {Hermann Thorisson},
|
||||||
|
title = {Coupling, Stationarity, and Regeneration},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2000}
|
||||||
|
}
|
||||||
|
|
||||||
|
@book{Lindvall02,
|
||||||
|
title={Lectures on the coupling method},
|
||||||
|
author={Lindvall, Torgny},
|
||||||
|
year={2002},
|
||||||
|
publisher={Courier Corporation}
|
||||||
|
}
|
||||||
|
|
||||||
|
@book{Villani08,
|
||||||
|
title={Optimal transport: old and new},
|
||||||
|
author={Villani, C{\'e}dric},
|
||||||
|
year={2008},
|
||||||
|
publisher={Springer Science}
|
||||||
|
}
|
||||||
|
|
||||||
|
@techreport{DengD11,
|
||||||
|
Author = {Deng, Yuxin and Du, Wenjie},
|
||||||
|
Institution = {Carnegie Mellon University},
|
||||||
|
Month = {March},
|
||||||
|
Number = {CMU-CS-11-110},
|
||||||
|
Title = {Logical, Metric, and Algorithmic Characterisations of Probabilistic Bisimulation},
|
||||||
|
Year = {2011},
|
||||||
|
url = {http://arxiv.org/abs/1103.4577}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{Yang07,
|
||||||
|
author = {H. Yang},
|
||||||
|
title = {Relational separation logic},
|
||||||
|
journal = tcs,
|
||||||
|
volume = 375,
|
||||||
|
number = {1-3},
|
||||||
|
year = 2007,
|
||||||
|
pages = {308--334},
|
||||||
|
url = {http://www.cs.ox.ac.uk/people/hongseok.yang/paper/data.pdf}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{mufa1994optimal,
|
||||||
|
title={Optimal Markovian couplings and applications},
|
||||||
|
author={Mufa, Chen},
|
||||||
|
journal={Acta Mathematica Sinica},
|
||||||
|
volume={10},
|
||||||
|
number={3},
|
||||||
|
pages={260--275},
|
||||||
|
year={1994},
|
||||||
|
publisher=springer
|
||||||
|
}
|
||||||
|
|
|
@ -1,3 +1,5 @@
|
||||||
|
+ **09/2015** Our paper **Jointly private convex programming** has been accepted
|
||||||
|
to **SODA 2016**!
|
||||||
+ **09/2015** Our paper **Relational reasoning via probabilistic coupling**
|
+ **09/2015** Our paper **Relational reasoning via probabilistic coupling**
|
||||||
has been accepted to **LPAR 2015**!
|
has been accepted to **LPAR 2015**!
|
||||||
+ **08/2015** Our preprint **Online Assignment with Heterogeneous Tasks in
|
+ **08/2015** Our preprint **Online Assignment with Heterogeneous Tasks in
|
||||||
|
|
Loading…
Reference in New Issue