Publications : 2020

[CFH+20]
D. Cho, M. Függer, C. Hopper, M. Kushwaha, T. Nowak, and Q. Soubeyran. Distributed Computation with Continual Population Growth. In Proceedings of the 34th International Symposium on Distributed Computing (DISC'20), Leibniz International Proceedings in Informatics, Freiburg, Germany, October 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex | Web page | PDF ]
[BBB+20]
B. Bérard, B. Bollig, P. Bouyer, M. Függer, and N. Sznajder. Synthesis in Presence of Dynamic Links. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Electronic Proceedings in Theoretical Computer Science, Brussels, Belgium, September 2020. To appear.
BibTex ]
[DH20b]
S. Donatelli and S. Haddad. Guarded Autonomous Transitions Increase Conciseness and Expressiveness of Timed Automata. In Proceedings of the 18th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'20), Lecture Notes in Computer Science, Vienna, Austria, September 2020. Springer. To appear.
BibTex ]
[BLRO+20]
P. Bouyer, S. Le Roux, Y. Oualhadj, M. Randour, and P. Vandenhove. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[AGSW20]
B. Adsul, P. Gastin, S. Sarkar, and P. Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[BFS20]
B. Bollig, A. Finkel, and A. Suresh. Bounded Reachability Problems are Decidable in FIFO Machines. In Proceedings of the 31st International Conference on Concurrency Theory (CONCUR'20), volume 171 of Leibniz International Proceedings in Informatics, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[BD20a]
F. Belardinelli and S. Demri. Reasoning with a Bounded Number of Resources in ATL+. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), Santiago de Compostela, Spain, September 2020. IOS Press. To appear.
BibTex | PDF ]
[DTFG20]
G. Douéneau-Tabot, E. Filiot, and P. Gastin. Register transducers are marble transducers. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS'20), volume 170 of Leibniz International Proceedings in Informatics, Prague, Czech Republic, August 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[BDM20a]
D. Baelde, S. Delaune, and S. Moreau. A Method for Proving Unlinkability of Stateful Protocols. In Proceedings of the 33rd IEEE Computer Security Foundations Symposium (CSF'20), Boston, MA, USA, July 2020. IEEE Computer Society Press. To appear.
BibTex | Web page ]
[BDFM20]
B. Bednarczyk, S. Demri, R. Fervari, and A. Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), pages 167--180, Saarbrucken, Germany, July 2020. IEEE Press.
doi: https://dl.acm.org/doi/10.1145/3373718.3394787.
BibTex | DOI | PDF ]
[HM20]
H. Herbelin and É. Miquey. A calculus of expandable stores. Continuation-and-environment-passing style translations. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), Saarbrucken, Germany, July 2020. IEEE Press. To appear.
BibTex ]
[JKB20]
C. Jacomme, S. Kremer, and G. Barthe. Universal equivalence and majority on probabilistic programs over finite fields. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'20), Saarbrucken, Germany, July 2020. IEEE Press. To appear.
BibTex ]
[BDM20b]
B. Bednarczyk, S. Demri, and A. Mansutti. A Framework for Reasoning about Dynamic Axioms in Description Logics. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI'20). IJCAI organization, July 2020.
BibTex | Web page ]
[HK20]
S. Haddad and I. Khmelnitsky. Dynamic Recursive Petri Nets. In Proceedings of the 41st International Conference on Applications and Theory of Petri Nets (PETRI NETS'20), volume 12152 of Lecture Notes in Computer Science, pages 345--366, Paris, France, June 2020. Springer.
doi: 10.1007/978-3-030-51831-8_17.
BibTex | DOI | Web page ]
[Bla20]
F. Blanqui. Type safety of rewriting rules in dependent types. In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, Paris, France, June 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[Gen20]
G. Genestier. Encoding Agda Programs using Rewriting. In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, Paris, France, June 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[HB20]
G. Hondet and F. Blanqui. The new rewriting engine of Dedukti (System Description). In Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction (FSCD'20), Leibniz International Proceedings in Informatics, Paris, France, June 2020. Leibniz-Zentrum für Informatik. To appear.
BibTex ]
[CFLS20]
S. Carpov, C. Fontaine, D. Ligier, and R. Sirdey. Illuminating the Dark or how to recover what should not be seen in FE-based classifiers. 2020:1--35, May 2020.
doi: 10.2478/popets-2020-0015.
BibTex | DOI | Web page ]
[BFL+20]
J. Bund, M. Függer, C. Lenzen, M. Medina, and W. Rosenbaum. PALS: Plesiochronous and Locally Synchronous Systems. In Proceedings of the 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'20), Publication only, May 2020. IEEE Computer Society.
BibTex | PDF ]
[KDH+20]
J. Kolcák, J. Dubut, I. Hasuo, S.-Y. Katsumata, D. Sprunger, and A. Yamada. Relational Differential Dynamic Logic. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 191--208, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_11.
BibTex | DOI | Web page ]
[AGKR20]
S. Akshay, P. Gastin, S. N. Krishna, and S. Roychoudhary. Revisiting Underapproximate Reachability for Multipushdown Systems. In Proceedings of the 26th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'20), volume 12078 of Lecture Notes in Computer Science, pages 387--404, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45190-5_21.
BibTex | DOI | Web page | PDF ]
[Man20]
A. Mansutti. An auxiliary logic on trees: on the Tower-hardness of logics featuring reachability and submodel reasoning. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 462--481, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_24.
BibTex | DOI ]
[FHK20]
A. Finkel, S. Haddad, and I. Khmelnitsky. Minimal coverability tree construction made complete and efficient. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 237--256, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_13.
BibTex | DOI ]
[BBLS20]
B. Bérard, B. Bollig, M. Lehaut, and N. Sznajder. Parameterized Synthesis for Fragments of First-Order Logic over Data Words. In Proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Lecture Notes in Computer Science, pages 97--118, Dublin, Ireland, April 2020. Springer.
doi: 10.1007/978-3-030-45231-5_6.
BibTex | DOI ]
[AVL+20]
N. Alexopoulos, E. Vasilomanolakis, S. Le Roux, S. Rowe, and M. Mühlhäuser. TRIDEnT: Towards a Decentralized Threat Indicator Marketplace. In Proceedings of the 35th ACM/SIGAPP Symposium on Applied Computing (SAC'20), pages 332--341, Brno, Czech Republic, March 2020. ACM Press.
doi: 10.1145/3341105.3374020.
BibTex | DOI | Web page ]
[DH20a]
S. Donatelli and S. Haddad. Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models. In Proceedings of the 14th International Conference on Language and Automata Theory and Applications (LATA'20), volume 12038 of Lecture Notes in Computer Science, pages 170--183, Milan, Italy, March 2020. Springer.
BibTex ]
[BD20b]
D. Berwanger and L. Doyen. Observation and Distinction. Representing Information in Infinite Games. In Proceedings of the 37th Annual Symposium on Theoretical Aspects of Computer Science (STACS'20), Leibniz International Proceedings in Informatics, pages 48:1--48:17, Montpellier, France, March 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2020.48.
BibTex | DOI ]
[GM20]
J. Goubault-Larrecq and F. Mynard. Convergence without Points. Houston Journal of Mathematics, 46(1):227--282, 2020.
BibTex | PDF ]
[DLM20]
S. Demri, É. Lozes, and A. Mansutti. Internal Calculi for Separation Logics. In Proceedings of the 28th Annual EACSL Conference on Computer Science Logic (CSL'20), Leibniz International Proceedings in Informatics, Barcelona, Spain, January 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2020.19.
BibTex | DOI | Web page ]
[CHK+20]
Th. Chatain, S. Haar, J. Kolcák, L. Paulevé, and A. Thakkar. Concurrency in Boolean networks. Natural Computing, 19:91--109, 2020.
BibTex | Web page | PDF ]
[GBM20]
P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. Theory of Computing Systems, 64(3), 2020.
BibTex | Web page | PDF ]
[BFG20a]
M. Blondin, A. Finkel, and J. Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. Logical Methods in Computer Science, 16(2), 2020.
doi: 10.23638/LMCS-16(2:13)2020.
BibTex | DOI | Web page ]
[DGK20]
V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. Information and Computation, 2020. To appear.
BibTex ]
[BFG20b]
B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic. Journal of Computer and System Sciences, 2020. To appear.
BibTex ]
[Gou20b]
J. Goubault-Larrecq. Some Topological Properties of Spaces of Lipschitz Continuous Maps on Quasi-Metric Spaces. Topology and its Applications, 282, 2020.
doi: 10.1016/j.topol.2020.107281.
BibTex | DOI | Web page ]
[LRP20b]
S. Le Roux and A. Pauly. A Semi-Potential for Finite and Infinite Games in Extensive Form. Dynamic Games and Applications, 10(1):120--144, 2020.
doi: 10.1007/s13235-019-00301-7.
BibTex | DOI | Web page ]
[BFLM20]
J. Bund, M. Függer, C. Lenzen, and M. Medina. Synchronizer-free Digital Link Controller. IEEE Transactions on Circuits and Systems I, 2020. To appear.
doi: 10.1109/TCSI.2020.2989552.
BibTex | DOI | Web page ]
[FKN20]
M. Függer, M. Kushwaha, and T. Nowak. Digital Circuit Design for Biological and Silicon Computers. In Advances in Synthetic Biology. Springer, 2020. To appear.
BibTex ]
[FNW20]
M. Függer, T. Nowak, and K. Winkler. On the radius of nonsplit graphs and information dissemination in dynamic networks. Discrete Applied Mathematics, 2020. To appear.
doi: 10.1016/j.dam.2020.02.013.
BibTex | DOI | Web page ]
[ABF20]
P. Arrighi, C. Bény, and T. Farrelly. A quantum cellular automaton for one-dimensional QED. Quantum Information Processing, 19(88), 2020.
doi: 10.1007/s11128-019-2555-4.
BibTex | DOI | Web page ]
[MA20]
G. D. Molfetta and P. Arrighi. A quantum walk with both a continuous-time limit and a continuous-spacetime limit. Quantum Information Processing, 19(47), 2020.
doi: 10.1007/s11128-019-2549-2.
BibTex | DOI | Web page ]
[BFNS20]
D. Baelde, A. P. Felty, G. Nadathur, and A. Saurin. A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday. Mathematical Structures in Computer Science, 29(8):1007--1008, 2020.
doi: 10.1017/S0960129519000136.
BibTex | DOI ]
[LRP20a]
S. Le Roux and A. Pauly. Equilibria in multi-player multi-outcome infinite sequential games. Information and Computation, 2020. To appear.
BibTex ]
[BGHLR20]
T. Brihaye, G. Geeraerts, M. Hallet, and S. Le Roux. On the termination of dynamics in sequential games. Information and Computation, 272, 2020.
doi: 10.1016/j.ic.2019.104505.
BibTex | DOI ]
[JLDJ20]
Y. Jiang, J. Liu, G. Dowek, and K. Ji. Towards Combining Model Checking and Proof Checking. The Computer Journal, 2020. To appear.
doi: 10.1093/comjnl/bxy112.
BibTex | DOI | PDF ]
[BBC+20]
G. Burel, G. Bury, R. Cauderlier, D. Delahaye, P. Halmagrand, and O. Hermant. First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice. Journal of Automated Reasoning, 2020. To appear.
doi: 10.1007/s10817-019-09533-z.
BibTex | DOI | Web page | PDF ]
[GHK+20]
J. Goubault-Larrecq, S. Halfon, P. Karandikar, K. Narayan Kumar, and Ph. Schnoebelen. The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 55--105. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_3.
BibTex | DOI ]
[DSS20]
M. Džamonja, S. Schmitz, and Ph. Schnoebelen. On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders. In Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends In Logic, pages 2--54. Springer, 2020.
doi: 10.1007/978-3-030-30229-0_2.
BibTex | DOI ]
[Gou20a]
J. Goubault-Larrecq. Π02 Subsets of Domain-Complete Spaces and Countably Correlated Spaces. Topology Proceedings, 58:13--22, 2020. E-published on March 24, 2020.
BibTex | PDF ]

This file was generated by bibtex2html 1.98.

About LSV