Publications : 2019

[BHL19]
N. Bertrand, S. Haddad, and E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Information and Computation, 269, December 2019.
doi: 10.1016/j.ic.2019.104441.
BibTex | DOI | PDF ]
[GF19]
E. Gupta and A. Finkel. The well structured problem for Presburger counter machines. In Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, pages 41:1--41:15, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2019.41.
BibTex | DOI | Web page | PDF ]
[BBM19a]
N. Bertrand, P. Bouyer, and A. Majumdar. Concurrent parameterized games. In Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, pages 31:1--31:15, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2019.31.
BibTex | DOI | Web page | PDF ]
[Man19]
H. Mandon. Algorithms for Cell Reprogramming Strategies in Boolean Networks. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, December 2019.
BibTex | Web page | PDF ]
[LF19a]
A. Le Coënt and L. Fribourg. Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. In Proceedings of the 58th IEEE Conference on Decision and Control (CDC'19), pages 599--604, Nice, France, December 2019. IEEE Control System Society.
doi: 10.1109/CDC40024.2019.9029376.
BibTex | DOI | Web page | PDF ]
[CG19]
A. Chattopadhyay and P. Gastin, editors. Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'19), Leibniz International Proceedings in Informatics, Bombay, India, December 2019. Leibniz-Zentrum für Informatik.
BibTex | Web page ]
[Gon19]
M. González. Stochastic Games on Graphs with Applications to Smart-Grids Optimization. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2019.
BibTex | Web page | PDF ]
[FHK19b]
A. Finkel, S. Haddad, and I. Khmelnitsky. Réification des accélérations pour la construction de Karp et Miller. In Actes du 12ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'19), Angers, France, November 2019. HAL.
BibTex | Web page | PDF ]
[DH19b]
S. Donatelli and S. Haddad. Autonomous Transitions Enhance CSLTA Expressiveness and Conciseness. Research Report hal-02306021, HAL, October 2019. 23 pages.
BibTex | Web page | PDF ]
[Sao19]
A. Saoud. Compositional and Efficient Controller Synthesis for Cyber-Physical Systems. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, October 2019.
BibTex | Web page | PDF ]
[LF19b]
A. Le Coënt and L. Fribourg. Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction. In 9th International Workshop on Cyber Physical Systems (CyPhy'19) and 15th International Workshop on Model-Based Design (WESE'19), Revised Selected Papers, volume 11971 of Lecture Notes in Computer Science, pages 181--202, New York City, NY, USA, October 2019. Springer.
doi: 10.1007/978-3-030-41131-2_9.
BibTex | DOI | Web page ]
[Bou19a]
P. Bouyer. A Note on Game Theory and Verification (Invited Talk). In Proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis (ATVA'19), volume 11781 of Lecture Notes in Computer Science, pages 3--22, Taipei, Taiwan, October 2019. Springer.
doi: 10.1007/978-3-030-31784-3_1.
BibTex | DOI ]
[Bou19b]
P. Bouyer. On the Computation of Nash Equilibria in Games on Graphs (Invited Talk). In Proceedings of the 26th International Symposium on Temporal Representation and Reasoning (TIME'19), Leibniz International Proceedings in Informatics, pages 3:1--3:3, Málaga, Spain, October 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TIME.2019.3.
BibTex | DOI ]
[MSH+19]
H. Mandon, C. Su, S. Haar, J. Pang, and L. Paulevé. Sequential Reprogramming of Boolean Networks Made Practical. In Proceedings of the 17th Conference on Computational Methods in System Biology (CMSB'19), volume 11773 of Lecture Notes in Bioinformatics, pages 3--19, Trieste, Italy, September 2019. Springer-Verlag.
doi: 10.1007/978-3-030-31304-3_1.
BibTex | DOI ]
[SZ19]
S. Schmitz and G. Zetzsche. Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. In Proceedings of the 13th Workshop on Reachability Problems in Computational Models (RP'19), volume 11674 of Lecture Notes in Computer Science, pages 193--201, Brussels, Belgium, September 2019. Springer.
doi: 10.1007/978-3-030-30806-3_15.
BibTex | DOI | Web page | PDF ]
[DT19]
G. Douéneau-Tabot. Register Models for Pebble Transducers and Applications to Optimization. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
BibTex ]
[Gri19]
E. Grienenberger. Concept alignment in Logipedia - Alignement of logical connectives between HOL Light and Dedukti. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
BibTex ]
[Lop19]
A. Lopez. Théorèmes de préservation. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
BibTex ]
[Sur19]
A. Suresh. Termination, boundedness and reachability for input-bounded FIFO Machines. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2019.
BibTex ]
[Jaz19]
S. Jaziri. Automata on Timed Structures. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2019.
BibTex | Web page | PDF ]
[Kou19c]
A. Koutsos. Preuves symboliques de propriétés d'indistinguabilité calculatoire. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2019.
BibTex | Web page | PDF ]
[BCC19a]
M. Boltenhagen, T. Chatain, and J. Carmona. Encoding Conformance Checking Artefacts in SAT. In Business Process Management Workshops (BPM'19), Revised Selected Papers, volume 362 of Lecture Notes in Business Information Processing, pages 160--171, Vienna, Austria, September 2019. Springer.
doi: 10.1007/978-3-030-37453-2_14.
BibTex | DOI | Web page | PDF ]
[EHBB19]
M. El Haddad, G. Burel, and F. Blanqui. Ekstrakto: A tool to reconstruct Dedukti proofs from TSTP files (extended abstract). In Proceedings of the 6th Workshop on Proof eXchange for Theorem Proving (PxTP'19), volume 301 of Electronic Proceedings in Theoretical Computer Science, pages 27--35, Natal, Brazil, August 2019.
BibTex | Web page | PDF ]
[GMG19]
P. Gastin, A. Manuel, and R. Govind. Logics for Reversible Regular Languages and Semigroups with Involution. In Proceedings of the 23th International Conference on Developments in Language Theory (DLT'19), volume 11647 of Lecture Notes in Computer Science, pages 182--191, Warsaw, Poland, August 2019. Springer.
doi: 10.1007/978-3-030-24886-4_13.
BibTex | DOI | Web page | PDF ]
[DG19]
M. Droste and P. Gastin. Aperiodic Weighted Automata and Weighted First-Order Logic. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 76:1--76:15, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.76.
BibTex | DOI | Web page | PDF ]
[BT19]
P. Bouyer and N. Thomasset. Nash equilibria in games over graphs equipped with a communication mechanism. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'19), volume 138 of Leibniz International Proceedings in Informatics, pages 9:1--9:14, Aachen, Germany, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2019.9.
BibTex | DOI | Web page | PDF ]
[BBM19b]
N. Bertrand, P. Bouyer, and A. Majumdar. Reconfiguration and message losses in parameterized broadcast networks. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19), volume 140 of Leibniz International Proceedings in Informatics, pages 32:1--32:15, Amsterdam, The Netherlands, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2019.32.
BibTex | DOI | Web page | PDF ]
[FP19]
A. Finkel and M. Praveen. Verification of Flat FIFO Systems. In Proceedings of the 30th International Conference on Concurrency Theory (CONCUR'19), volume 140 of Leibniz International Proceedings in Informatics, pages 12:1--12:17, Amsterdam, The Netherlands, August 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2019.12.
BibTex | DOI | Web page | PDF ]
[DFKN19]
J. Danger, L. Fribourg, U. Kühne, and M. Naceur. LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. In Proceedings of the 22nd Euromicro Conference on Digital System Design (DSD'19), pages 269--276, Kallithea, Greece, August 2019. IEEE Press.
doi: 10.1109/DSD.2019.00047.
BibTex | DOI | Web page ]
[Kou19b]
A. Koutsos. Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. In Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF'19), pages 48--61, Hoboken, NJ, USA, July 2019. IEEE Computer Society Press.
doi: 10.1109/CSF.2019.00011.
BibTex | DOI | PDF ]
[GMS19]
P. Gastin, S. Mukherjee, and B. Srivathsan. Fast algorithms for handling diagonal constraints in timed automata. In Proceedings of the 31st International Conference on Computer Aided Verification (CAV'19), volume 11561 of Lecture Notes in Computer Science, pages 41--59, New York, USA, July 2019. Springer.
doi: 10.1007/978-3-030-25540-4_3.
BibTex | DOI | Web page | PDF ]
[BKM+19]
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 28th International Joint Conference on Artificial Intelligence (IJCAI'19), pages 1588--1594. IJCAI organization, July 2019.
doi: 10.24963/ijcai.2019/220.
BibTex | DOI | Web page | PDF ]
[Sch19]
S. Schmitz. The Parametric Complexity of Lossy Counter Machines. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 129:1--129:15, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.129.
BibTex | DOI | Web page | PDF ]
[For19]
M. Fortin. FO = FO3 for linear orders with monotone binary relations. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 116:1--116:13, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.116.
BibTex | DOI | Web page | PDF ]
[BGJ+19]
G. Barthe, B. Grégoire, C. Jacomme, S. Kremer, and P.-Y. Strub. Symbolic methods in computational cryptography proofs. In Proceedings of the 32nd IEEE Computer Security Foundations Symposium (CSF'19), pages 136--151, Hoboken, NJ, USA, July 2019. IEEE Computer Society Press.
doi: 10.1109/CSF.2019.00017.
BibTex | DOI | Web page | PDF ]
[Lic19]
A. Lick. XPath-like Query Logics: Proof Systems and Real-World Applicability. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, July 2019.
BibTex | Web page | PDF ]
[ÖMFS19]
D. Öhlinger, J. Maier, M. Függer, and U. Schmid. The Involution Tool for Accurate Digital Timingand Power Analysis. In Proceedings of the 29th International Symposium on Power and Timing Modeling, Optimization and Simulation (PATMOS'19), pages 1--8, Rhodes, Greece, July 2019. IEEE Press.
doi: 10.1109/PATMOS.2019.8862165.
BibTex | DOI | Web page ]
[BLS19]
D. Baelde, A. Lick, and S. Schmitz. Decidable XPath Fragments in the Real World. In Proceedings of the 38th Annual ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'19), pages 285--302, Amsterdam, Netherlands, June-July 2019. ACM Press.
doi: 10.1145/3294052.3319685.
BibTex | DOI | Web page ]
[Gen19]
G. Genestier. SizeChangeTool: A Termination Checker for Rewriting Dependent Types. In Proceedings of the 10th International Workshop on Higher-Order Rewriting (HOR'19), pages 14--19, Dortmund, Germany, June 2019.
BibTex | PDF ]
[dBGJL19]
M. de Brecht, J. Goubault-Larrecq, X. Jia, and Z. Lyu. Domain-complete and LCS-complete Spaces. In Proceedings of the International Symposium on Domain Theory (ISDT'19), volume 345 of Electronic Notes in Theoretical Computer Science, pages 3--35, Yangzhou, China, June 2019. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2019.07.014.
BibTex | DOI ]
[GJ19]
J. Goubault-Larrecq and X. Jia. Algebras of the Extended Probabilistic Powerdomain Monad. In Proceedings of the International Symposium on Domain Theory (ISDT'19), volume 345 of Electronic Notes in Theoretical Computer Science, pages 37--61, Yangzhou, China, June 2019. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2019.07.015.
BibTex | DOI ]
[BGH19]
F. Blanqui, G. Genestier, and O. Hermant. Dependency Pairs Termination in Dependent Type Theory Modulo Rewriting. In Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction (FSCD'19), volume 131 of Leibniz International Proceedings in Informatics, pages 9:1--9:21, Dortmund, Germany, June 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2019.9.
BibTex | DOI | Web page | PDF ]
[DD19]
A. Díaz-Caro and G. Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions. In Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction (FSCD'19), volume 131 of Leibniz International Proceedings in Informatics, pages 14:1--14:23, Dortmund, Germany, June 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSCD.2019.14.
BibTex | DOI | Web page | PDF ]
[Gas19]
P. Gastin. Modular Descriptions of Regular Functions. In Proceedings of the 8th International Conference on Algebraic Informatics (CAI'19), volume 11545 of Lecture Notes in Computer Science, pages 3--9, Nis, Serbia, June 2019. Springer. Invited talk.
doi: 10.1007/978-3-030-21363-3_1.
BibTex | DOI | PDF ]
[Kou19a]
A. Koutsos. The 5G-AKA Authentication Protocol Privacy. In Proceedings of the 4th IEEE European Symposium on Security and Privacy (EuroS&P'19), pages 464--479, Stockholm, Sweden, June 2019. IEEE Press.
doi: 10.1109/EuroSP.2019.00041.
BibTex | DOI | PDF ]
[BCC19b]
M. Boltenhagen, T. Chatain, and J. Carmona. Generalized Alignment-Based Trace Clustering of Process Behavior. In Proceedings of the 40th International Conference on Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, pages 237--257, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2_14.
BibTex | DOI | Web page | PDF ]
[BD19b]
F. Belardinelli and S. Demri. Resource-bounded ATL: the Quest for Tractable Fragments. In Proceedings of the 18th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'19), pages 206--214, Montreal, Canada, June 2019. ACM Press.
BibTex | Web page | PDF ]
[DFM19]
S. Demri, R. Fervari, and A. Mansutti. Axiomatising logics with separating conjunctions and modalities. In Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA'19), volume 11468 of Lecture Notes in Artificial Intelligence, pages 692--708, Rende, Italy, June 2019. Springer.
doi: 10.1007/978-3-030-19570-0_45.
BibTex | DOI | Web page | PDF ]
[FHK19a]
A. Finkel, S. Haddad, and I. Khmelnitsky. Coverability and Termination in Recursive Petri Nets. In Proceedings of the 40th International Conference on Applications and Theory of Petri Nets (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, pages 429--448, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2_23.
BibTex | DOI | Web page | PDF ]
[Gou19c]
J. Goubault-Larrecq. A Probabilistic and Non-Deterministic Call-by-Push-Value Language. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785809.
BibTex | DOI ]
[AGJK19]
S. Akshay, P. Gastin, V. Jugé, and S. N. Krishna. Timed systems through the lens of logic. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785684.
BibTex | DOI | Web page | PDF ]
[BD19a]
B. Bednarczyk and S. Demri. Why propositional quantification makes modal logics on trees robustly hard ? In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785656.
BibTex | DOI | PDF ]
[CD19]
K. Chatterjee and L. Doyen. Graph Planning with Expected Finite Horizon. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785706.
BibTex | DOI ]
[LS19b]
J. Leroux and S. Schmitz. Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--13, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785796.
BibTex | DOI | Web page ]
[JS19]
P. Jančar and S. Schmitz. Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete. In Proceedings of the 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), pages 1--12, Vancouver, Canada, June 2019. IEEE Press.
doi: 10.1109/LICS.2019.8785848.
BibTex | DOI | Web page ]
[ZSGF19]
D. Zonetti, A. Saoud, A. Girard, and L. Fribourg. A symbolic approach to voltage stability and power sharing in time-varyingDC microgrids. In Proceedings of the 18th European Control Conference (ECC'19), pages 903--909, Naples, Italy, June 2019. IEEE Press.
doi: 10.23919/ECC.2019.8796095.
BibTex | DOI | Web page ]
[ACF+19]
É. André, E. Coquard, L. Fribourg, J. Jerray, and D. Lesens. Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints. In Proceedings of the 19th International Conference on Application of Concurrency to System Design (ACSD'19), pages 13--22, Aachen, Germany, June 2019. IEEE Computer Society Press.
doi: 10.1109/ACSD.2019.00006.
BibTex | DOI | Web page ]
[DH19a]
S. Donatelli and S. Haar, editors. Proceedings of the 40th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS'19), volume 11522 of Lecture Notes in Computer Science, Aachen, Germany, June 2019. Springer.
doi: 10.1007/978-3-030-21571-2.
BibTex | DOI | Web page ]
[MFNS19]
J. Maier, M. Függer, T. Nowak, and U. Schmid. Transistor-Level Analysis of Dynamic Delay Models. In Proceedings of the 25th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'19), pages 76--85, Hirosaki, Japan, May 2019. IEEE Computer Society.
doi: 10.1109/ASYNC.2019.00019.
BibTex | DOI ]
[Bur19]
G. Bury. Integrating rewriting, tableau and superposition into SMT. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, May 2019.
BibTex | Web page | PDF ]
[KS19]
P. Karandikar and Ph. Schnoebelen. The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods in Computer Science, 15(2):6:1--6:27, April 2019.
BibTex | Web page | PDF ]
[BBR19]
B. Bollig, P. Bouyer, and F. Reiter. Identifiers in Registers - Describing Network Algorithms with Logic. In Proceedings of the 22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'19), volume 11425 of Lecture Notes in Computer Science, pages 115--132, Prague, Czech Republic, April 2019. Springer.
doi: 10.1007/978-3-030-17127-8.
BibTex | DOI | Web page | PDF ]
[CLS19]
S. Colin, R. Lepigre, and G. Scherer. Unboxing Mutually Recursive Type Definitions. In Actes des 30èmes Journées Francophones sur les Langages Applicatifs (JFLA'19), Lamoura, France, January 2019. To appear.
BibTex | PDF ]
[AFMS19]
É. André, L. Fribourg, J.-M. Mota, and R. Soulat. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 409--424, Cascais/Lisbon, Portugal, January 2019. Springer.
BibTex | PDF ]
[HKP19]
S. Haar, J. Kolcák, and L. Paulevé. Combining Refinement of Parametric Models with Goal-Oriented Reduction of Dynamics. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 555--576, Cascais/Lisbon, Portugal, January 2019. Springer.
BibTex | Web page | PDF ]
[Gou19d]
J. Goubault-Larrecq. A semantics for nabla. Mathematical Structures in Computer Science, 29:1250--1274, 2019.
doi: 10.1017/S0960129518000063.
BibTex | DOI | Web page ]
[KŠHP19]
J. Kolcák, D. Šafránek, S. Haar, and L. Paulevé. Parameter Space Abstraction and Unfolding Semantics of Discrete Regulatory Networks. Theoretical Computer Science, 765:120--144, 2019.
doi: 10.1016/j.tcs.2018.03.009.
BibTex | DOI | Web page | PDF ]
[Gou19a]
J. Goubault-Larrecq. Fooling the Parallel or Tester with Probability 8/27. In The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy---Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday, volume 11760 of Lecture Notes in Computer Science, pages 313--328. Springer, 2019. Updated version on arXiv:1903.12653.
BibTex | Web page ]
[BQS19]
B. Bollig, K. Quaas, and A. Sangnier. The Complexity of Flat Freeze LTL. Logical Methods in Computer Science, 15(3):32:1--32:26, 2019.
doi: 10.23638/LMCS-15(3:32)2019.
BibTex | DOI | Web page | PDF ]
[DF19]
S. Demri and R. Fervari. The power of modal separation logics. Journal of Logic and Computation, 29(8):1139--1184, 2019.
BibTex | PDF ]
[Gou19b]
J. Goubault-Larrecq. Formal Ball Monads. Topology and its Applications, 263:372--391, 2019.
doi: 10.1016/j.topol.2019.06.044.
BibTex | DOI | Web page ]
[HBD19]
L. Hirschi, D. Baelde, and S. Delaune. A method for unbounded verification of privacy-type properties. Journal of Computer Security, 27(3):277--342, 2019.
doi: 10.3233/JCS-171070.
BibTex | DOI | Web page | PDF ]
[MSP+19]
H. Mandon, C. Su, J. Pang, S. Paul, S. Haar, and L. Paulevé. Algorithms for the Sequential Reprogramming of Boolean Networks. IEEE/ACM Transaction on Computational Biology and Bioinformatics, 16(5):1610--1619, 2019.
BibTex | Web page | PDF ]
[HS19]
S. Halfon and Ph. Schnoebelen. On shuffle products, acyclic automata and piecewise-testable languages. Information Processing Letters, 145:68--73, 2019.
doi: 10.1016/j.ipl.2019.01.012.
BibTex | DOI ]
[LS19a]
R. Lazić and S. Schmitz. The Ideal View on Rackoff's Coverability Technique. Information and Computation, 2019. To appear.
BibTex | Web page ]
[vdACCvD19]
W. M. P. van der Aalst, J. Carmona, T. Chatain, and B. F. van Dongen. A Tour in Process Mining: From Practice to Algorithmic Challenges. Transactions on Petri Nets and Other Models of Concurrency, 14:1--35, 2019.
doi: 10.1007/978-3-662-60651-3_1.
BibTex | DOI | Web page ]
[FNNS19]
M. Függer, R. Najvirt, T. Nowak, and U. Schmid. A faithful binary circuit model. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2019.
doi: 10.1109/TCAD.2019.2937748.
BibTex | DOI | Web page ]
[LPSS19]
J. Leroux, M. Praveen, G. Sutre, and Ph. Schnoebelen. On Functions Weakly Computable by Pushdown Petri Nets and Related Systems. Logical Methods in Computer Science, 15(4), 2019.
doi: 10.23638/LMCS-15(4:15)2019.
BibTex | DOI | PDF ]

This file was generated by bibtex2html 1.98.

About LSV