Update.
This commit is contained in:
parent
c648146056
commit
3169c114d8
|
@ -180,6 +180,8 @@
|
|||
@STRING{popl18 = popl # ", Los Angeles, California" }
|
||||
@STRING{popl19 = popl # ", Lisbon, Portugal" }
|
||||
@STRING{popl20 = popl # ", New Orleans, Louisiana" }
|
||||
@STRING{popl21 = popl }
|
||||
|
||||
% ----
|
||||
@STRING{icfp = "{ACM} {SIGPLAN} {I}nternational {C}onference on
|
||||
{F}unctional {P}rogramming ({ICFP})" }
|
||||
|
@ -218,6 +220,8 @@
|
|||
@STRING{ccs16 = ccs # ", Vienna, Austria" }
|
||||
@STRING{ccs17 = ccs # ", Dallas, Texas" }
|
||||
@STRING{ccs18 = ccs # ", Toronto, Ontario" }
|
||||
@STRING{ccs19 = ccs # ", London, England" }
|
||||
@STRING{ccs20 = ccs }
|
||||
|
||||
@STRING{dbpl = {Database Programming Languages (DBPL)}}
|
||||
@STRING{dbpl05 = dbpl}
|
||||
|
@ -240,6 +244,7 @@
|
|||
@STRING{oopsla14 = oopsla # ", Portland, Oregon" }
|
||||
% ----
|
||||
@STRING{lics = "{IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS})" }
|
||||
@STRING{licspost20 = "{ACM/IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS})" }
|
||||
@STRING{lics86 = lics # ", Cambridge, Massachusetts" }
|
||||
@STRING{lics87 = lics # ", Ithaca, New York" }
|
||||
@STRING{lics88 = lics # ", Edinburgh, Scotland" }
|
||||
|
@ -264,6 +269,7 @@
|
|||
@STRING{lics16 = lics # ", New York, New York" }
|
||||
@STRING{lics17 = lics # ", Reykjavik, Iceland" }
|
||||
@STRING{lics19 = lics # ", Vancouver, British Columbia" }
|
||||
@STRING{lics20 = licspost20 # ", Saarbr{\"{u}}cken, Germany" }
|
||||
% ----
|
||||
@STRING{pldi = "{ACM SIGPLAN Conference on Programming Language Design
|
||||
and Implementation (PLDI)}" }
|
||||
|
|
185
bibs/myrefs.bib
185
bibs/myrefs.bib
|
@ -24,21 +24,6 @@
|
|||
jh = yes,
|
||||
}
|
||||
|
||||
@unpublished{ABHKKM19,
|
||||
title = {A Pre-Expectation Calculus for Probabilistic Sensitivity},
|
||||
author = {Aguirre, Alejandro and
|
||||
Barthe, Gilles and
|
||||
Hsu, Justin and
|
||||
Kaminski, Benjamin Lucien and
|
||||
Katoen, Joost-Pieter and
|
||||
Matheja, Christoph},
|
||||
year = 2020,
|
||||
url = {https://arxiv.org/abs/1901.06540},
|
||||
eprint = {1901.06540},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.LO},
|
||||
jh = yes,
|
||||
}
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% THESIS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
@phdthesis{JHThesis,
|
||||
title = {Probabilistic Couplings for Probabilistic Reasoning},
|
||||
|
@ -120,6 +105,23 @@
|
|||
}
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% CONFERENCES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
@inproceedings{ABHKKM19,
|
||||
title = {A Pre-Expectation Calculus for Probabilistic Sensitivity},
|
||||
author = {Aguirre, Alejandro and
|
||||
Barthe, Gilles and
|
||||
Hsu, Justin and
|
||||
Kaminski, Benjamin Lucien and
|
||||
Katoen, Joost-Pieter and
|
||||
Matheja, Christoph},
|
||||
booktitle = popl21,
|
||||
year = 2020,
|
||||
url = {https://arxiv.org/abs/1901.06540},
|
||||
eprint = {1901.06540},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.LO},
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@inproceedings{BBGHS19,
|
||||
title = {Hypothesis Testing Interpretations and {R}\'enyi Differential Privacy},
|
||||
author = {Balle, Borja and
|
||||
|
@ -1094,6 +1096,22 @@ inproceedings{HHRRW14,
|
|||
jh = yes,
|
||||
}
|
||||
|
||||
@talk{cmu20-talk,
|
||||
title = {A Probabilistic Separation Logic},
|
||||
organization = {Principles of Programming Seminar, Carnegie Mellon University},
|
||||
year = 2020,
|
||||
month = sep,
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@talk{penn20-talk,
|
||||
title = {A Probabilistic Separation Logic},
|
||||
organization = {PL Club, University of Pennsylvania},
|
||||
year = 2020,
|
||||
month = sep,
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@talk{owls-talk,
|
||||
title = {A Probabilistic Separation Logic},
|
||||
organization = {Online Worldwide Seminar on Logic and Semantics, Young Researcher {(OWLS-YR)}},
|
||||
|
@ -7713,21 +7731,6 @@ url={https://doi.org/10.1007/3-540-48224-5_35}
|
|||
publisher={University of Chicago Press}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/tcs/Brookes07,
|
||||
author = {Stephen Brookes},
|
||||
title = {A semantics for concurrent separation logic},
|
||||
journal = tcs,
|
||||
volume = {375},
|
||||
number = {1--3},
|
||||
pages = {227--270},
|
||||
year = {2007},
|
||||
url = {https://doi.org/10.1016/j.tcs.2006.12.034},
|
||||
doi = {10.1016/j.tcs.2006.12.034},
|
||||
timestamp = {Wed, 14 Nov 2018 10:33:34 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/tcs/Brookes07},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/tcs/OHearn07,
|
||||
author = {Peter W. O'Hearn},
|
||||
title = {Resources, concurrency, and local reasoning},
|
||||
|
@ -8127,3 +8130,125 @@ note={Errata and Remarks maintained at:
|
|||
biburl = {https://dblp.org/rec/bib/journals/cacm/MouraB11},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/sp/NarayananS08,
|
||||
author = {Arvind Narayanan and
|
||||
Vitaly Shmatikov},
|
||||
title = {Robust De-anonymization of Large Sparse Datasets},
|
||||
booktitle = sp08,
|
||||
pages = {111--125},
|
||||
year = {2008},
|
||||
url = {https://doi.org/10.1109/SP.2008.33},
|
||||
doi = {10.1109/SP.2008.33},
|
||||
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/sp/NarayananS08.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/sp/CalandrinoKNFS11,
|
||||
author = {Joseph A. Calandrino and
|
||||
Ann Kilzer and
|
||||
Arvind Narayanan and
|
||||
Edward W. Felten and
|
||||
Vitaly Shmatikov},
|
||||
title = {"You Might Also Like: " Privacy Risks of Collaborative Filtering},
|
||||
booktitle = sp11,
|
||||
pages = {231--246},
|
||||
year = {2011},
|
||||
url = {https://doi.org/10.1109/SP.2011.40},
|
||||
doi = {10.1109/SP.2011.40},
|
||||
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/sp/CalandrinoKNFS11.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/rsa/DubhashiR98,
|
||||
author = {Devdatt P. Dubhashi and
|
||||
Desh Ranjan},
|
||||
title = {Balls and bins: {A} study in negative dependence},
|
||||
journal = {Random Struct. Algorithms},
|
||||
volume = {13},
|
||||
number = {2},
|
||||
pages = {99--124},
|
||||
year = {1998},
|
||||
}
|
||||
|
||||
@article{borcea2009negative,
|
||||
title={Negative dependence and the geometry of polynomials},
|
||||
author={Borcea, Julius and Br{\"a}nd{\'e}n, Petter and Liggett, Thomas},
|
||||
journal={Journal of the American Mathematical Society},
|
||||
volume={22},
|
||||
number={2},
|
||||
pages={521--567},
|
||||
year={2009}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/lics/HannulaKBV20,
|
||||
author = {Hannula, Miika and
|
||||
Kontinen, Juha and
|
||||
Van den Bussche, Jan and
|
||||
Virtema, Jonni},
|
||||
title = {Descriptive complexity of real computation and probabilistic independence logic},
|
||||
booktitle = lics20,
|
||||
pages = {550--563},
|
||||
year = {2020},
|
||||
url = {https://doi.org/10.1145/3373718.3394773},
|
||||
doi = {10.1145/3373718.3394773},
|
||||
timestamp = {Tue, 02 Jun 2020 17:19:31 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/lics/HannulaKBV20.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/foiks/0001HKMV18,
|
||||
author = {Arnaud Durand and
|
||||
Miika Hannula and
|
||||
Juha Kontinen and
|
||||
Arne Meier and
|
||||
Jonni Virtema},
|
||||
title = {Probabilistic Team Semantics},
|
||||
booktitle = {Foundations of Information and Knowledge Systems ({FoIKS}), Budapest, Hungary},
|
||||
pages = {186--206},
|
||||
year = {2018},
|
||||
url = {https://doi.org/10.1007/978-3-319-90050-6\_11},
|
||||
doi = {10.1007/978-3-319-90050-6\_11},
|
||||
timestamp = {Sat, 19 Oct 2019 20:18:09 +0200},
|
||||
biburl = {https://dblp.org/rec/conf/foiks/0001HKMV18.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/scp/ErnstPGMPTX07,
|
||||
author = {Michael D. Ernst and
|
||||
Jeff H. Perkins and
|
||||
Philip J. Guo and
|
||||
Stephen McCamant and
|
||||
Carlos Pacheco and
|
||||
Matthew S. Tschantz and
|
||||
Chen Xiao},
|
||||
title = {The {Daikon} system for dynamic detection of likely invariants},
|
||||
journal = {Sci. Comput. Program.},
|
||||
volume = {69},
|
||||
number = {1-3},
|
||||
pages = {35--45},
|
||||
year = {2007},
|
||||
url = {https://doi.org/10.1016/j.scico.2007.01.015},
|
||||
doi = {10.1016/j.scico.2007.01.015},
|
||||
timestamp = {Sat, 27 May 2017 14:22:55 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/scp/ErnstPGMPTX07.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/popl/0001NMR16,
|
||||
author = {Pranav Garg and
|
||||
Daniel Neider and
|
||||
P. Madhusudan and
|
||||
Dan Roth},
|
||||
title = {Learning invariants using decision trees and implication counterexamples},
|
||||
booktitle = popl16,
|
||||
pages = {499--512},
|
||||
year = {2016},
|
||||
url = {https://doi.org/10.1145/2837614.2837664},
|
||||
doi = {10.1145/2837614.2837664},
|
||||
timestamp = {Tue, 06 Nov 2018 11:07:43 +0100},
|
||||
biburl = {https://dblp.org/rec/conf/popl/0001NMR16.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
|
|
@ -1,3 +1,5 @@
|
|||
+ **10/2020** **A Pre-Expectation Calculus for Probabilistic Sensitivity** to
|
||||
appear at **POPL 2021**!
|
||||
+ **09/2020** This fall, I'm teaching a graduate seminar on **Security and
|
||||
Privacy in Data Science (CS 763)**. Follow along
|
||||
[here](https://pages.cs.wisc.edu/~justhsu/teaching/current/cs763/)!
|
||||
|
@ -19,9 +21,3 @@
|
|||
Privacy** to appear at **AISTATS 2020**!
|
||||
+ **01/2020** **Guarded Kleene Algebra with Tests** has been selected as a
|
||||
**Distingiushed Paper** at **POPL 2020**.
|
||||
+ **10/2019** **A Probabilistic Separation Logic**, **Guarded Kleene Algebra
|
||||
with Tests**, and **Relational Proofs for Quantum Programs** to appear at
|
||||
**POPL 2020**!
|
||||
+ **10/2019** I am serving on the program committee of [**LAFI
|
||||
2020**](https://popl19.sigplan.org/track/lafi-2020), colocated with POPL 2020.
|
||||
Submit your best papers!
|
||||
|
|
Loading…
Reference in New Issue