Update bibs.
This commit is contained in:
Justin Hsu
parent
07dc58b973
commit
2b299206f9
|
|
@ -286,6 +286,7 @@
|
|||
@STRING{pldi12 = pldi # ", Beijing, China" }
|
||||
@STRING{pldi13 = pldi # ", Seattle, Washington" }
|
||||
@STRING{pldi14 = pldi # ", Edinburgh, Scotland" }
|
||||
@STRING{pldi15 = pldi # ", Portland, Oregon" }
|
||||
@STRING{pldi16 = pldi # ", Santa Barbara, California" }
|
||||
@STRING{pldi18 = pldi # ", Philadelphia, Pennsylvania" }
|
||||
@STRING{pldi19 = pldi # ", Phoenix, Arizona" }
|
||||
|
|
@ -589,6 +590,7 @@
|
|||
(LFCS)} }
|
||||
@STRING{mfps = {Conference on the Mathematical Foundations of Programming
|
||||
Semantics (MFPS)} }
|
||||
@STRING{nfm = {{NASA} Formal Methods Symposium (NFM)} }
|
||||
@STRING{osdi = {USENIX Symposium on Operating Systems Design and
|
||||
Implementation (OSDI)} }
|
||||
@STRING{paste = {ACM SIGPLAN--SIGSOFT Workshop on Program Analysis for
|
||||
|
|
@ -767,6 +769,7 @@ STRING{fse08 = fse # ", Atlanta, Georgia" }
|
|||
@STRING{icalp18 = icalp # ", Prague, Czech Republic" }
|
||||
% ---
|
||||
@STRING{icse14 = icse # ", Hyderabad, India" }
|
||||
@STRING{icse19 = icse # ", Montr{\'e}al, Qu{\'e}bec" }
|
||||
% ---
|
||||
@STRING{ictac18 = ictac # ", Stellenbosch, South Africa" }
|
||||
% ---
|
||||
|
|
@ -798,6 +801,9 @@ STRING{fse08 = fse # ", Atlanta, Georgia" }
|
|||
@STRING{mfps15 = mfps # ", Nijmegen, The Netherlands" }
|
||||
@STRING{mfps16 = mfps # ", Pittsburgh, Pennsylvania" }
|
||||
% ---
|
||||
@STRING{nfm11 = nfm # ", Pasadena, California" }
|
||||
@STRING{nfm15 = nfm # ", Pasadena, California" }
|
||||
% ---
|
||||
@STRING{osdi96 = osdi # ", Seattle, Washington" }
|
||||
@STRING{osdi00 = osdi # ", San Diego, California" }
|
||||
@STRING{osdi12 = osdi # ", Hollywood, California" }
|
||||
|
|
|
|||
549
bibs/myrefs.bib
549
bibs/myrefs.bib
|
|
@ -1,6 +1,50 @@
|
|||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
@unpublished{BHL19,
|
||||
title = {A Probabilistic Separation Logic},
|
||||
author = {Barthe, Gilles and
|
||||
Hsu, Justin and
|
||||
Liao, Kevin},
|
||||
year = 2019,
|
||||
url = {https://arxiv.org/abs/1907.10708},
|
||||
eprint = {1907.10708},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.PL},
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@unpublished{BBGHS19,
|
||||
title = {Hypothesis Testing Interpretations and {R}\'enyi Differential Privacy},
|
||||
author = {Balle, Borja and
|
||||
Barthe, Gilles and
|
||||
Gaboardi, Marco and
|
||||
Hsu, Justin and
|
||||
Sato, Tetsuya},
|
||||
year = 2019,
|
||||
url = {https://arxiv.org/abs/1905.09982},
|
||||
eprint = {1905.09982},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.LG},
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@unpublished{SFHKKS19,
|
||||
title = {Guarded {Kleene} {Algebra} with {Tests}: Verification of Uninterpreted Programs in Nearly Linear Time},
|
||||
author = {Smolka, Steffen and
|
||||
Foster, Nate and
|
||||
Hsu, Justin and
|
||||
Kapp\'e, Tobias and
|
||||
Kozen, Dexter and
|
||||
Silva, Alexandra},
|
||||
year = 2019,
|
||||
url = {https://arxiv.org/abs/1907.05920},
|
||||
eprint = {1907.05920},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.PL},
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@unpublished{ABHKKM19,
|
||||
title = {Kantorovich Continuity of Probabilistic Programs},
|
||||
title = {A Pre-Expectation Calculus for Probabilistic Sensitivity},
|
||||
author = {Aguirre, Alejandro and
|
||||
Barthe, Gilles and
|
||||
Hsu, Justin and
|
||||
|
|
@ -125,7 +169,6 @@
|
|||
primaryClass = {cs.PL},
|
||||
reviewed = yes,
|
||||
jh = yes,
|
||||
note = "To appear."
|
||||
}
|
||||
|
||||
@inproceedings{SBGHK17,
|
||||
|
|
@ -143,7 +186,6 @@
|
|||
primaryClass = {cs.PL},
|
||||
reviewed = yes,
|
||||
jh = yes,
|
||||
note = "To appear."
|
||||
}
|
||||
|
||||
@inproceedings{SKFHKKS18,
|
||||
|
|
@ -167,7 +209,7 @@
|
|||
}
|
||||
|
||||
@inproceedings{ZGBH19,
|
||||
title = {Fake News Detection via NLP is Vulnerable to Adversarial Attacks},
|
||||
title = {Fake News Detection via {NLP} is Vulnerable to Adversarial Attacks},
|
||||
author = {Zhou, Zhixuan and
|
||||
Guan, Huankang and
|
||||
Bhat, Meghana Moorthy and
|
||||
|
|
@ -236,6 +278,7 @@
|
|||
eprint = {1805.11550},
|
||||
archivePrefix = {arXiv},
|
||||
primaryClass = {cs.FL},
|
||||
acceptance = {25/59=0.42},
|
||||
}
|
||||
|
||||
@inproceedings{AH18,
|
||||
|
|
@ -950,6 +993,14 @@ inproceedings{HHRRW14,
|
|||
}
|
||||
|
||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% TALKS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||
@talk{google-fl-talk,
|
||||
title = {Data Poisoning against Differentially-Private Learners: Attacks and Defenses},
|
||||
organization = {Google Workshop on Federated Learning and Analytics},
|
||||
year = 2019,
|
||||
month = jun,
|
||||
jh = yes,
|
||||
}
|
||||
|
||||
@talk{ucsc-pig-talk,
|
||||
title = {Differentially-Private Optimal Power Flow},
|
||||
organization = {UCSC Privacy in Graphs Workshop},
|
||||
|
|
@ -6165,16 +6216,6 @@ url="https://dx.doi.org/10.1007/BFb0084215"
|
|||
publisher = elsevier
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/stoc/DeBakkerZ82,
|
||||
author = {de Bakker, J. W. and
|
||||
Zucker, Jeffrey I.},
|
||||
title = {Denotational Semantics of Concurrency},
|
||||
booktitle = stoc82,
|
||||
pages = {153--158},
|
||||
year = {1982},
|
||||
url = {https://doi.acm.org/10.1145/800070.802188},
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/mfps/AmericaR87,
|
||||
author = {Pierre America and
|
||||
Jan J. M. M. Rutten},
|
||||
|
|
@ -7186,8 +7227,8 @@ url={https://doi.org/10.1007/3-540-48224-5_35}
|
|||
Ohad Kammar and
|
||||
Sam Staton},
|
||||
title = {A domain theory for statistical probabilistic programming},
|
||||
journal = {{PACMPL}},
|
||||
issue = {{POPL}},
|
||||
journal = pacmpl,
|
||||
number = {{POPL}},
|
||||
volume = {3},
|
||||
pages = {36:1--36:29},
|
||||
year = {2019},
|
||||
|
|
@ -7325,3 +7366,479 @@ url={https://doi.org/10.1007/3-540-48224-5_35}
|
|||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{ding2017collecting,
|
||||
title={Collecting telemetry data privately},
|
||||
author={Ding, Bolin and Kulkarni, Janardhan and Yekhanin, Sergey},
|
||||
booktitle=nips17,
|
||||
pages={3571--3580},
|
||||
year={2017}
|
||||
}
|
||||
|
||||
@techreport{apple-dp,
|
||||
title = {Learning with Privacy at Scale},
|
||||
author = {Differential Privacy Team},
|
||||
institution = {Apple},
|
||||
year = 2017,
|
||||
url = {https://machinelearning.apple.com/docs/learning-with-privacy-at-scale/appledifferentialprivacysystem.pdf},
|
||||
}
|
||||
|
||||
@inproceedings{axprof,
|
||||
title = {Statistical Algorithmic Profiling for Randomized Approximate Programs},
|
||||
author = {Joshi, Keyur and
|
||||
Fernando, Vimuth and
|
||||
Misailovic, Sasa},
|
||||
booktitle = icse19,
|
||||
year = 2019,
|
||||
url = {https://axprof.org/paper-icse19.pdf},
|
||||
}
|
||||
|
||||
@inproceedings{HeunenKSY17,
|
||||
author = {Chris Heunen and
|
||||
Ohad Kammar and
|
||||
Sam Staton and
|
||||
Hongseok Yang},
|
||||
title = {A convenient category for higher-order probability theory},
|
||||
booktitle = lics17,
|
||||
pages = {1--12},
|
||||
year = {2017},
|
||||
url = {https://doi.org/10.1109/LICS.2017.8005137},
|
||||
doi = {10.1109/LICS.2017.8005137},
|
||||
}
|
||||
|
||||
@inproceedings{Staton17ESOP,
|
||||
author = {Sam Staton},
|
||||
title = {Commutative Semantics for Probabilistic Programming},
|
||||
booktitle = esop17,
|
||||
pages = {855--879},
|
||||
year = {2017},
|
||||
url = {https://doi.org/10.1007/978-3-662-54434-1\_32},
|
||||
doi = {10.1007/978-3-662-54434-1\_32},
|
||||
timestamp = {Fri, 19 May 2017 01:25:18 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/conf/esop/Staton17},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/pacmpl/BatzKKMN19,
|
||||
author = {Kevin Batz and
|
||||
Benjamin Lucien Kaminski and
|
||||
Joost{-}Pieter Katoen and
|
||||
Christoph Matheja and
|
||||
Thomas Noll},
|
||||
title = {Quantitative separation logic: a logic for reasoning about probabilistic
|
||||
pointer programs},
|
||||
journal = pacmpl,
|
||||
volume = {3},
|
||||
number = {{POPL}},
|
||||
pages = {34:1--34:29},
|
||||
year = {2019},
|
||||
url = {https://doi.org/10.1145/3290347},
|
||||
doi = {10.1145/3290347},
|
||||
timestamp = {Fri, 10 May 2019 11:01:57 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/pacmpl/BatzKKMN19},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/iacr/ChungP13a,
|
||||
author = {Chung, Kai{-}Min and
|
||||
Pass, Rafael},
|
||||
title = {A Simple {ORAM}},
|
||||
journal = {{IACR} Cryptology ePrint Archive},
|
||||
volume = {2013},
|
||||
pages = {243},
|
||||
year = {2013},
|
||||
url = {http://eprint.iacr.org/2013/243},
|
||||
timestamp = {Tue, 14 Aug 2018 17:08:07 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/iacr/ChungP13a},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/ccs/WangNLCSSH14,
|
||||
author = {Wang, Xiao Shaun and
|
||||
Nayak, Kartik and
|
||||
Liu, Chang and
|
||||
Chan, T.{-}H. Hubert and
|
||||
Shi, Elaine and
|
||||
Stefanov, Emil and
|
||||
Huang, Yan},
|
||||
title = {Oblivious Data Structures},
|
||||
booktitle = ccs14,
|
||||
pages = {215--226},
|
||||
year = {2014},
|
||||
url = {https://doi.org/10.1145/2660267.2660314},
|
||||
doi = {10.1145/2660267.2660314},
|
||||
timestamp = {Tue, 06 Nov 2018 11:07:30 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/conf/ccs/WangNLCSSH14},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
|
||||
|
||||
@article{DBLP:journals/jacm/GoldreichO96,
|
||||
author = {Goldreich, Oded and
|
||||
Ostrovsky, Rafail},
|
||||
title = {Software Protection and Simulation on Oblivious RAMs},
|
||||
journal = jacm,
|
||||
volume = {43},
|
||||
number = {3},
|
||||
pages = {431--473},
|
||||
year = {1996},
|
||||
url = {https://doi.org/10.1145/233551.233553},
|
||||
doi = {10.1145/233551.233553},
|
||||
timestamp = {Wed, 14 Nov 2018 10:35:25 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/jacm/GoldreichO96},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/stoc/ValiantB81,
|
||||
author = {Valiant, Leslie G. and
|
||||
Brebner, Gordon J.},
|
||||
title = {Universal Schemes for Parallel Communication},
|
||||
booktitle = stoc81,
|
||||
pages = {263--277},
|
||||
year = {1981},
|
||||
url = {https://doi.org/10.1145/800076.802479},
|
||||
doi = {10.1145/800076.802479},
|
||||
timestamp = {Tue, 06 Nov 2018 11:07:06 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/conf/stoc/ValiantB81},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/jcss/KalaiV05,
|
||||
author = {Adam Tauman Kalai and
|
||||
Santosh Vempala},
|
||||
title = {Efficient algorithms for online decision problems},
|
||||
journal = jcss,
|
||||
volume = {71},
|
||||
number = {3},
|
||||
pages = {291--307},
|
||||
year = {2005},
|
||||
url = {https://doi.org/10.1016/j.jcss.2004.10.016},
|
||||
doi = {10.1016/j.jcss.2004.10.016},
|
||||
timestamp = {Sat, 20 May 2017 00:25:52 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/jcss/KalaiV05},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{hannan1957approximation,
|
||||
title={Approximation to {Bayes} risk in repeated play},
|
||||
author={Hannan, James},
|
||||
journal={Contributions to the Theory of Games},
|
||||
volume={3},
|
||||
pages={97--139},
|
||||
year={1957}
|
||||
}
|
||||
|
||||
|
||||
|
||||
@article{DBLP:journals/jc/ChorG89,
|
||||
author = {Chor, Benny and
|
||||
Goldreich, Oded},
|
||||
title = {On the power of two-point based sampling},
|
||||
journal = {J. Complexity},
|
||||
volume = {5},
|
||||
number = {1},
|
||||
pages = {96--106},
|
||||
year = {1989},
|
||||
url = {https://doi.org/10.1016/0885-064X(89)90015-0},
|
||||
doi = {10.1016/0885-064X(89)90015-0},
|
||||
timestamp = {Fri, 02 Nov 2018 09:29:43 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/jc/ChorG89},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/jfp/JungKJBBD18,
|
||||
author = {Jung, Ralf and
|
||||
Krebbers, Robbert and
|
||||
Jourdan, Jacques{-}Henri and
|
||||
Bizjak, Ales and
|
||||
Birkedal, Lars and
|
||||
Dreyer, Derek},
|
||||
title = {Iris from the ground up: {A} modular foundation for higher-order concurrent
|
||||
separation logic},
|
||||
journal = {J. Funct. Program.},
|
||||
volume = {28},
|
||||
pages = {e20},
|
||||
year = {2018},
|
||||
url = {https://doi.org/10.1017/S0956796818000151},
|
||||
doi = {10.1017/S0956796818000151},
|
||||
timestamp = {Tue, 15 Jan 2019 17:06:15 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/jfp/JungKJBBD18},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/pldi/SergeyNB15,
|
||||
author = {Sergey, Ilya and
|
||||
Nanevski, Aleksandar and
|
||||
Banerjee, Anindya},
|
||||
title = {Mechanized verification of fine-grained concurrent programs},
|
||||
booktitle = pldi15,
|
||||
pages = {77--87},
|
||||
year = {2015},
|
||||
url = {https://doi.org/10.1145/2737924.2737964},
|
||||
doi = {10.1145/2737924.2737964},
|
||||
timestamp = {Tue, 06 Nov 2018 16:59:30 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/conf/pldi/SergeyNB15},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@book{cramer2016politics,
|
||||
title={The politics of resentment: Rural consciousness in Wisconsin and the rise of Scott Walker},
|
||||
author={Cramer, Katherine J},
|
||||
year={2016},
|
||||
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},
|
||||
journal = tcs,
|
||||
volume = {375},
|
||||
number = {1--3},
|
||||
pages = {271--307},
|
||||
year = {2007},
|
||||
url = {https://doi.org/10.1016/j.tcs.2006.12.035},
|
||||
doi = {10.1016/j.tcs.2006.12.035},
|
||||
timestamp = {Wed, 14 Nov 2018 10:33:29 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/tcs/OHearn07},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/pldi/WangHR18,
|
||||
author = {Wang, Di and
|
||||
Hoffmann, Jan and
|
||||
Reps, Thomas W.},
|
||||
title = {{PMAF:} an algebraic framework for static analysis of probabilistic programs},
|
||||
booktitle = pldi18,
|
||||
pages = {513--528},
|
||||
year = {2018},
|
||||
url = {https://doi.org/10.1145/3192366.3192408},
|
||||
doi = {10.1145/3192366.3192408},
|
||||
timestamp = {Wed, 21 Nov 2018 12:44:27 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/conf/pldi/WangHR18},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/pacmpl/TassarottiH19,
|
||||
author = {Joseph Tassarotti and
|
||||
Robert Harper},
|
||||
title = {A separation logic for concurrent randomized programs},
|
||||
journal = pacmpl,
|
||||
volume = {3},
|
||||
number = {{POPL}},
|
||||
pages = {64:1--64:30},
|
||||
year = {2019},
|
||||
url = {https://doi.org/10.1145/3290377},
|
||||
doi = {10.1145/3290377},
|
||||
timestamp = {Fri, 10 May 2019 11:01:57 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/pacmpl/TassarottiH19},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@misc{FB:differential-privacy,
|
||||
author = {{DeGregorio}, Christina and
|
||||
Hillenbrand, Bennett and
|
||||
Li, Da and
|
||||
Messing, Solomon and
|
||||
Nayak, Chaya},
|
||||
title = {Preserving privacy while fostering meaningful research on elections and democracy},
|
||||
year = 2019,
|
||||
url = {https://research.fb.com/preserving-privacy-while-fostering-meaningful-research-on-elections-and-democracy/},
|
||||
institution = {Facebook Research},
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/nfm/CalcagnoD11,
|
||||
author = {Cristiano Calcagno and
|
||||
Dino Distefano},
|
||||
title = {Infer: An Automatic Program Verifier for Memory Safety of {C} Programs},
|
||||
booktitle = nfm11,
|
||||
pages = {459--465},
|
||||
year = {2011},
|
||||
series = lncs,
|
||||
volume = {6617},
|
||||
publisher = springer,
|
||||
url = {https://doi.org/10.1007/978-3-642-20398-5\_33},
|
||||
doi = {10.1007/978-3-642-20398-5\_33},
|
||||
timestamp = {Sun, 02 Jun 2019 21:14:09 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/conf/nfm/CalcagnoD11},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/nfm/CalcagnoDDGHLOP15,
|
||||
author = {Cristiano Calcagno and
|
||||
Dino Distefano and
|
||||
J{\'{e}}r{\'{e}}my Dubreil and
|
||||
Dominik Gabi and
|
||||
Pieter Hooimeijer and
|
||||
Martino Luca and
|
||||
Peter W. O'Hearn and
|
||||
Irene Papakonstantinou and
|
||||
Jim Purbrick and
|
||||
Dulma Rodriguez},
|
||||
title = {Moving Fast with Software Verification},
|
||||
booktitle = nfm15,
|
||||
pages = {3--11},
|
||||
year = {2015},
|
||||
url = {https://doi.org/10.1007/978-3-319-17524-9\_1},
|
||||
series = lncs,
|
||||
volume = {9058},
|
||||
publisher = springer,
|
||||
doi = {10.1007/978-3-319-17524-9\_1},
|
||||
timestamp = {Sun, 02 Jun 2019 21:14:09 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/conf/nfm/CalcagnoDDGHLOP15},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/tcs/PymOY04,
|
||||
author = {David J. Pym and
|
||||
Peter W. O'Hearn and
|
||||
Hongseok Yang},
|
||||
title = {Possible worlds and resources: the semantics of {BI}},
|
||||
journal = tcs,
|
||||
volume = {315},
|
||||
number = {1},
|
||||
pages = {257--305},
|
||||
year = {2004},
|
||||
url = {https://doi.org/10.1016/j.tcs.2003.11.020},
|
||||
doi = {10.1016/j.tcs.2003.11.020},
|
||||
timestamp = {Wed, 14 Nov 2018 10:33:33 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/tcs/PymOY04},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/mscs/GalmicheMJP05,
|
||||
author = {Didier Galmiche and
|
||||
Daniel M{\'{e}}ry and
|
||||
David J. Pym},
|
||||
title = {The semantics of {BI} and resource tableaux},
|
||||
journal = mscs,
|
||||
volume = {15},
|
||||
number = {6},
|
||||
pages = {1033--1088},
|
||||
year = {2005},
|
||||
url = {https://doi.org/10.1017/S0960129505004858},
|
||||
doi = {10.1017/S0960129505004858},
|
||||
timestamp = {Sun, 28 May 2017 13:25:37 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/mscs/GalmicheMJP05},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@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},
|
||||
journal = tcs,
|
||||
volume = {375},
|
||||
number = {1--3},
|
||||
pages = {271--307},
|
||||
year = {2007},
|
||||
url = {https://doi.org/10.1016/j.tcs.2006.12.035},
|
||||
doi = {10.1016/j.tcs.2006.12.035},
|
||||
timestamp = {Wed, 14 Nov 2018 10:33:29 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/tcs/OHearn07},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@techreport{reynolds-SL,
|
||||
author = {John C. Reynolds},
|
||||
title = {An Introduction to Separation Logic (Preliminary Draft)},
|
||||
institution = {ITU University, Copenhagen},
|
||||
year = 2008,
|
||||
url = {https://www.cs.cmu.edu/~jcr/copenhagen08.pdf},
|
||||
}
|
||||
|
||||
@article{DBLP:journals/bsl/OHearnP99,
|
||||
author = {Peter W. O'Hearn and
|
||||
David J. Pym},
|
||||
title = {The logic of bunched implications},
|
||||
journal = {Bulletin of Symbolic Logic},
|
||||
volume = {5},
|
||||
number = {2},
|
||||
pages = {215--244},
|
||||
year = {1999},
|
||||
url = {http://www.math.ucla.edu/\%7Easl/bsl/0502/0502-003.ps},
|
||||
timestamp = {Fri, 31 Mar 2006 14:53:26 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/journals/bsl/OHearnP99},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@book{PymMono,
|
||||
title={The Semantics and Proof Theory of the Logic of Bunched Implications},
|
||||
author={David J. Pym},
|
||||
year={2002},
|
||||
publisher={Kluwer Academic Publishers},
|
||||
series={Applied Logic Series},
|
||||
volume={26},
|
||||
note={Errata and Remarks maintained at:
|
||||
\url{http://www.cantab.net/users/david.pym/BI-monograph-errata.pdf}},
|
||||
}
|
||||
|
||||
@inproceedings{DBLP:conf/lics/Pym99,
|
||||
author = {David J. Pym},
|
||||
title = {On Bunched Predicate Logic},
|
||||
booktitle = lics99,
|
||||
pages = {183--192},
|
||||
year = {1999},
|
||||
url = {https://doi.org/10.1109/LICS.1999.782614},
|
||||
doi = {10.1109/LICS.1999.782614},
|
||||
timestamp = {Thu, 25 May 2017 00:42:40 +0200},
|
||||
biburl = {https://dblp.org/rec/bib/conf/lics/Pym99},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@article{DBLP:journals/pacmpl/EhrhardPT18,
|
||||
author = {Thomas Ehrhard and
|
||||
Michele Pagani and
|
||||
Christine Tasson},
|
||||
title = {Measurable cones and stable, measurable functions: a model for probabilistic
|
||||
higher-order programming},
|
||||
journal = pacmpl,
|
||||
volume = {2},
|
||||
number = {{POPL}},
|
||||
pages = {59:1--59:28},
|
||||
year = {2018},
|
||||
url = {https://doi.org/10.1145/3158147},
|
||||
doi = {10.1145/3158147},
|
||||
timestamp = {Tue, 06 Nov 2018 12:51:05 +0100},
|
||||
biburl = {https://dblp.org/rec/bib/journals/pacmpl/EhrhardPT18},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||
}
|
||||
|
||||
@phdthesis{Yang:2001:LRS:933728,
|
||||
author = {Yang, Hongseok},
|
||||
advisor = {Reddy, Uday S.},
|
||||
title = {Local Reasoning for Stateful Programs},
|
||||
year = {2001},
|
||||
isbn = {0-493-35008-X},
|
||||
note = {AAI3023240},
|
||||
publisher = {University of Illinois at Urbana-Champaign},
|
||||
address = {Champaign, IL, USA},
|
||||
}
|
||||
|
|
|
|||
Loading…
Reference in New Issue