Publications : 2020

[Thi20]

F. Thiré. Meta-theory of Cumulative Types Systems and their embeddings to the ΛΠ-calculus modulo theory. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex | Web page | PDF ]

[Man20b]

A. Mansutti. Reasoning with Separation Logics: Complexity, Expressive Power, Proof Systems. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex | Web page | PDF ]

[Gen20a]

G. Genestier. Dependently-Typed Termination and Embedding of Extensional Universe-Polymorphic Type Theory using Rewriting. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2020.
[ BibTex ]

[HHSY20]

S. Haar, S. Haddad, S. Schwoon, and L. Ye. Active Prediction for Discrete Event Systems. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 48:1--48:16, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48.
[ BibTex | DOI | Web page | PDF ]

[BBM20]

N. Bertrand, P. Bouyer, and A. Majumdar. Synthesizing safe coalition strategies. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 39:1--39:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39.
[ BibTex | DOI | Web page | PDF ]

[GMS20]

P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability for updatable timed automata made faster and more effective. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, pages 47:1--47:17, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47.
[ BibTex | DOI | Web page | PDF ]

[AG20]

C. Aiswarya and P. Gastin. Weighted Tiling Systems for Graphs: Evaluation Complexity. In Proceedings of the 40th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'20), volume 182 of Leibniz International Proceedings in Informatics, Goa, India, December 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34.
[ BibTex | DOI | Web page | PDF ]

[For20]

M. Fortin. Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2020.
[ BibTex | Web page | PDF ]

[CJS20b]

H. Comon, C. Jacomme, and G. Scerri. Oracle simulation: a technique for protocol composition with long term shared secrets. In Proceedings of the 27th ACM Conference on Computer and Communications Security (CCS'20), pages 1427--1444, Orlando, USA, November 2020. ACM Press.
doi: 10.1145/3372297.3417229.
[ BibTex | DOI ]

[BCH20]

M. Boltenhagen, B. Chetioui, and L. Huber. Cost-Based Classification of Log Traces Using Machine-Learning. In Process Mining Workshops (ICPM'20), pages 136--148, Padua, Italy, October 2020. SPRINGER.
doi: https://doi.org/10.1007/978-3-030-72693-5_11.
[ BibTex | DOI | Web page | PDF ]

[FP20]

A. Finkel and M. Praveen. Verification of Flat FIFO Systems. Logical Methods in Computer Science, 20(4), October 2020.
doi: 10.23638/LMCS-16(4:4)2020.
[ BibTex | DOI | Web page ]

[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, pages 7:1--7:17, Freiburg, Germany, October 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.DISC.2020.7.
[ BibTex | DOI | Web page | PDF ]

[BKM⁺20]

P. Bouyer, O. Kupferman, N. Markey, B. Maubert, A. Murano, and G. Perelli. Reasoning About Quality and Fuzziness of Strategic Behaviours. In Proceedings of the 24th European Conference on Artificial Intelligence (ECAI'20), pages 2887--2888, Santiago de Compostela, Spain, September 2020. IOS Press.
doi: 10.3233/FAIA200437.
[ BibTex | DOI | Web page | PDF ]

[SBvdA20]

M. F. Sani, M. Boltenhagen, and W. M. van der Aalst. Prototype Selection using Clustering and Conformance Metrics for Process Discovery. In Business Process Management Workshops (BPM'20), Revised Selected Papers, volume 397 of Lecture Notes in Business Information Processing, pages 281--294, Sevilla, Spain, September 2020. Springer.
doi: https://doi.org/10.1007/978-3-030-66498-5_21.
[ BibTex | DOI | Web page | PDF ]

[KNR⁺20]

I. Khmelnitsky, D. Neider, R. Roy, B. Barbot, B. Bollig, A. Finkel, S. Haddad, M. Leucker, and L. Ye. Property-Directed Verification of Recurrent Neural Networks. Research Report 2009.10610, Computing Research Repository, September 2020.
[ BibTex | Web page | PDF ]

[HPS20]

S. Haar, L. Paulevé, and S. Schwoon. Drawing the Line: Basin Boundaries in Safe Petri Nets. In Proceedings of the 18th Conference on Computational Methods in System Biology (CMSB'20), volume 12314 of Lecture Notes in Bioinformatics, pages 321--336, held online, September 2020. Springer-Verlag.
doi: 10.1007/978-3-030-60327-4_17.
[ BibTex | DOI ]

[BBR⁺20]

P. Bouyer, T. Brihaye, M. Randour, C. Rivière, and P. Vandenhove. Decisiveness of Stochastic Systems and its Application to Hybrid Models. In Proceedings of the 11th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 149?165, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.10.
[ BibTex | DOI | 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), volume 326 of Electronic Proceedings in Theoretical Computer Science, page 33?49, Brussels, Belgium, September 2020.
doi: 10.4204/EPTCS.326.3.
[ BibTex | DOI | Web page | PDF ]

[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, pages 215--230, Vienna, Austria, September 2020. Springer.
[ BibTex | Web page ]

[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, pages 24:1--24:22, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.24.
[ BibTex | DOI | Web page ]

[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, pages 19:1--19:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2020.19.
[ BibTex | DOI | Web page ]

[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, pages 49:1--49:17, Vienna, Austria, September 2020. Leibniz-Zentrum für Informatik.
[ BibTex | Web page ]

[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), pages 624--631, Santiago de Compostela, Spain, September 2020. IOS Press.
doi: 10.3233/FAIA200147.
[ BibTex | DOI | Web page | PDF ]

[PKCH20]

L. Paulevé, J. Kolcák, T. Chatain, and S. Haar. Reconciling qualitative, abstract, and scalable modeling of biological networks. Nature Communications, 11(4256), August 2020.
doi: 10.1038/s41467-020-18112-5.
[ BibTex | DOI | Web page ]

[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, pages 29:1--29:14, Prague, Czech Republic, August 2020. Leibniz-Zentrum für Informatik.
doi: https://doi.org/10.4230/LIPIcs.MFCS.2020.29.
[ BibTex | DOI | Web page | PDF ]

[DD20]

A. Díaz-Caro and G. Dowek. Extensional proofs in a propositional logic modulo isomorphisms. Research Report 2002.03762v3, Computing Research Repository, July 2020.
[ BibTex | Web page | PDF ]

[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), pages 169--183, Boston, MA, USA, July 2020. IEEE Computer Society Press.
[ 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), pages 564--577, Saarbrucken, Germany, July 2020. IEEE Press.
[ BibTex | Web page ]

[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), pages 155--166, Saarbrucken, Germany, July 2020. IEEE Press.
[ BibTex | Web page ]

[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.
doi: 10.4230/LIPIcs.FSCD.2020.13.
[ BibTex | DOI | Web page | PDF ]

[Gen20b]

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.
doi: 10.4230/LIPIcs.FSCD.2020.31.
[ BibTex | DOI | Web page | PDF ]

[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, pages 35:1--35:16, Paris, France, June 2020. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2020.35.
[ BibTex | DOI | Web page | PDF ]

[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 ]

[Man20a]

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 ]

[FHK20b]

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 ]

[ADL20]

N. Alechina, S. Demri, and B. Logan. Parameterised Resource-Bounded ATL. In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI'20), pages 7040--7046. AAAI Press, February 2020.
doi: https://doi.org/10.1609/aaai.v34i05.6189.
[ BibTex | DOI | Web page ]

[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 ]

[CJS20a]

T. Chatain, R. Janicki, and N. Sidorova, editors. Proceedings of the 41st Conference on Petri Nets (PN'20), Paris, France, 2020. Springer.
[ BibTex | Web page ]

[JMS20]

L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri net unfoldings for test selection. Discrete Event Dynamic Systems: Theory and Applications, 30(3):441--464, 2020.
[ BibTex ]

[AMP20]

P. Arrighi, S. Martiel, and S. Perdrix. Reversible causal graph dynamics: invertibility, block representation, vertex-preservation. Natural Computing, 19(1):157--178, 2020.
doi: 10.1007/s11047-019-09768-0.
[ BibTex | DOI | Web page | PDF ]

[JFA20a]

J. Jerray, L. Fribourg, and É. André. Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples. Research Report 2006.09993, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]

[JFA20b]

J. Jerray, L. Fribourg, and É. André. Robust optimal control using dynamic programming and guaranteed Euler's method. Research Report 2007.13644, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]

[JF20]

J. Jerray and L. Fribourg. Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems. Research Report 2012.09310, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]

[Lop20]

A. Lopez. Preservation Theorems Through the Lens of Topology. Research Report 2007.07879, Computing Research Repository, 2020.
[ BibTex | Web page | PDF ]

[BCC20]

M. Boltenhagen, T. Chatain, and J. Carmona. Model-based trace variant analysis of event logs. Information Systems, 2020. To appear.
doi: https://doi.org/10.1016/j.is.2020.101675.
[ BibTex | DOI | Web page ]

[BM20]

B. Barras and V. Maestracci. Implementation of Two Layers Type Theory in Dedukti and Application to Cubical Type Theory. In Proceedings of the 15th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'20), pages 54--67, Paris, France, 2020. ACM Press.
doi: 10.4204/EPTCS.332.4.
[ BibTex | DOI | Web page | PDF ]

[Fin20]

A. Finkel. From Well Structured Transition Systems to Program Verification. In Proceedings of 8th International Workshop on Verification and Program Transformation and 7th Workshop on Horn Clauses for Verification and Synthesis (VPT/HCVS@ETAPS 2020), pages 44--49, Dublin, Ireland, 2020. Electronic Proceedings in Theoretical Computer Science.
doi: 10.4204/EPTCS.320.3.
[ BibTex | DOI | Web page | PDF ]

[LR20]

S. Le Roux. Time-Aware Uniformization of Winning Strategies. In Proceedings of the 16th Conference on Computability in Europe (CiE 2020), volume 12098 of Lecture Notes in Computer Science, pages 193--204, Fisciano, Italy, 2020. Springer-Verlag.
doi: https://doi.org/10.1007/978-3-030-51466-2_17.
[ BibTex | DOI | Web page | PDF ]

[GMG20]

P. Gastin, A. Manuel, and R. Govind. Reversible Regular Languages: Logical and Algebraic Characterisations. Fundamenta Informaticae, 2020. To appear.
[ BibTex ]

[FHK20a]

A. Finkel, S. Haddad, and I. Khmelnitsky. Commodification of accelerations for the Karp and Miller Construction. Discrete Event Dynamic Systems: Theory and Applications, 2020.
doi: 10.1007/s10626-020-00331-z.
[ BibTex | DOI | Web page ]

[BHL20]

N. Bertrand, S. Haddad, and E. Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems: Theory and Applications, 30:695–723, 2020.
doi: 10.1007/s10626-020-00320-2.
[ BibTex | DOI | Web page ]

[FG20]

A. Finkel and J. Goubault-Larrecq. Forward analysis for WSTS, part I: completions. Mathematical Structures in Computer Science, 30(7):752--832, 2020.
doi: 10.1017/S0960129520000195.
[ BibTex | DOI | Web page | PDF ]

[GK20]

J. Goubault-Larrecq and B. König, editors. Proceedings of the 23rd Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), Dublin, Ireland, 2020. Springer.
[ BibTex | Web page ]

[BJO20]

F. Blanqui, J. Jouannaud, and M. Okada. Corrigendum to Inductive-data-type systems [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]. Theoretical Computer Science, 817:81--82, 2020.
doi: 10.1016/j.tcs.2018.01.010.
[ BibTex | DOI | Web page ]

[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.
[ BibTex | Web page | PDF ]

[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, pages 22--53, 2020.
doi: 10.1016/j.jcss.2020.06.006.
[ BibTex | DOI | PDF ]

[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 ]

[LRP20]

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, 67(10):3562--3573, 2020.
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, 282:257--264, 2020.
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 ]

[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, 62(9):1365--1402, 2020.
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, 64:1001--1050, 2020.
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. Π⁰₂ 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.