Update bib.
This commit is contained in:
Justin Hsu
parent
983a1d79fb
commit
c733e5b1aa
|
|
@ -299,6 +299,7 @@
|
||||||
@STRING{pldi16 = pldi # ", Santa Barbara, California" }
|
@STRING{pldi16 = pldi # ", Santa Barbara, California" }
|
||||||
@STRING{pldi18 = pldi # ", Philadelphia, Pennsylvania" }
|
@STRING{pldi18 = pldi # ", Philadelphia, Pennsylvania" }
|
||||||
@STRING{pldi19 = pldi # ", Phoenix, Arizona" }
|
@STRING{pldi19 = pldi # ", Phoenix, Arizona" }
|
||||||
|
@STRING{pldi21 = pldi }
|
||||||
% ----
|
% ----
|
||||||
@STRING{lfp = "ACM Symposium on Lisp and Functional Programming (LFP)" }
|
@STRING{lfp = "ACM Symposium on Lisp and Functional Programming (LFP)" }
|
||||||
@STRING{lfp80 = lfp # ", Stanford, California" }
|
@STRING{lfp80 = lfp # ", Stanford, California" }
|
||||||
|
|
@ -380,6 +381,7 @@
|
||||||
@STRING{focs89 = focs # ", Triangle Park, North Carolina"}
|
@STRING{focs89 = focs # ", Triangle Park, North Carolina"}
|
||||||
@STRING{focs95 = focs # ", Milwaukee, Wisconsin"}
|
@STRING{focs95 = focs # ", Milwaukee, Wisconsin"}
|
||||||
@STRING{focs97 = focs # ", Miami Beach, Florida"}
|
@STRING{focs97 = focs # ", Miami Beach, Florida"}
|
||||||
|
@STRING{focs01 = focs # ", Las Vegas, Nevada"}
|
||||||
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
|
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
|
||||||
@STRING{focs07 = focs # ", Providence, Rhode Island"}
|
@STRING{focs07 = focs # ", Providence, Rhode Island"}
|
||||||
@STRING{focs09 = focs # ", Atlanta, Georgia"}
|
@STRING{focs09 = focs # ", Atlanta, Georgia"}
|
||||||
|
|
@ -568,6 +570,8 @@
|
||||||
@STRING{aplas = {Asian Symposium on Programming Languages and Systems (APLAS)} }
|
@STRING{aplas = {Asian Symposium on Programming Languages and Systems (APLAS)} }
|
||||||
@STRING{asplos = {International Conference on Architectural Support for
|
@STRING{asplos = {International Conference on Architectural Support for
|
||||||
Programming Langauages and Operating Systems (ASPLOS)} }
|
Programming Langauages and Operating Systems (ASPLOS)} }
|
||||||
|
@STRING{atva = {International Symposium on Automated Technology for
|
||||||
|
Verification and Analysis (ATVA)} }
|
||||||
@STRING{calco = {Conference on Algebra and Coalgebra in Computer Science ({CALCO})}}
|
@STRING{calco = {Conference on Algebra and Coalgebra in Computer Science ({CALCO})}}
|
||||||
@STRING{cav = {International Conference on Computer Aided Verification (CAV)} }
|
@STRING{cav = {International Conference on Computer Aided Verification (CAV)} }
|
||||||
@STRING{ceemas = {International Central and Eastern European Conference on
|
@STRING{ceemas = {International Central and Eastern European Conference on
|
||||||
|
|
@ -675,6 +679,8 @@
|
||||||
@STRING{asplos14 = asplos # ", Salt Lake City, Utah" }
|
@STRING{asplos14 = asplos # ", Salt Lake City, Utah" }
|
||||||
@STRING{asplos06 = asplos # ", San Jose, California" }
|
@STRING{asplos06 = asplos # ", San Jose, California" }
|
||||||
%----
|
%----
|
||||||
|
@STRING{atva19 = atva # ", Taipei City, Taiwan" }
|
||||||
|
%----
|
||||||
@STRING{ceemas07 = ceemas # ", Leipzig, Germany" }
|
@STRING{ceemas07 = ceemas # ", Leipzig, Germany" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{colt95 = colt # ", Santa Cruz, California" }
|
@STRING{colt95 = colt # ", Santa Cruz, California" }
|
||||||
|
|
@ -683,6 +689,7 @@
|
||||||
@STRING{colt12 = colt # ", Edinburgh, Scotland" }
|
@STRING{colt12 = colt # ", Edinburgh, Scotland" }
|
||||||
@STRING{colt13 = colt # ", Princeton, New Jersey" }
|
@STRING{colt13 = colt # ", Princeton, New Jersey" }
|
||||||
@STRING{colt14 = colt # ", Barcelona, Spain" }
|
@STRING{colt14 = colt # ", Barcelona, Spain" }
|
||||||
|
@STRING{colt16 = colt # ", New York, New York" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{concur95 = concur # ", Philadelphia, Pennsylvania" }
|
@STRING{concur95 = concur # ", Philadelphia, Pennsylvania" }
|
||||||
@STRING{concur01 = concur # ", Aalborg, Denmark" }
|
@STRING{concur01 = concur # ", Aalborg, Denmark" }
|
||||||
|
|
@ -710,6 +717,7 @@
|
||||||
@STRING{cav16 = cav # ", Toronto, Ontario" }
|
@STRING{cav16 = cav # ", Toronto, Ontario" }
|
||||||
@STRING{cav17 = cav # ", Heidelberg, Germany" }
|
@STRING{cav17 = cav # ", Heidelberg, Germany" }
|
||||||
@STRING{cav18 = cav # ", Oxford, England" }
|
@STRING{cav18 = cav # ", Oxford, England" }
|
||||||
|
@STRING{cav20 = cav # ", Los Angeles, California" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{cp = "International Conference on Principles and Practice of
|
@STRING{cp = "International Conference on Principles and Practice of
|
||||||
Constraint Programming (CP)" }
|
Constraint Programming (CP)" }
|
||||||
|
|
@ -754,6 +762,7 @@
|
||||||
@STRING{esop16 = esop # ", Eindhoven, The Netherlands" }
|
@STRING{esop16 = esop # ", Eindhoven, The Netherlands" }
|
||||||
@STRING{esop17 = esop # ", Uppsala, Sweden" }
|
@STRING{esop17 = esop # ", Uppsala, Sweden" }
|
||||||
@STRING{esop18 = esop # ", Thessaloniki, Greece" }
|
@STRING{esop18 = esop # ", Thessaloniki, Greece" }
|
||||||
|
@STRING{esop21 = esop # ", Luxembourg City, Luxembourg" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{esorics03 = esorics # ", Gj{\o}vic, Norway" }
|
@STRING{esorics03 = esorics # ", Gj{\o}vic, Norway" }
|
||||||
% ---
|
% ---
|
||||||
|
|
@ -883,6 +892,7 @@ STRING{fse08 = fse # ", Atlanta, Georgia" }
|
||||||
@STRING{tacas15 = tacas # ", London, England" }
|
@STRING{tacas15 = tacas # ", London, England" }
|
||||||
@STRING{tacas16 = tacas # ", Eindhoven, The Netherlands" }
|
@STRING{tacas16 = tacas # ", Eindhoven, The Netherlands" }
|
||||||
@STRING{tacas18 = tacas # ", Thessaloniki, Greece" }
|
@STRING{tacas18 = tacas # ", Thessaloniki, Greece" }
|
||||||
|
@STRING{tacas20 = tacas # ", Dublin, Ireland" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{tapsoft93 = tapsoft # ", Orsay, France" }
|
@STRING{tapsoft93 = tapsoft # ", Orsay, France" }
|
||||||
@STRING{tapsoft97 = tapsoft # ", Lille, France" }
|
@STRING{tapsoft97 = tapsoft # ", Lille, France" }
|
||||||
|
|
|
||||||
416
bibs/myrefs.bib
416
bibs/myrefs.bib
|
|
@ -1,4 +1,37 @@
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
|
@unpublished{BGHT21,
|
||||||
|
title = {A Separation Logic for Negative Dependence},
|
||||||
|
author = {Bao, Jialu and
|
||||||
|
Gaboardi, Marco and
|
||||||
|
Hsu, Justin and
|
||||||
|
Tassarotti, Joseph},
|
||||||
|
year = 2021,
|
||||||
|
jh = yes,
|
||||||
|
}
|
||||||
|
|
||||||
|
@unpublished{SLHR21,
|
||||||
|
title = {Symbolic Execution for Randomized Programs},
|
||||||
|
author = {Susag, Zachary and
|
||||||
|
Lahiri, Sumit and
|
||||||
|
Hsu, Justin and
|
||||||
|
Roy, Subhajit},
|
||||||
|
year = 2021,
|
||||||
|
jh = yes,
|
||||||
|
}
|
||||||
|
|
||||||
|
@unpublished{BPHR21,
|
||||||
|
title = {Data-Driven Invariant Learning for Probabilistic Programs},
|
||||||
|
author = {Bao, Jialu and
|
||||||
|
Pathak, Drashti and
|
||||||
|
Hsu, Justin and
|
||||||
|
Roy, Subhajit},
|
||||||
|
url = {https://arxiv.org/abs/2106.05421},
|
||||||
|
eprint = {2106.05421},
|
||||||
|
archivePrefix = {arXiv},
|
||||||
|
primaryClass = {cs.PL},
|
||||||
|
year = 2021,
|
||||||
|
jh = yes,
|
||||||
|
}
|
||||||
|
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% THESIS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% THESIS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
@phdthesis{JHThesis,
|
@phdthesis{JHThesis,
|
||||||
|
|
@ -1125,6 +1158,15 @@ inproceedings{HHRRW14,
|
||||||
}
|
}
|
||||||
|
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% TALKS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% TALKS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
|
@talk{ini21-talk,
|
||||||
|
title = {Data-Driven Invariant Learning for Probabilistic Programs},
|
||||||
|
organization = {Verified Software: From Theory to Practice {(VSOW03)}, Isaac
|
||||||
|
Newton Institute for Mathematical Sciences},
|
||||||
|
year = 2021,
|
||||||
|
month = may,
|
||||||
|
jh = yes,
|
||||||
|
}
|
||||||
|
|
||||||
@talk{utopia21-talk,
|
@talk{utopia21-talk,
|
||||||
title = {Data-Driven Invariant Learning for Probabilistic Programs},
|
title = {Data-Driven Invariant Learning for Probabilistic Programs},
|
||||||
organization = {{UToPIA} Seminar, UT Austin},
|
organization = {{UToPIA} Seminar, UT Austin},
|
||||||
|
|
@ -3114,18 +3156,6 @@ year = {2014}
|
||||||
url = {https://sps.cs.uni-saarland.de/publications/dp_proto_long.pdf}
|
url = {https://sps.cs.uni-saarland.de/publications/dp_proto_long.pdf}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@inproceedings{GordonHNR14,
|
|
||||||
author = {Andrew D Gordon and
|
|
||||||
Thomas A Henzinger and
|
|
||||||
Aditya V Nori and
|
|
||||||
Sriram K Rajamani},
|
|
||||||
title = {Probabilistic programming},
|
|
||||||
booktitle = icse14,
|
|
||||||
year = {2014},
|
|
||||||
pages = {167--181},
|
|
||||||
url = {https://research.microsoft.com/pubs/208585/fose-icse2014.pdf}
|
|
||||||
}
|
|
||||||
@inproceedings{DaviesP00,
|
@inproceedings{DaviesP00,
|
||||||
author = {Rowan Davies and
|
author = {Rowan Davies and
|
||||||
Frank Pfenning},
|
Frank Pfenning},
|
||||||
|
|
@ -3444,15 +3474,6 @@ year = {2014}
|
||||||
year = {2014}
|
year = {2014}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{OhP99,
|
|
||||||
title = {The logic of bunched implications},
|
|
||||||
author = {O'Hearn, Peter W and Pym, David J},
|
|
||||||
journal = bsl,
|
|
||||||
pages = {215--244},
|
|
||||||
url = {https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.27.4742&rep=rep1&type=pdf},
|
|
||||||
year = {1999}
|
|
||||||
}
|
|
||||||
|
|
||||||
@article{POhY04,
|
@article{POhY04,
|
||||||
title = {Possible worlds and resources: The semantics of {BI}},
|
title = {Possible worlds and resources: The semantics of {BI}},
|
||||||
author = {Pym, David J and O'Hearn, Peter W and Yang, Hongseok},
|
author = {Pym, David J and O'Hearn, Peter W and Yang, Hongseok},
|
||||||
|
|
@ -7902,23 +7923,6 @@ url={https://doi.org/10.1007/3-540-48224-5_35}
|
||||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
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,
|
@article{DBLP:journals/mscs/GalmicheMJP05,
|
||||||
author = {Didier Galmiche and
|
author = {Didier Galmiche and
|
||||||
Daniel M{\'{e}}ry and
|
Daniel M{\'{e}}ry and
|
||||||
|
|
@ -7975,15 +7979,14 @@ url={https://doi.org/10.1007/3-540-48224-5_35}
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{DBLP:journals/bsl/OHearnP99,
|
@article{DBLP:journals/bsl/OHearnP99,
|
||||||
author = {Peter W. O'Hearn and
|
author = {O'Hearn, Peter W and Pym, David J},
|
||||||
David J. Pym},
|
journal = bsl,
|
||||||
title = {The logic of bunched implications},
|
|
||||||
journal = {Bulletin of Symbolic Logic},
|
|
||||||
volume = {5},
|
volume = {5},
|
||||||
number = {2},
|
number = {2},
|
||||||
pages = {215--244},
|
pages = {215--244},
|
||||||
year = {1999},
|
year = {1999},
|
||||||
url = {http://www.math.ucla.edu/\%7Easl/bsl/0502/0502-003.ps},
|
url = {http://www.math.ucla.edu/\%7Easl/bsl/0502/0502-003.ps},
|
||||||
|
publisher = cup,
|
||||||
timestamp = {Fri, 31 Mar 2006 14:53:26 +0200},
|
timestamp = {Fri, 31 Mar 2006 14:53:26 +0200},
|
||||||
biburl = {https://dblp.org/rec/bib/journals/bsl/OHearnP99},
|
biburl = {https://dblp.org/rec/bib/journals/bsl/OHearnP99},
|
||||||
bibsource = {dblp computer science bibliography, https://dblp.org}
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
|
@ -8507,3 +8510,332 @@ note={Errata and Remarks maintained at:
|
||||||
pages={343--348},
|
pages={343--348},
|
||||||
year={1992},
|
year={1992},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/esop/FarinaCG21,
|
||||||
|
author = {Gian Pietro Farina and
|
||||||
|
Stephen Chong and
|
||||||
|
Marco Gaboardi},
|
||||||
|
editor = {Nobuko Yoshida},
|
||||||
|
title = {Coupled Relational Symbolic Execution for Differential Privacy},
|
||||||
|
booktitle = esop21,
|
||||||
|
series = lncs,
|
||||||
|
volume = {12648},
|
||||||
|
pages = {207--233},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2021},
|
||||||
|
url = {https://doi.org/10.1007/978-3-030-72019-3\_8},
|
||||||
|
doi = {10.1007/978-3-030-72019-3\_8},
|
||||||
|
timestamp = {Fri, 14 May 2021 08:34:21 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/esop/FarinaCG21.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/esop/MoosbruggerBKK21,
|
||||||
|
author = {Marcel Moosbrugger and
|
||||||
|
Ezio Bartocci and
|
||||||
|
Joost{-}Pieter Katoen and
|
||||||
|
Laura Kov{\'{a}}cs},
|
||||||
|
editor = {Nobuko Yoshida},
|
||||||
|
title = {Automated Termination Analysis of Polynomial Probabilistic Programs},
|
||||||
|
booktitle = esop21,
|
||||||
|
series = lncs,
|
||||||
|
volume = {12648},
|
||||||
|
pages = {491--518},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2021},
|
||||||
|
url = {https://doi.org/10.1007/978-3-030-72019-3\_18},
|
||||||
|
doi = {10.1007/978-3-030-72019-3\_18},
|
||||||
|
timestamp = {Fri, 14 May 2021 08:34:21 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/esop/MoosbruggerBKK21.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/tacas/BartocciKS20,
|
||||||
|
author = {Ezio Bartocci and
|
||||||
|
Laura Kov{\'{a}}cs and
|
||||||
|
Miroslav Stankovic},
|
||||||
|
editor = {Armin Biere and
|
||||||
|
David Parker},
|
||||||
|
title = {Mora -- Automatic Generation of Moment-Based Invariants},
|
||||||
|
booktitle = tacas20,
|
||||||
|
series = lncs,
|
||||||
|
volume = {12078},
|
||||||
|
pages = {492--498},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2020},
|
||||||
|
url = {https://doi.org/10.1007/978-3-030-45190-5\_28},
|
||||||
|
doi = {10.1007/978-3-030-45190-5\_28},
|
||||||
|
timestamp = {Fri, 14 May 2021 08:34:17 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/tacas/BartocciKS20.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/atva/BartocciKS19,
|
||||||
|
author = {Ezio Bartocci and
|
||||||
|
Laura Kov{\'{a}}cs and
|
||||||
|
Miroslav Stankovic},
|
||||||
|
editor = {Yu{-}Fang Chen and
|
||||||
|
Chih{-}Hong Cheng and
|
||||||
|
Javier Esparza},
|
||||||
|
title = {Automatic Generation of Moment-Based Invariants for Prob-Solvable
|
||||||
|
Loops},
|
||||||
|
booktitle = atva19,
|
||||||
|
series = lncs,
|
||||||
|
volume = {11781},
|
||||||
|
pages = {255--276},
|
||||||
|
publisher = springer,
|
||||||
|
year = {2019},
|
||||||
|
url = {https://doi.org/10.1007/978-3-030-31784-3\_15},
|
||||||
|
doi = {10.1007/978-3-030-31784-3\_15},
|
||||||
|
timestamp = {Mon, 15 Jun 2020 17:01:21 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/atva/BartocciKS19.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/pldi/WangS0CG21,
|
||||||
|
author = {Jinyi Wang and
|
||||||
|
Yican Sun and
|
||||||
|
Hongfei Fu and
|
||||||
|
Krishnendu Chatterjee and
|
||||||
|
Amir Kafshdar Goharshady},
|
||||||
|
editor = {Stephen N. Freund and
|
||||||
|
Eran Yahav},
|
||||||
|
title = {Quantitative analysis of assertion violations in probabilistic programs},
|
||||||
|
booktitle = pldi21,
|
||||||
|
pages = {1171--1186},
|
||||||
|
publisher = {{ACM}},
|
||||||
|
year = {2021},
|
||||||
|
url = {https://doi.org/10.1145/3453483.3454102},
|
||||||
|
doi = {10.1145/3453483.3454102},
|
||||||
|
timestamp = {Mon, 21 Jun 2021 13:42:02 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/pldi/WangS0CG21.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{DBLP:journals/cacm/Bloom70,
|
||||||
|
author = {Burton H. Bloom},
|
||||||
|
title = {Space/Time Trade-offs in Hash Coding with Allowable Errors},
|
||||||
|
journal = cacm,
|
||||||
|
volume = {13},
|
||||||
|
number = {7},
|
||||||
|
pages = {422--426},
|
||||||
|
year = {1970},
|
||||||
|
url = {https://doi.org/10.1145/362686.362692},
|
||||||
|
doi = {10.1145/362686.362692},
|
||||||
|
timestamp = {Wed, 14 Nov 2018 10:22:32 +0100},
|
||||||
|
biburl = {https://dblp.org/rec/journals/cacm/Bloom70.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{DBLP:journals/ipl/BoseGKMMMST08,
|
||||||
|
author = {Prosenjit Bose and
|
||||||
|
Hua Guo and
|
||||||
|
Evangelos Kranakis and
|
||||||
|
Anil Maheshwari and
|
||||||
|
Pat Morin and
|
||||||
|
Jason Morrison and
|
||||||
|
Michiel H. M. Smid and
|
||||||
|
Yihui Tang},
|
||||||
|
title = {On the false-positive rate of Bloom filters},
|
||||||
|
journal = {Inf. Process. Lett.},
|
||||||
|
volume = {108},
|
||||||
|
number = {4},
|
||||||
|
pages = {210--213},
|
||||||
|
year = {2008},
|
||||||
|
url = {https://doi.org/10.1016/j.ipl.2008.05.018},
|
||||||
|
doi = {10.1016/j.ipl.2008.05.018},
|
||||||
|
timestamp = {Fri, 30 Nov 2018 13:29:08 +0100},
|
||||||
|
biburl = {https://dblp.org/rec/journals/ipl/BoseGKMMMST08.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/cav/GopinathanS20,
|
||||||
|
author = {Kiran Gopinathan and
|
||||||
|
Ilya Sergey},
|
||||||
|
editor = {Shuvendu K. Lahiri and
|
||||||
|
Chao Wang},
|
||||||
|
title = {Certifying Certainty and Uncertainty in Approximate Membership Query
|
||||||
|
Structures},
|
||||||
|
booktitle = cav20,
|
||||||
|
series = lncs,
|
||||||
|
volume = {12225},
|
||||||
|
pages = {279--303},
|
||||||
|
publisher = {Springer},
|
||||||
|
year = {2020},
|
||||||
|
url = {https://doi.org/10.1007/978-3-030-53291-8\_16},
|
||||||
|
doi = {10.1007/978-3-030-53291-8\_16},
|
||||||
|
timestamp = {Wed, 12 Aug 2020 15:15:44 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/cav/GopinathanS20.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{pemantle:negdep,
|
||||||
|
author = {Pemantle, Robin},
|
||||||
|
title = {Towards a theory of negative dependence},
|
||||||
|
journal = {Journal of Mathematical Physics},
|
||||||
|
volume = {41},
|
||||||
|
number = {3},
|
||||||
|
pages = {1371-1390},
|
||||||
|
year = {2000},
|
||||||
|
doi = {10.1063/1.533200},
|
||||||
|
url = {https://arxiv.org/abs/math/0404095},
|
||||||
|
archivePrefix = {arXiv},
|
||||||
|
eprint = {math/0404095},
|
||||||
|
primaryClass = {math.PR},
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{DBLP:journals/cpc/DubhashiJR07,
|
||||||
|
author = {Devdatt P. Dubhashi and
|
||||||
|
Johan Jonasson and
|
||||||
|
Desh Ranjan},
|
||||||
|
title = {Positive Influence and Negative Dependence},
|
||||||
|
journal = {Comb. Probab. Comput.},
|
||||||
|
volume = {16},
|
||||||
|
number = {1},
|
||||||
|
pages = {29--41},
|
||||||
|
year = {2007},
|
||||||
|
url = {https://doi.org/10.1017/S0963548306007772},
|
||||||
|
doi = {10.1017/S0963548306007772},
|
||||||
|
timestamp = {Thu, 12 Mar 2020 15:55:50 +0100},
|
||||||
|
biburl = {https://dblp.org/rec/journals/cpc/DubhashiJR07.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{dubhashi-ranjan,
|
||||||
|
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},
|
||||||
|
url = {https://www.brics.dk/RS/96/25/BRICS-RS-96-25.pdf},
|
||||||
|
doi = {10.1002/(SICI)1098-2418(199809)13:2\\<99::AID-RSA1\\>3.0.CO;2-M},
|
||||||
|
timestamp = {Fri, 26 May 2017 22:50:39 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/journals/rsa/DubhashiR98.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{joag1983negative,
|
||||||
|
author={Joag-Dev, Kumar and Proschan, Frank},
|
||||||
|
title = {{Negative Association of Random Variables with Applications}},
|
||||||
|
volume = {11},
|
||||||
|
journal = {The Annals of Statistics},
|
||||||
|
number = {1},
|
||||||
|
publisher = {Institute of Mathematical Statistics},
|
||||||
|
pages = {286--295},
|
||||||
|
keywords = {association, conditionally decreasing in sequence, multivariate inequalities, negative association, Negative dependence, negative orthant dependence, negatively correlated normal random variables, negatively dependent in sequence, reverse rule of order 2},
|
||||||
|
year = {1983},
|
||||||
|
doi = {10.1214/aos/1176346079},
|
||||||
|
URL = {https://doi.org/10.1214/aos/1176346079}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{SR,
|
||||||
|
URL = {https://www.ams.org/journals/jams/2009-22-02/S0894-0347-08-00618-8/},
|
||||||
|
author = {Borcea, Julius and
|
||||||
|
Br\"and\'en, Petter and
|
||||||
|
Liggett, Thomas M.},
|
||||||
|
journal = {Journal of the American Mathematical Society},
|
||||||
|
number = {2},
|
||||||
|
pages = {521--567},
|
||||||
|
title = {Negative dependence and the geometry of polynomials},
|
||||||
|
volume = {22},
|
||||||
|
year = {2009}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/colt/AnariGR16,
|
||||||
|
author = {Anari, Nima and
|
||||||
|
Oveis Gharan, Shayan and
|
||||||
|
Rezaei, Alireza},
|
||||||
|
editor = {Vitaly Feldman and
|
||||||
|
Alexander Rakhlin and
|
||||||
|
Ohad Shamir},
|
||||||
|
title = {{M}onte {C}arlo {M}arkov Chain Algorithms for Sampling {S}trongly
|
||||||
|
{R}ayleigh Distributions and Determinantal Point Processes},
|
||||||
|
booktitle = colt16,
|
||||||
|
series = {{JMLR} Workshop and Conference Proceedings},
|
||||||
|
volume = {49},
|
||||||
|
pages = {103--115},
|
||||||
|
year = {2016},
|
||||||
|
url = {http://proceedings.mlr.press/v49/anari16.html},
|
||||||
|
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/colt/AnariGR16.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/focs/Srinivasan01,
|
||||||
|
author = {Aravind Srinivasan},
|
||||||
|
title = {Distributions on Level-Sets with Applications to Approximation Algorithms},
|
||||||
|
booktitle = focs01,
|
||||||
|
pages = {588--597},
|
||||||
|
year = {2001},
|
||||||
|
url = {https://doi.org/10.1109/SFCS.2001.959935},
|
||||||
|
doi = {10.1109/SFCS.2001.959935},
|
||||||
|
timestamp = {Wed, 16 Oct 2019 14:14:54 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/focs/Srinivasan01.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{DBLP:journals/ftml/KuleszaT12,
|
||||||
|
author = {Alex Kulesza and
|
||||||
|
Ben Taskar},
|
||||||
|
title = {Determinantal Point Processes for Machine Learning},
|
||||||
|
journal = {Found. Trends Mach. Learn.},
|
||||||
|
volume = {5},
|
||||||
|
number = {2-3},
|
||||||
|
pages = {123--286},
|
||||||
|
year = {2012},
|
||||||
|
url = {https://doi.org/10.1561/2200000044},
|
||||||
|
doi = {10.1561/2200000044},
|
||||||
|
timestamp = {Thu, 18 Jun 2020 22:08:17 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/journals/ftml/KuleszaT12.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
||||||
|
@article{branden-jonasson,
|
||||||
|
author = {Br\"and\'en, Petter and Jonasson, Johan},
|
||||||
|
title = {Negative Dependence in Sampling},
|
||||||
|
journal = {Scandinavian Journal of Statistics},
|
||||||
|
volume = {39},
|
||||||
|
number = {4},
|
||||||
|
pages = {830-838},
|
||||||
|
keywords = {Pareto sampling, Rayleigh property, Sampford sampling, uniform spanning tree},
|
||||||
|
doi = {https://doi.org/10.1111/j.1467-9469.2011.00766.x},
|
||||||
|
url = {http://www.math.chalmers.se/~jonasson/babsampling.pdf},
|
||||||
|
year = {2012}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{10.1145/2593882.2593900,
|
||||||
|
author = {Gordon, Andrew D. and Henzinger, Thomas A. and Nori, Aditya V. and Rajamani, Sriram K.},
|
||||||
|
title = {Probabilistic Programming},
|
||||||
|
year = {2014},
|
||||||
|
isbn = {9781450328654},
|
||||||
|
publisher = {Association for Computing Machinery},
|
||||||
|
url = {https://doi.org/10.1145/2593882.2593900},
|
||||||
|
doi = {10.1145/2593882.2593900},
|
||||||
|
booktitle = {Future of Software Engineering Proceedings ({FOSE}), Hyderabad, India},
|
||||||
|
pages = {167–181},
|
||||||
|
numpages = {15},
|
||||||
|
keywords = {Machine learning, Probabilistic programming, Program analysis},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/pldi/WangS0CG21,
|
||||||
|
author = {Jinyi Wang and
|
||||||
|
Yican Sun and
|
||||||
|
Hongfei Fu and
|
||||||
|
Krishnendu Chatterjee and
|
||||||
|
Amir Kafshdar Goharshady},
|
||||||
|
editor = {Stephen N. Freund and
|
||||||
|
Eran Yahav},
|
||||||
|
title = {Quantitative analysis of assertion violations in probabilistic programs},
|
||||||
|
booktitle = pldi21,
|
||||||
|
pages = {1171--1186},
|
||||||
|
publisher = {{ACM}},
|
||||||
|
year = {2021},
|
||||||
|
url = {https://doi.org/10.1145/3453483.3454102},
|
||||||
|
doi = {10.1145/3453483.3454102},
|
||||||
|
timestamp = {Mon, 21 Jun 2021 13:42:02 +0200},
|
||||||
|
biburl = {https://dblp.org/rec/conf/pldi/WangS0CG21.bib},
|
||||||
|
bibsource = {dblp computer science bibliography, https://dblp.org}
|
||||||
|
}
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue