@comment{{B-arxiv16,
author = Bollig, Benedikt,
affiliation = aff-LSVmexico,
title = One-Counter Automata with Counter Visibility,
institution = Computing Research Repository,
number = 1602.05940,
month = feb,
nmonth = 2,
year = 2016,
type = RR,
axeLSV = mexico,
NOcontrat = "",
url = http://arxiv.org/abs/1602.05940,
PDF = "http://www.lsv.fr/Publis/PAPERS/PDF/B-arxiv16.pdf",
lsvdate-new = 20160222,
lsvdate-upd = 20160222,
lsvdate-pub = 20160222,
lsv-category = "rapl",
wwwpublic = "public and ccsb",
note = 18~pages,
abstract = "In a one-counter automaton (OCA), one can read a letter
from some finite alphabet, increment and decrement the counter by
one, or test it for zero. It is well-known that universality and
language inclusion for OCAs are undecidable. We consider here OCAs
with counter visibility: Whenever the automaton produces a letter,
it outputs the current counter value along with~it. Hence, its
language is now a set of words over an infinite alphabet. We show
that universality and inclusion for that model are in PSPACE, thus
no harder than the corresponding problems for finite automata, which
can actually be considered as a special case. In fact, we show that
OCAs with counter visibility are effectively determinizable and
closed under all boolean operations. As~a~strict generalization, we
subsequently extend our model by registers. The general nonemptiness
problem being undecidable, we impose a bound on the number of
register comparisons and show that the corresponding nonemptiness
problem is NP-complete.",
}}
@article{GM-hjm20,
publisher = {University of Houston},
journal = {Houston Journal of Mathematics},
author = {Goubault{-}Larrecq, Jean and Mynard, Fr{\'e}d{\'e}ric},
title = {Convergence without Points},
volume = {46},
number = {1},
pages = {227-282},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GM-hjm20.pdf}
}
@inproceedings{DLM-csl20,
address = {Barcelona, Spain},
month = jan,
year = 2020,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Fern{\'a}ndel, Maribel and Muscholl, Anca},
acronym = {{CSL}'20},
booktitle = {{P}roceedings of the 28th {A}nnual {EACSL} {C}onference on
{C}omputer {S}cience {L}ogic ({CSL}'20)},
author = {St{\'e}phane Demri and {\'E}tienne Lozes and Alessio Mansutti},
title = {Internal Calculi for Separation Logics},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/11662/},
doi = {10.4230/LIPIcs.CSL.2020.19}
}
@article{CHKPT-nc19,
publisher = {Springer},
journal = {Natural Computing},
author = {Chatain, {\relax Th}omas and Haar, Stefan and Kolc{\'a}k, Juraj and Paulev{\'e}, Lo{\"i}c and Thakkar, Aalok},
title = {Concurrency in {Boolean} networks},
volume = {19},
pages = {91--109},
year = 2020,
pdf = {https://hal.inria.fr/hal-01893106v2/document},
url = {https://link.springer.com/article/10.1007/s11047-019-09748-4},
abstract = {Boolean networks (BNs) are widely used to model the qualitative dynamics
of biological systems. Besides the logical rules determining the evolution of each
component with respect to the state of its regulators, the scheduling of component
updates can have a dramatic impact on the predicted behaviours. In this paper, we
explore the use of Read (contextual) Petri Nets (RPNs) to study dynamics of BNs from
a concurrency theory perspective. After showing bi-directional translations between
RPNs and BNs and analogies between results on synchronism sensitivity, we illustrate
that usual updating modes for BNs can miss plausible behaviours, i.e., incorrectly
conclude on the absence/impossibility of reaching specific configurations. We propose
an encoding of BNs capitalizing on the RPN semantics enabling more behaviour than the
generalized asynchronous updating mode. The proposed encoding ensures a correct
abstraction of any multivalued refinement, as one may expect to achieve when modelling
biological systems with no assumption on its time features.}
}
@article{GBM-tocsys19,
publisher = {Springer},
journal = {Theory of Computing Systems},
author = {Gardy, Patrick and Bouyer, Patricia and Markey, Nicolas},
title = {Dependences in Strategy Logic},
volume = {64},
number = {3},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GBM-tocsys19.pdf},
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/GBM-tocsys19.pdf}
}
@proceedings{JSC-pn20,
title = {{P}roceedings of the 41st {C}onference on {P}etri {N}ets ({PN}'20)},
booktitle = {{P}roceedings of the 41st {C}onference on {P}etri {N}ets ({PN}'20)},
acronym = {{PN}'20},
editor = {Chatain, Thomas and Janicki, Ryszard and Sidorova, Natalia},
publisher = {Springer},
year = 2020,
month = june,
address = {Paris, France},
url = {https://www.springer.com/gp/book/9783030518301}
}
@article{JMS-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Lo{\"i}g Jezequel and Agnes Madalinski and Stefan Schwoon},
title = {{Distributed computation of vector clocks in Petri net unfoldings for test selection}},
volume = {30},
number = {3},
pages = {441-464},
year = {2020}
}
@article{AMP-nc20,
publisher = {Springer},
journal = {Natural Computing},
author = {Pablo Arrighi and Simon Martiel and Simon Perdrix},
title = {{Reversible causal graph dynamics: invertibility, block representation, vertex-preservation}},
volume = {19},
number = {1},
pages = {157-178},
doi = {10.1007/s11047-019-09768-0},
year = {2020},
pdf = {https://hal.archives-ouvertes.fr/hal-02400095},
url = {https://hal.archives-ouvertes.fr/hal-02400095}
}
@inproceedings{BKMMMP-ecai20,
address = {Santiago de Compostela, Spain},
month = sep,
optvolume = {??},
optseries = {Frontiers in Artificial Intelligence and Applications},
publisher = {{IOS} Press},
editor = {Lang, J{\'e}r{\^o}me and De Giacomo, Giuseppe and Barro and Sen{\'e}n Barro and O'Sullivan, Barry},
acronym = {{ECAI}'20},
booktitle = {{P}roceedings of the 24th {E}uropean {C}onference on
{A}rtificial {I}ntelligence ({ECAI}'20)},
author = {Patricia Bouyer and Orna Kupferman and Nicolas Markey and Bastien Maubert and Aniello Murano and Giuseppe Perelli},
title = {{Reasoning About Quality and Fuzziness of Strategic Behaviours}},
pages = {2887-2888},
year = 2020,
pdf = {https://ebooks.iospress.nl/publication/55232},
url = {https://ebooks.iospress.nl/publication/55232},
doi = {10.3233/FAIA200437}
}
@techreport{JFA-arxiv20,
author = {Jawher Jerray and
Laurent Fribourg and
{\'E}tienne Andr{\'e}},
institution = {Computing Research Repository},
month = june,
number = {2006.09993},
type = {Research Report},
title = {{Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples}},
year = {2020},
url = {https://arxiv.org/abs/2006.09993},
pdf = {https://arxiv.org/abs/2006.09993}
}
@techreport{JFA-arxiv20bis,
author = {Jawher Jerray and
Laurent Fribourg and
{\'E}tienne Andr{\'e}},
institution = {Computing Research Repository},
month = july,
number = {2007.13644},
type = {Research Report},
title = {{Robust optimal control using dynamic programming and guaranteed Euler's method}},
year = {2020},
url = {https://arxiv.org/abs/2007.13644},
pdf = {https://arxiv.org/abs/2007.13644}
}
@techreport{JF-arxiv20,
author = {Jawher Jerray and Laurent Fribourg},
institution = {Computing Research Repository},
month = december,
number = {2012.09310},
type = {Research Report},
title = {{Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems}},
year = {2020},
url = {https://arxiv.org/abs/2012.09310},
pdf = {https://arxiv.org/abs/2012.09310}
}
@techreport{Lopez-arxiv20,
author = {Aliaume Lopez},
institution = {Computing Research Repository},
month = july,
number = {2007.07879},
type = {Research Report},
title = {{Preservation Theorems Through the Lens of Topology}},
year = {2020},
url = {https://arxiv.org/abs/2007.07879},
pdf = {https://arxiv.org/abs/2007.07879}
}
@inproceedings{Boltenhagen-bpm20,
address = {Sevilla, Spain},
month = sep,
volume = 397,
series = {Lecture Notes in Business Information Processing},
publisher = {Springer},
editor = {Adela Del-Rio-Ortega and Henrik Leopold and Flavia Maria Santoro},
acronym = {{BPM}'20},
booktitle = {{B}usiness {P}rocess {M}anagement {W}orkshops ({BPM}'20), Revised Selected Papers},
author = {Mohammadreza Fani Sani and Mathilde Boltenhagen and Wil M.P. van der Aalst},
title = {Prototype Selection using Clustering and Conformance Metrics for Process Discovery},
pages = {281-294},
year = {2020},
doi = {https://doi.org/10.1007/978-3-030-66498-5_21},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-66498-5_21},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-66498-5_21}
}
@article{BCC-is20,
publisher = {Elsevier Science Publishers},
journal = {Information Systems},
author = {Mathilde Boltenhagen and Thomas Chatain and Josep Carmona},
title = {Model-based trace variant analysis of event logs},
year = 2020,
doi = {https://doi.org/10.1016/j.is.2020.101675},
url = {https://www.sciencedirect.com/science/article/abs/pii/S0306437920301307?via%3Dihub},
note = {To appear}
}
@inproceedings{BCH-icpm20,
address = {Padua, Italy},
month = oct,
publisher = {SPRINGER},
acronym = {{ICPM} 2020},
booktitle = {{Process Mining Workshops (ICPM'20)}},
author = {Mathilde Boltenhagen and Benjamin Chetioui and Laurine Huber},
title = {{Cost-Based Classification of Log Traces Using Machine-Learning}},
pages = {136-148},
year = {2020},
doi = {https://doi.org/10.1007/978-3-030-72693-5_11},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-72693-5_11},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-72693-5_11}
}
@inproceedings{BM-lfmtp2020,
address = {Paris, France},
month = june,
year = 2020,
publisher = {ACM Press},
editor = {Claudio Sacerdoti Coen and Alwen Tiu},
acronym = {{LFMTP}'20},
booktitle = {Proceedings of the 15th {I}nternational {W}orkshop on {L}ogical {F}rameworks and
{M}eta-{L}anguages: {T}heory and {P}ractice ({LFMTP}'20)},
author = {Bruno Barras and Valentin Maestracci},
title = {{Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory}},
pages = {54--67},
url = {https://arxiv.org/abs/2101.03810v1},
pdf = {https://arxiv.org/abs/2101.03810v1},
doi = {10.4204/EPTCS.332.4}
}
@inproceedings{Finkel-vpthcvs2020,
address = {Dublin, Ireland},
month = april,
year = 2020,
publisher = {Electronic Proceedings in Theoretical Computer Science},
editor = {Laurent Fribourg and Matthias Heizmann},
acronym = {{VPT/HCVS@ETAPS}'20},
booktitle = {Proceedings of 8th {I}nternational {W}orkshop on {V}erification and
{P}rogram {T}ransformation and 7th {W}orkshop on {H}orn {C}lauses for {V}erification and {S}ynthesis
({VPT/HCVS@ETAPS 2020})},
author = {Alain Finkel},
title = {{From Well Structured Transition Systems to Program Verification}},
pages = {44--49},
url = {https://arxiv.org/abs/2008.02929v1},
pdf = {https://arxiv.org/abs/2008.02929v1},
doi = {10.4204/EPTCS.320.3}
}
@inproceedings{LeRoux-cie2020,
address = {Fisciano, Italy},
month = june,
year = 2020,
volume = 12098,
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
editor = {Marcella Anselmo and Gianluca Della Vedova and Florin Manea and Arno Pauly },
acronym = {{CiE}'20},
booktitle = {{P}roceedings of the 16th {C}onference on {C}omputability in {E}urope ({CiE 2020})},
author = {Le Roux, St{\'e}phane},
title = {{Time-Aware Uniformization of Winning Strategies}},
pages = {193-204},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-51466-2_17},
pdf = {https://link.springer.com/chapter/10.1007%2F978-3-030-51466-2_17},
doi = {https://doi.org/10.1007/978-3-030-51466-2_17}
}
@phdthesis{thire-phd2020,
author = {Thir{\'e}, Fran{\c{c}}ois},
title = {{Meta-theory of Cumulative Types Systems and their embeddings to the $\Lambda \Pi$-calculus modulo theory}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/thire-phd20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/thire-phd20.pdf}
}
@article{GMG-fi20,
publisher = {{IOS} Press},
journal = {Fundamenta Informaticae},
author = {Gastin, Paul and Manuel, Amaldev and Govind, R.},
title = {{Reversible Regular Languages: Logical and Algebraic Characterisations}},
year = {2020},
note = {To appear}
}
@phdthesis{fortin-phd2020,
author = {Fortin, Marie},
title = {{Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = nov,
url = {https://tel.archives-ouvertes.fr/tel-03079438},
pdf = {https://tel.archives-ouvertes.fr/tel-03079438/document}
}
@phdthesis{Mansutti-phd2020,
author = {Mansutti, Alessio},
title = {{Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mansutti-phd20.pdf},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/mansutti-phd20.pdf}
}
@phdthesis{Genestier-phd2020,
author = {Genestier, Guillaume},
title = {{Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory
using Rewriting}},
school = {{\'E}cole Normale Sup{\'e}rieure Paris-Saclay, France},
type = {Th{\`e}se de doctorat},
year = 2020,
month = dec,
opturl = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/genestier-phd20.pdf},
optpdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/genestier-phd20.pdf}
}
@article{FHK-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
title = {{Commodification of accelerations for the Karp and Miller Construction}},
doi = {10.1007/s10626-020-00331-z},
year = {2020},
url = {https://link.springer.com/article/10.1007/s10626-020-00331-z}
}
@article{BHL-deds20,
publisher = {Springer},
journal = {Discrete Event Dynamic Systems: Theory and Applications},
author = {Nathalie Bertrand and Serge Haddad and Engel Lefaucheux},
title = {{Diagnosis and Degradation Control for Probabilistic Systems}},
volume = {30},
pages = {695–723},
doi = {10.1007/s10626-020-00320-2},
year = {2020},
url = {https://link.springer.com/article/10.1007/s10626-020-00320-2}
}
@article{FG-mscs20,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {Finkel, Alain and Goubault{-}Larrecq, Jean},
title = {{Forward analysis for WSTS, part I: completions}},
volume = {30},
number = {7},
pages = {752-832},
doi = {10.1017/S0960129520000195},
year = {2020},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/FG-mscs2020.pdf},
url = {http://dx.doi.org/10.1017/S0960129520000195}
}
@article{FP-lmcs20,
journal = {Logical Methods in Computer Science},
author = {Finkel, Alain and Praveen, M.},
title = {{Verification of Flat FIFO Systems}},
volume = {20},
number = {4},
doi = {10.23638/LMCS-16(4:4)2020},
year = {2020},
month = oct,
url = {https://lmcs.episciences.org/6839}
}
@proceedings{GLB-fossacs20,
title = {{P}roceedings of the 23rd {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation {S}tructures
({FoSSaCS}'20)},
booktitle = {{P}roceedings of the 23rd {C}onference on {F}oundations of {S}oftware {S}cience and {C}omputation
{S}tructures ({FoSSaCS}'20)},
acronym = {{FoSSaCS}'20},
editor = {Goubault{-}Larrecq, Jean and K{\"{o}}nig, Barbara},
publisher = {Springer},
year = 2020,
month = april,
address = {Dublin, Ireland},
url = {https://link.springer.com/book/10.1007/978-3-030-45231-5}
}
@techreport{KY-arxiv20,
author = {Khmelnitsky, Igor and
Neider, Daniel and
Roy, Rajarshi and
Barbot, Beno{\^{\i}}t and
Bollig, Benedikt and
Finkel, Alain and
Haddad, Serge and
Leucker, Martin and
Ye, Lina },
institution = {Computing Research Repository},
month = sep,
number = {2009.10610},
type = {Research Report},
title = {Property-Directed Verification of Recurrent Neural Networks},
year = {2020},
url = {https://arxiv.org/abs/2009.10610},
pdf = {https://arxiv.org/pdf/2009.10610.pdf}
}
@article{BJO-tcs20,
publisher = {Elsevier Science Publishers},
journal = {Theoretical Computer Science},
author = {Blanqui, Fr{\'{e}}d{\'{e}}ric and
Jouannaud, Jean{-}Pierre and
Okada, Mitsuhiro},
title = {Corrigendum to {\em {I}nductive-data-type systems} [Theoret. Comput. Sci.
272 {(1-2)} {(2002)} 41-68]},
volume = {817},
pages = {81--82},
doi = {10.1016/j.tcs.2018.01.010},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2018.01.010}
}
@techreport{DD-arxiv20,
author = {D{\'{\i}}az{-}Caro, Alejandro and Dowek, Gilles},
institution = {Computing Research Repository},
month = jul,
number = {2002.03762v3},
type = {Research Report},
title = {Extensional proofs in a propositional logic modulo isomorphisms},
year = {2020},
url = {https://arxiv.org/abs/2002.03762},
pdf = {https://arxiv.org/pdf/2002.03762v3.pdf}
}
@article{PKCH-natcommun20,
publisher = {Nature Research},
journal = {Nature Communications},
author = {Lo{\"i}c Paulev{\'e} and Juraj Kolc{\'a}k and Thomas Chatain and Stefan Haar},
title = {Reconciling qualitative, abstract, and scalable modeling of biological networks},
volume = {11},
number = {4256},
month = aug,
doi = {10.1038/s41467-020-18112-5},
year = {2020},
url = {https://www.nature.com/articles/s41467-020-18112-5}
}
@inproceedings{HPS-cmsb20,
address = {held online},
month = sep,
volume = {12314},
series = {Lecture Notes in Bioinformatics},
publisher = {Springer-Verlag},
editor = {Alessandro Abate and Tatjana Petrov and Verena Wolf},
acronym = {{CMSB}'20},
booktitle = {{P}roceedings of the 18th
{C}onference on
{C}omputational {M}ethods in {S}ystem {B}iology
({CMSB}'20)},
author = {Stefan Haar and Lo{\"i}c Paulev{\'e} and Stefan Schwoon},
title = {{Drawing the Line: Basin Boundaries in Safe Petri Nets}},
pages = {321-336},
year = {2020},
doi = {10.1007/978-3-030-60327-4\_17}
}
@inproceedings{CJS-ccs20,
address = {Orlando, USA},
month = nov,
publisher = {ACM Press},
editor = {Jonathan Katz and Giovanni Vigna},
acronym = {{CCS}'20},
booktitle = {{P}roceedings of the 27th {ACM} {C}onference
on {C}omputer and {C}ommunications {S}ecurity
({CCS}'20)},
author = {Hubert Comon and Charlie Jacomme and Guillaume Scerri},
title = {Oracle simulation: a technique for protocol composition with long term shared secrets},
pages = {1427-1444},
year = {2020},
doi = {10.1145/3372297.3417229}
}
@inproceedings{HHSY-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Stefan Haar and Serge Haddad and Stefan Schwoon and Lina Ye},
title = {Active Prediction for Discrete Event Systems},
pages = {48:1--48:16},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13289/pdf/LIPIcs-FSTTCS-2020-48.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13289}
}
@inproceedings{BBM-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Nathalie Bertrand and Patricia Bouyer and Anirban Majumdar},
title = {Synthesizing safe coalition strategies},
pages = {39:1--39:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13280/pdf/LIPIcs-FSTTCS-2020-39.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13280}
}
@inproceedings{BBRRV-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {Paul Gastin and Sayan Mukherjee and B Srivathsan},
title = {Reachability for updatable timed automata made faster and more effective},
pages = {47:1--47:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13288/pdf/LIPIcs-FSTTCS-2020-47.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13288}
}
@inproceedings{AG-fsttcs20,
address = {Goa, India},
month = dec,
volume = {182},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Nitin Saxena and Sunil Simon},
acronym = {{FSTTCS}'20},
booktitle = {{P}roceedings of the 40th {C}onference on
{F}oundations of {S}oftware {T}echnology and
{T}heoretical {C}omputer {S}cience
({FSTTCS}'20)},
author = {C. Aiswarya and Paul Gastin},
title = {Weighted Tiling Systems for Graphs: Evaluation Complexity},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13275/pdf/LIPIcs-FSTTCS-2020-34.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13275}
}
@inproceedings{ADL-aaai20,
month = feb,
publisher = {AAAI Press},
editor = {Rossi, Francesca and Conitzer, Vincent and Sha, Fei},
acronym = {{AAAI}'20},
booktitle = {{P}roceedings of the 34th {AAAI} {C}onference on {A}rtificial
{I}ntelligence ({AAAI}'20)},
author = {Alechina, Natasha and Demri, St{\'e}phane and Logan, Brian},
title = {Parameterised Resource-Bounded ATL},
pages = {7040--7046},
year = {2020},
doi = {https://doi.org/10.1609/aaai.v34i05.6189},
url = {https://aaai.org/ojs/index.php/AAAI/article/view/6189}
}
@inproceedings{BBRRV-gandalf20,
address = {Brussels, Belgium},
month = sep,
volume = {326},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Bresolin, Davide and Raskin, Jean-Fran\c{c}ois},
acronym = {{GandALF}'20},
booktitle = {{P}roceedings of the 11th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'20)},
author = {Bouyer, Patricia and Brihaye, Thomas and Randour, Mickael and Rivi{\`e}re, C{\'e}dric and Vandenhove, Pierre},
title = {Decisiveness of Stochastic Systems and its Application to Hybrid Models},
pages = {149?165},
year = {2020},
doi = {10.4204/EPTCS.326.10},
pdf = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.10.pdf},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.10}
}
@inproceedings{BBBFS-gandalf20,
address = {Brussels, Belgium},
month = sep,
volume = {326},
series = {Electronic Proceedings in Theoretical Computer Science},
editor = {Bresolin, Davide and Raskin, Jean-Fran\c{c}ois},
acronym = {{GandALF}'20},
booktitle = {{P}roceedings of the 11th {I}nternational {S}ymposium
on {G}ames, {A}utomata, {L}ogics, and {F}ormal {V}erification
({GandALF}'20)},
author = {B{\'e}atrice B{\'e}rard and
Benedikt Bollig and
Patricia Bouyer and
Matthias F{\"u}gger and
Nathalie Sznajder},
title = {Synthesis in Presence of Dynamic Links},
pages = {33?49},
year = {2020},
doi = {10.4204/EPTCS.326.3},
pdf = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.3.pdf},
url = {http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2020.3}
}
@inproceedings{DH-atpn20,
address = {Vienna, Austria},
month = sep,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = { Nathalie Bertrand and Nils Jansen},
acronym = {{FORMATS}'20},
booktitle = {{P}roceedings of the 18th {I}nternational {C}onference
on {F}ormal {M}odelling and {A}nalysis of {T}imed
{S}ystems ({FORMATS}'20)},
author = {Susanna Donatelli and Serge Haddad},
title = {Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata},
pages = {215--230},
year = {2020},
url = {https://link.springer.com/chapter/10.1007%2F978-3-030-57628-8_13}
}
@inproceedings{DFHKNS-disc20,
address = {Freiburg, Germany},
month = oct,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Hagit Attiya},
acronym = {{DISC}'20},
booktitle = {{P}roceedings of the 34th {I}nternational
{S}ymposium on {D}istributed {C}omputing
({DISC}'20)},
author = {Da{-}Jung Cho and
Matthias F{\"{u}}gger and
Corbin Hopper and
Manish Kushwaha and
Thomas Nowak and
Quentin Soubeyran},
title = {Distributed Computation with Continual Population Growth},
pages = {7:1--7:17},
year = {2020},
doi = {https://doi.org/10.4230/LIPIcs.DISC.2020.7},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/13085/pdf/LIPIcs-DISC-2020-7.pdf},
url = {https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=13085}
}
@article{BFG-lmcs20,
journal = {Logical Methods in Computer Science},
author = {Michael Blondin and Alain Finkel and Jean Goubault{-}Larrecq},
title = {{Forward Analysis for WSTS, Part {III:} Karp-Miller Trees}},
volume = {16},
number = {2},
doi = {10.23638/LMCS-16(2:13)2020},
year = {2020},
url = {https://lmcs.episciences.org/6591}
}
@article{DGN-ic20,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Dave, Vrunda and Gastin, Paul and Krishna, Shankara Narayanan},
title = {Regular Transducer Expressions for Regular Transformations},
year = {2020},
url = {https://doi.org/10.1016/j.ic.2020.104655},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DGK20-IC-final.pdf}
}
@inproceedings{DFG-mfcs20,
address = {Prague, Czech Republic},
month = aug,
volume = {170},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Javier Esparza and Dan Kr{\'a}l},
acronym = {{MFCS}'20},
booktitle = {{P}roceedings of the 43rd
{I}nternational {S}ymposium on
{M}athematical {F}oundations of
{C}omputer {S}cience
({MFCS}'20)},
author = {Dou{\'e}neau-Tabot, Ga{\"e}tan and Filiot, Emmanuel and Gastin, Paul},
title = {Register transducers are marble transducers},
pages = {29:1--29:14},
year = 2020,
doi = {https://doi.org/10.4230/LIPIcs.MFCS.2020.29},
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12697/pdf/LIPIcs-MFCS-2020-29.pdf},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12697/}
}
@inproceedings{BLORV-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Bouyer, Patricia and Le Roux, St{\'e}phane and Oualhadj, Youssouf and Randour, Mickael and Vandenhove, Pierre},
title = {Games Where You Can Play Optimally with Arena-Independent Finite Memory},
pages = {24:1--24:22},
year = 2020,
doi = {10.4230/LIPIcs.CONCUR.2020.24},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12836}
}
@inproceedings{AGSW-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Bharat Adsul and Paul Gastin and Saptarshi Sarkar and Pascal Weil},
title = {Wreath/cascade products and related decomposition results for the concurrent setting of {M}azurkiewicz traces},
pages = {19:1--19:17},
year = 2020,
doi = {10.4230/LIPIcs.CONCUR.2020.19},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12831}
}
@inproceedings{BDM-concur20,
address = {Vienna, Austria},
month = sep,
volume = {171},
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Igor Konnov and Laura Kovacs},
acronym = {{CONCUR}'20},
booktitle = {{P}roceedings of the 31st
{I}nternational {C}onference on
{C}oncurrency {T}heory
({CONCUR}'20)},
author = {Benedikt Bollig and Alain Finkel and Amrita Suresh},
title = {Bounded Reachability Problems are Decidable in {FIFO} Machines},
pages = {49:1--49:17},
year = 2020,
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12861}
}
@article{BFG-jcss20,
publisher = {Elsevier Science Publishers},
journal = {Journal of Computer and System Sciences},
author = {Benedikt Bollig and Marie Fortin and Paul Gastin},
title = {Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic},
pages = {22-53},
doi = {10.1016/j.jcss.2020.06.006},
year = {2020},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BFG20-JCSS.pdf},
abstract = {Message sequence charts (MSCs) naturally arise as executions of communicating
finite-state machines (CFMs), in which finite-state processes exchange
messages through unbounded FIFO channels. We study the first-order logic of
MSCs, featuring Lamport's happened-before relation. To this end, we introduce a star-free
version of propositional dynamic logic (PDL) with loop and converse. Our main
results state that (i) every first-order sentence can be transformed into an
equivalent star-free PDL sentence (and conversely), and (ii) every star-free
PDL sentence can be translated into an equivalent CFM. This answers an open
question and settles the exact relation between CFMs and fragments of monadic
second-order logic. As a byproduct, we show that first-order logic over MSCs
has the three-variable property.}
}
@inproceedings{BDM-csf20,
address = {Boston, MA, USA},
month = jul,
publisher = {{IEEE} Computer Society Press},
editor = {Jia, Limin and K{\"u}sters, Ralf},
acronym = {{CSF}'19},
booktitle = {{P}roceedings of the
33rd {IEEE} {C}omputer {S}ecurity {F}oundations
{S}ymposium ({CSF}'20)},
author = {David Baelde and St{\'e}phanie Delaune and Sol{\`e}ne Moreau},
title = {A Method for Proving Unlinkability of Stateful Protocols},
pages = {169--183},
year = 2020,
url = {https://hal.archives-ouvertes.fr/hal-02459984/},
abstract = {The rise of contactless and wireless devices such as mobile phones and RFID chips justifies significant concerns over privacy, and calls for communication protocols that ensure some form of unlinkability. Formally specifying this property is difficult and context-dependent, and analysing it is very complex; as is common with security protocols, several incorrect unlinkability claims can be found in the literature. Formal verification is therefore desirable, but current techniques are not sufficient to directly analyse unlinkability. In [Hirschi et al., SP'19], two conditions have been identified that imply unlinkability and can be automatically verified. This work, however, only considers a restricted class of protocols. We adapt their formal definition as well as their proof method to the common setting of RFID authentication protocols, where readers access a central database of authorised users. Moreover, we also consider protocols where readers may update their database, and tags may also carry a mutable state. We propose sufficient conditions to ensure unlinkability, find new attacks, and obtain new proofs of unlinkability using Tamarin to establish our sufficient conditions.}
}
@article{JGL-topa2020,
publisher = {Elsevier Science Publishers},
journal = {Topology and its Applications},
author = {Goubault{-}Larrecq, Jean},
title = {{Some Topological Properties of Spaces of Lipschitz Continuous Maps on Quasi-Metric Spaces}},
volume = {282},
year = 2020,
doi = {10.1016/j.topol.2020.107281},
url = {https://doi.org/10.1016/j.topol.2020.107281}
}
@article{LRP-dga20,
publisher = {Springer},
journal = {Dynamic Games and Applications},
author = {Le Roux, St{\'e}phane and Pauly, Arno},
title = {A Semi-Potential for Finite and Infinite Games in Extensive Form},
volume = {10},
number = {1},
pages = {120-144},
year = 2020,
doi = {10.1007/s13235-019-00301-7},
url = {https://doi.org/10.1007/s13235-019-00301-7}
}
@inproceedings{AVLRM-sac20,
address = {Brno, Czech Republic},
month = mar,
publisher = {ACM Press},
editor = {Chih{-}Cheng Hung and Tom{\'{a}}s Cern{\'{y}} and Dongwan Shin and Alessio Bechini},
acronym = {{SAC}'20},
booktitle = {{P}roceedings of the 35th {ACM/SIGAPP} {S}ymposium on {A}pplied {C}omputing ({SAC}'20)},
author = {Nikolaos Alexopoulos and Emmanouil Vasilomanolakis and St{\'e}phane {Le Roux} and Steven Rowe and Max M{\"u}hlh{\"a}user},
title = {{TRIDEnT}: Towards a Decentralized Threat Indicator Marketplace},
pages = {332-341},
year = {2020},
doi = {10.1145/3341105.3374020},
url = {https://doi.org/10.1145/3341105.3374020}
}
@article{CFLS-ppet20,
author = {Sergiu Carpov and Caroline Fontaine and Damien Ligier and Renaud Sirdey},
title = {{Illuminating the Dark or how to recover what should not be seen in FE-based classifiers}},
pages = {1-35},
year = {2020},
month = may,
volume = {2020},
issue = {2},
doi = {10.2478/popets-2020-0015},
url = {https://content.sciendo.com/view/journals/popets/2020/2/article-p5.xml}
}
@article{BFLM-tcsi20,
publisher = {{IEEE} Press},
journal = {IEEE Transactions on Circuits and Systems I},
author = {Johannes Bund and Matthias F{\"u}gger and Christoph Lenzen and Moti Medina},
title = {Synchronizer-free Digital Link Controller},
volume = {67},
number = {10},
pages = {3562-3573},
year = {2020},
doi = {10.1109/TCSI.2020.2989552},
url = {https://ieeexplore.ieee.org/document/9085899}
}
@incollection{FKN-AiSB2020,
publisher = {Springer},
booktitle = {Advances in Synthetic Biology},
editor = {Vijai Singh},
author = {Matthias F{\"u}gger and Manish Kushwaha and Thomas Nowak},
title = {Digital Circuit Design for Biological and Silicon Computers},
year = 2020,
note = {To appear}
}
@article{FNW-dapplmath20,
publisher = {Elsevier Science Publishers},
journal = {Discrete Applied Mathematics},
author = {Matthias F{\"u}gger and Thomas Nowak and Kyrill Winkler},
title = {On the radius of nonsplit graphs and information dissemination in dynamic networks},
volume = {282},
pages = {257-264},
year = {2020},
doi = {10.1016/j.dam.2020.02.013},
url = {http://www.sciencedirect.com/science/article/pii/S0166218X20300809}
}
@inproceedings{BFLMR-async20,
address = {Publication only},
month = may,
publisher = {{IEEE} Computer Society},
editor = {Andreas Steininger and Matheus T. Moreira},
acronym = {{ASYNC}'20},
booktitle = {{P}roceedings of the 26th {IEEE} {I}nternational {S}ymposium on {A}synchronous {C}ircuits and {S}ystems ({ASYNC}'20)},
author = {Johannes Bund and Matthias F{\"u}gger and Christoph Lenzen and Moti Medina and Will Rosenbaum},
title = {{PALS: Plesiochronous and Locally Synchronous Systems}},
year = {2020},
pdf = {https://arxiv.org/pdf/2003.05542.pdf}
}
@article{ABF-qip20,
publisher = {Springer},
journal = {Quantum Information Processing},
author = {Pablo Arrighi and C{\'{e}}dric B{\'{e}}ny and Terry Farrelly},
title = {A quantum cellular automaton for one-dimensional {QED}},
volume = {19},
number = {88},
year = {2020},
url = {https://arxiv.org/abs/1903.07007},
doi = {10.1007/s11128-019-2555-4}
}
@article{MA-qip20,
publisher = {Springer},
journal = {Quantum Information Processing},
author = {Giuseppe Di Molfetta and Pablo Arrighi},
title = {A quantum walk with both a continuous-time limit and a continuous-spacetime limit},
volume = {19},
number = {47},
year = {2020},
url = {https://arxiv.org/abs/1906.04483},
doi = {10.1007/s11128-019-2549-2}
}
@inproceedings{HK-atpn20,
address = {Paris, France},
month = jun,
volume = {12152},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Ryszard Janicki and Natalia Sidorova and Thomas Chatain},
acronym = {{PETRI~NETS}'20},
booktitle = {{P}roceedings of the 41st
{I}nternational {C}onference on
{A}pplications and {T}heory of {P}etri {N}ets
({PETRI~NETS}'20)},
author = {Serge Haddad and Igor Khmelnitsky},
title = {{D}ynamic {R}ecursive {P}etri {N}ets},
pages = {345-366},
doi = {10.1007/978-3-030-51831-8\_17},
year = 2020,
url = {https://hal.inria.fr/hal-02511321}
}
@article{BFNS-mscs20,
publisher = {Cambridge University Press},
journal = {Mathematical Structures in Computer Science},
author = {David Baelde and Amy P. Felty and Gopalan Nadathur and Alexis Saurin},
title = {A special issue on structural proof theory, automated reasoning and
computation in celebration of Dale Miller's 60th birthday},
volume = {29},
number = {8},
pages = {1007--1008},
year = 2020,
doi = {10.1017/S0960129519000136},
abstract = {The genesis of this special issue was in a meeting that took place at Université Paris Diderot on December 15 and 16, 2016. Dale Miller, Professor at École polytechnique, had turned 60 a few days earlier. In a career spanning over three decades and in work conducted in collaboration with several students and colleagues, Dale had had a significant influence in an area that can be described as structural proof theory and its application to computation and reasoning. In recognition of this fact, several of his collaborators thought it appropriate to celebrate the occasion by organizing a symposium on topics broadly connected to his areas of interest and achievements. The meeting was a success in several senses: it was attended by over 35 people, there were 15 technical presentations describing new results, and, quite gratifyingly, we managed to spring the event as a complete surprise to Dale.}
}
@article{BGHLR-ic20,
publisher = {Elsevier Science Publishers},
journal = {Information and Computation},
author = {Brihaye, Thomas and Geeraerts, Gilles and Hallet, Marion and Le Roux, St{\'e}phane},
title = {On the termination of dynamics in sequential games},
volume = {272},
year = 2020,
doi = {10.1016/j.ic.2019.104505}
}
@inproceedings{Blanqui-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Blanqui, Fr{\'e}d{\'e}ric},
title = {Type safety of rewriting rules in dependent types},
doi = {10.4230/LIPIcs.FSCD.2020.13},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12335/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12335/}
}
@inproceedings{Genestier-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Genestier, Guillaume},
title = {Encoding {A}gda Programs using Rewriting},
doi = {10.4230/LIPIcs.FSCD.2020.31},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12353/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12353/}
}
@inproceedings{HB-fscd20,
address = {Paris, France},
month = jun,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Zena Ariola},
acronym = {{FSCD}'20},
booktitle = {{P}roceedings of the 5th International Conference on
Formal Structures for Computation and Deduction ({FSCD}'20)},
author = {Hondet, Gabriel and Blanqui, Fr{\'e}d{\'e}ric},
title = {The new rewriting engine of {D}edukti ({S}ystem {D}escription)},
pages = {35:1-35:16},
doi = {10.4230/LIPIcs.FSCD.2020.35},
year = 2020,
pdf = {https://drops.dagstuhl.de/opus/volltexte/2020/12357/},
url = {https://drops.dagstuhl.de/opus/volltexte/2020/12357/}
}
@article{JLDJ-compj20,
publisher = {Oxford University Press},
journal = {The Computer Journal},
author = {Jiang, Ying and Liu, Jian and Dowek, Gilles and Ji, Kailiang},
title = {Towards Combining Model Checking and Proof Checking},
volume = {62},
number = {9},
pages = {1365--1402},
year = 2020,
doi = {10.1093/comjnl/bxy112},
pdf = {https://hal.inria.fr/hal-01970274/file/sctl_paper.pdf}
}
@article{BBCDHH-jar20,
publisher = {Springer},
journal = {Journal of Automated Reasoning},
author = {Burel, Guillaume and Bury, Guillaume and Cauderlier, Raphaël and Delahaye, David and Halmagrand, Pierre and Hermant, Olivier},
title = {First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice},
volume = {64},
pages = {1001-1050},
year = 2020,
doi = {10.1007/s10817-019-09533-z},
pdf = {https://hal.archives-ouvertes.fr/hal-02305831/file/dmt-in-atp.pdf},
url = {https://hal.archives-ouvertes.fr/hal-02305831}
}
@inproceedings{BDFM-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Bednarczyk, Bartosz and Demri, St{\'e}phane and Fervari, Ra{\'u}l and Mansutti, Alessio},
title = {Modal Logics with Composition on Finite Forests: Expressivity and Complexity},
pages = {167--180},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BDFM-lics2020.pdf},
doi = {https://dl.acm.org/doi/10.1145/3373718.3394787}
}
@inproceedings{HM-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Herbelin, Hugo and Miquey, {\'E}tienne},
title = {A calculus of expandable stores. {C}ontinuation-and-environment-passing style translations},
pages = {564-577},
year = 2020,
optpdf = {},
url = {https://dl.acm.org/doi/10.1145/3373718.3394792},
optdoi = {}
}
@inproceedings{JKB-lics20,
address = {Saarbrucken, Germany},
month = jul,
publisher = {{IEEE} Press},
editor = {Kobayashi, Naoki},
acronym = {{LICS}'19},
booktitle = {{P}roceedings of the 35th {A}nnual {ACM\slash
IEEE} {S}ymposium on {L}ogic {I}n {C}omputer {S}cience ({LICS}'20)},
author = {Jacomme, Charlie and Kremer, Steve and Barthe, Gilles},
title = {Universal equivalence and majority on probabilistic programs over finite fields},
pages = {155-166},
year = 2020,
optpdf = {},
url = {https://dl.acm.org/doi/10.1145/3373718.3394746},
optdoi = {}
}
@inproceedings{BDM-ijcai20,
month = jul,
publisher = {IJCAI organization},
editor = {Bessi{\`e}re, Christian},
acronym = {{IJCAI}'20},
booktitle = {{P}roceedings of the 29th {I}nternational {J}oint
{C}onference on {A}rtificial {I}ntelligence
({IJCAI}'20)},
author = {Bednarczyk, Bartosz and Demri, St{\'e}phane and Mansutti, Alessio},
title = {A Framework for Reasoning about Dynamic Axioms in Description Logics},
optpages = {},
year = 2020,
optpdf = {},
url = {https://www.ijcai.org/Proceedings/2020/233},
optdoi = {}
}
@inproceedings{BD-ecai20,
address = {Santiago de Compostela, Spain},
month = sep,
optvolume = {??},
optseries = {Frontiers in Artificial Intelligence and Applications},
publisher = {{IOS} Press},
editor = {Lang, J{\'e}r{\^o}me and De Giacomo, Giuseppe and Barro and Sen{\'e}n Barro and O'Sullivan, Barry},
acronym = {{ECAI}'20},
booktitle = {{P}roceedings of the 24th {E}uropean {C}onference on
{A}rtificial {I}ntelligence ({ECAI}'20)},
author = {Belardinelli, Francesco and Demri, St{\'e}phane},
title = {Reasoning with a Bounded Number of Resources in ATL+},
pages = {624-631},
year = 2020,
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/BD-ecai2020.pdf},
url = {http://ebooks.iospress.nl/publication/54942},
doi = {10.3233/FAIA200147}
}
@inproceedings{DH-lata2020,
address = {Milan, Italy},
month = mar,
volume = {12038},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Alberto Leporati and
Carlos Mart{\'{\i}}n{-}Vide and
Dana Shapira and
Claudio Zandron},
acronym = {{LATA}'20},
booktitle = {{P}roceedings of the 14th {I}nternational {C}onference on {L}anguage
and {A}utomata {T}heory and {A}pplications ({LATA}'20)},
author = {Susanna Donatelli and Serge Haddad},
title = {Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models},
pages = {170-183},
year = 2020
}
@incollection{GHKNS-til2020,
volume = 53,
series = {Trends In Logic},
publisher = {Springer},
booktitle = {Well-Quasi Orders in Computation, Logic, Language and Reasoning},
editor = {Schuster, Peter M. and Seisenberger, Monika and Weiermann, Andreas},
author = {Jean Goubault{-}Larrecq and Simon Halfon and P. Karandikar and K. {Narayan Kumar} and {\relax Ph}ilippe Schnoebelen},
title = {The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings},
pages = {55-105},
year = 2020,
doi = {10.1007/978-3-030-30229-0_3}
}
@incollection{DSS-til2020,
volume = 53,
series = {Trends In Logic},
publisher = {Springer},
booktitle = {Well-Quasi Orders in Computation, Logic, Language and Reasoning},
editor = {Schuster, Peter M. and Seisenberger, Monika and Weiermann, Andreas},
author = {D{\v{z}}amonja, Mirna and Schmitz, Sylvain and Schnoebelen, {\relax Ph}ilippe},
title = {On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders},
pages = {2-54},
year = 2020,
doi = {10.1007/978-3-030-30229-0_2}
}
@article{JGL-tp2020,
publisher = {Auburn University},
journal = {Topology Proceedings},
author = {Goubault{-}Larrecq, Jean},
title = {$\Pi^0_2$ Subsets of Domain-Complete Spaces and Countably Correlated Spaces},
volume = {58},
pages = {13-22},
year = 2020,
note = {E-published on March 24, 2020.},
pdf = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/JGL-tp2020.pdf}
}
@inproceedings{KDHKSY-tacas2020,
address = {Dublin, Ireland},
month = apr,
volume = {12078},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Armin Biere and David Parker},
acronym = {{TACAS}'20},
booktitle = {{P}roceedings of the 26th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'20)},
author = {Juraj Kolc{\'a}k and J{\'e}r{'e}my Dubut and Ichiro Hasuo and Shin-Ya Katsumata and David Sprunger and Akihisa Yamada},
title = {Relational Differential Dynamic Logic},
pages = {191--208},
doi = {10.1007/978-3-030-45190-5_11},
year = 2020,
url = {https://doi.org/10.1007/978-3-030-45190-5_11}
}
@inproceedings{AGKR-tacas2020,
address = {Dublin, Ireland},
month = apr,
volume = {12078},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Armin Biere and David Parker},
acronym = {{TACAS}'20},
booktitle = {{P}roceedings of the 26th {I}nternational
{C}onference on {T}ools and {A}lgorithms for
{C}onstruction and {A}nalysis of {S}ystems
({TACAS}'20)},
author = {Akshay, S. and Gastin, Paul and Krishna, Shankara Narayanan and Roychoudhary, Sparsa},
title = {Revisiting Underapproximate Reachability for Multipushdown Systems},
pages = {387--404},
doi = {10.1007/978-3-030-45190-5_21},
year = 2020,
pdf = {https://arxiv.org/pdf/2002.05950.pdf},
url = {https://link.springer.com/chapter/10.1007/978-3-030-45190-5_21},
longurl = {https://arxiv.org/abs/2002.05950}
}
@inproceedings{Mansutti-fossacs20,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {Alessio Mansutti},
title = {An auxiliary logic on trees: on the {T}ower-hardness of
logics featuring reachability and submodel reasoning},
pages = {462--481},
doi = {10.1007/978-3-030-45231-5_24},
year = 2020
}
@inproceedings{FHK-fossacs2020,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {Alain Finkel and Serge Haddad and Igor Khmelnitsky},
title = {Minimal coverability tree construction made complete and efficient},
pages = {237--256},
doi = {10.1007/978-3-030-45231-5_13},
year = 2020
}
@inproceedings{BBLS-fossacs2020,
address = {Dublin, Ireland},
month = apr,
series = {Lecture Notes in Computer Science},
publisher = {Springer},
editor = {Barbara K{\"o}nig and Jean Goubault-Larrecq},
acronym = {{FoSSaCS}'20},
booktitle = {{P}roceedings of the 23rd {I}nternational
{C}onference on {F}oundations of {S}oftware {S}cience
and {C}omputation {S}tructures
({FoSSaCS}'20)},
author = {B{\'e}atrice B{\'e}rard and Benedikt Bollig and Mathieu Lehaut and Nathalie Sznajder},
title = {Parameterized Synthesis for Fragments of First-Order Logic over Data Words},
pages = {97--118},
doi = {10.1007/978-3-030-45231-5_6},
year = 2020
}
@inproceedings{BD-stacs2020,
address = {Montpellier, France},
month = mar,
series = {Leibniz International Proceedings in Informatics},
publisher = {Leibniz-Zentrum f{\"u}r Informatik},
editor = {Bl{\"a}ser, Markus and Paul, Christophe},
acronym = {{STACS}'20},
booktitle = {{P}roceedings of the 37th {A}nnual
{S}ymposium on {T}heoretical {A}spects of
{C}omputer {S}cience
({STACS}'20)},
author = {Berwanger, Dietmar and Doyen, Laurent},
title = {Observation and Distinction. Representing Information in Infinite Games},
pages = {48:1--48:17},
doi = {10.4230/LIPIcs.STACS.2020.48},
year = 2020
}
This file was generated by bibtex2html 1.98.