Publications : 2018

[LPR18]
S. Le Roux, A. Pauly, and M. Randour. Extending finite-memory determinacy to Boolean combinations of winning conditions. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 38:1--38:20, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.38.
BibTex | DOI | Web page | PDF ]
[Man18]
A. Mansutti. Extending propositional separation logic for robustness properties. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 42:1--42:23, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.42.
BibTex | DOI | Web page | PDF ]
[BHH18]
B. Bérard, S. Haar, and L. Hélouët. Hyper Partial Order Logic. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 20:1--20:21, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.20.
BibTex | DOI | Web page | PDF ]
[FLS18]
A. Finkel, J. Leroux, and G. Sutre. Reachability for Two-Counter Machines with One Test and One Reset. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 31:1--31:14, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.31.
BibTex | DOI | Web page | PDF ]
[BLS18b]
D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. In Proceedings of the 38th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'18), Leibniz International Proceedings in Informatics, pages 15:1--15:19, Ahmedabad, India, December 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.FSTTCS.2018.15.
BibTex | DOI | Web page | PDF ]
[Dal18]
A. Dallon. Verification of indistinguishability properties in cryptographic protocols -- Small attacks and efficient decision with SAT-Equiv. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2018.
BibTex | Web page | PDF ]
[Dup18]
Y. Duplouy. Applying Formal Methods to Autonomous Vehicle Control. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2018.
BibTex | Web page ]
[BJM18]
P. Bouyer, S. Jaziri, and N. Markey. Efficient Timed Diagnosis Using Automata with Timed Domains. In Proceedings of the 18th Workshop on Runtime Verification (RV'18), volume 11237 of Lecture Notes in Computer Science, pages 205--221, Limassol, Cyprus, November 2018. Springer.
doi: 10.1007/978-3-030-03769-7_12.
BibTex | DOI | Web page | PDF ]
[Dem18a]
S. Demri. On temporal and separation logics. In Proceedings of the 25th International Symposium on Temporal Representation and Reasoning (TIME'18), Leibniz International Proceedings in Informatics, pages 1:1--1:4, Warsaw, Poland, October 2018. Leibniz-Zentrum für Informatik.
BibTex | Web page ]
[CHK+18]
Th. Chatain, S. Haar, J. Kolcák, A. Thakkar, and L. Paulevé. Concurrency in Boolean networks. Research Report hal-01893106, HAL, October 2018. 33 pages.
BibTex | Web page | PDF ]
[BFG+18a]
G. Barthe, X. Fan, J. Gancher, B. Grégoire, C. Jacomme, and E. Shi. Symbolic Proofs for Lattice-Based Cryptography. In Proceedings of the 25th ACM Conference on Computer and Communications Security (CCS'18), pages 538--555, Toronto, Canada, October 2018. ACM Press.
BibTex | Web page | PDF ]
[FN18]
M. Függer and Th. Nowak. Fast Multidimensional Asymptotic and Approximate Consensus. In Proceedings of the 32nd International Symposium on Distributed Computing (DISC'18), Leibniz International Proceedings in Informatics, pages 27:1--27:15, New Orleans, USA, October 2018. Leibniz-Zentrum für Informatik.
BibTex | Web page ]
[BLS18c]
B. Bollig, M. Lehaut, and N. Sznajder. Round-Bounded Control of Parameterized Systems. In Proceedings of the 16th International Symposium on Automated Technology for Verification and Analysis (ATVA'18), volume 11138 of Lecture Notes in Computer Science, pages 370--386, Los Angeles, California, USA, October 2018. Springer.
doi: 10.1007/978-3-030-01090-4_22.
BibTex | DOI | Web page ]
[BBBC18]
N. Bertrand, P. Bouyer, T. Brihaye, and P. Carlier. When are Stochastic Transition Systems Tameable? Journal of Logic and Algebraic Methods in Programming, 99:41--96, October 2018.
doi: 10.1016/j.jlamp.2018.03.004.
BibTex | DOI | Web page | PDF ]
[BGMR18]
P. Bouyer, M. González, N. Markey, and M. Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. In Proceedings of the 9th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'18), volume 277 of Electronic Proceedings in Theoretical Computer Science, pages 250--264, Saarbrücken, Germany, September 2018.
doi: 10.4204/EPTCS.277.18.
BibTex | DOI | Web page | PDF ]
[BDH18]
D. Baelde, S. Delaune, and L. Hirschi. POR for Security Protocol Equivalences - Beyond Action-Determinism. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS'18), volume 11098 of Lecture Notes in Computer Science, pages 385--405, Barcelona, Spain, September 2018. Springer.
doi: 10.1007/978-3-319-99073-6_19.
BibTex | DOI | Web page ]
[CDD18]
V. Cortier, A. Dallon, and S. Delaune. Efficiently Deciding Equivalence for Standard Primitives and Phases. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS'18), volume 11098 of Lecture Notes in Computer Science, pages 491--511, Barcelona, Spain, September 2018. Springer.
doi: 10.1007/978-3-319-99073-6_24.
BibTex | DOI | Web page | PDF ]
[Hil18]
M. Hilaire. Complexity of the reachability problem for parametric timed automata. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2018.
BibTex ]
[Lef18]
E. Lefaucheux. Controlling Information in Probabilistic Systems. Thèse de doctorat, Université Rennes 1, Rennes, France, September 2018.
BibTex | Web page | PDF ]
[Gro18]
N. Grosshans. The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, September 2018.
BibTex | Web page | PDF ]
[BBJ18]
B. Bérard, P. Bouyer, and V. Jugé. Finite bisimulations for dynamical systems with overlapping trajectories. In Proceedings of the 27th Annual EACSL Conference on Computer Science Logic (CSL'18), Leibniz International Proceedings in Informatics, Birmingham, UK, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CSL.2018.26.
BibTex | DOI | Web page | PDF ]
[GMS18]
P. Gastin, S. Mukherjee, and B. Srivathsan. Reachability in timed automata with diagonal constraints. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 28:1--28:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.28.
BibTex | DOI | Web page | PDF ]
[BFG18c]
B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
BibTex | DOI | Web page | PDF ]
[GL18]
J. Goubault-Larrecq and J.-P. Lachance. On the Complexity of Monitoring Orchids Signatures, and Recurrence Equations. Formal Methods in System Design, 53(1):6--32, August 2018. Special issue of RV'16, to appear.
doi: 10.1007/s10703-017-0303-x.
BibTex | DOI | Web page ]
[Bur18a]
G. Burel. Linking Focusing and Resolution with Selection. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS'18), volume 117 of Leibniz International Proceedings in Informatics, pages 9:1--9:14, Liverpool, UK, August 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.MFCS.2018.9.
BibTex | DOI | Web page | PDF ]
[CHP18b]
Th. Chatain, S. Haar, and L. Paulevé. Most Permissive Semantics of Boolean Networks. Research Report 1808.10240, Computing Research Repository, August 2018. 15 pages.
BibTex | Web page | PDF ]
[BLS18a]
D. Baelde, A. Lick, and S. Schmitz. A Hypersequent Calculus with Clusters for Linear Frames. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 36--55, Bern, Switzerland, August 2018. College Publications.
BibTex | Web page ]
[DF18]
S. Demri and R. Fervari. On the complexity of modal separation logics. In Proceedings of the 10th Conference on Advances in Modal Logics (AiML'18), pages 179--198, Bern, Switzerland, August 2018. College Publications.
BibTex | Web page | PDF ]
[FFL18]
S. Friedrichs, M. Függer, and C. Lenzen. Metastability-Containing Circuits. IEEE Transactions on Computers, 67(8):1167--1183, August 2018.
doi: 10.1109/TC.2018.2808185.
BibTex | DOI | Web page ]
[BMR+18]
P. Bouyer, N. Markey, M. Randour, K. G. Larsen, and S. Laursen. Average-energy games. Acta Informatica, 55(2):91--127, July 2018.
doi: 10.1007/s00236-016-0274-1.
BibTex | DOI | Web page | PDF ]
[HM18]
S. Haddad and B. Monmege. Interval iteration algorithm for MDPs and IMDPs. Theoretical Computer Science, 735:111--131, July 2018.
doi: 10.1016/j.tcs.2016.12.003.
BibTex | DOI | Web page ]
[LR18a]
R. Lepigre and C. Raffalli. Abstract Representation of Binders in OCaml using the Bindlib Library. In Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'18), pages 42--56, Oxford, UK, July 2018. ACM Press.
doi: 10.4204/EPTCS.274.4.
BibTex | DOI | Web page | PDF ]
[FNS18]
M. Függer, Th. Nowak, and M. Schwarz. Tight Bounds for Asymptotic and Approximate Consensus. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC'18), pages 325--334, Egham, UK, July 2018. ACM Press.
doi: 10.1145/3212734.3212762.
BibTex | DOI | Web page ]
[BBF+18a]
G. Bacci, P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and P.-A. Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In Proceedings of the 22nd International Symposium on Formal Methods (FM'18), Lecture Notes in Computer Science, pages 203--221, Oxford, UK, July 2018. Springer. Best paper award.
doi: 10.1007/978-3-319-95582-7_12.
BibTex | DOI | Web page | PDF ]
[JK18]
C. Jacomme and S. Kremer. An extensive formal analysis of multi-factor authentication protocols. In Proceedings of the 31st IEEE Computer Security Foundations Symposium (CSF'18), pages 1--15, Oxford, UK, July 2018. IEEE Computer Society Press.
doi: 10.1109/CSF.2018.00008.
BibTex | DOI | Web page | PDF ]
[DGK18]
V. Dave, P. Gastin, and S. N. Krishna. Regular Transducer Expressions for Regular Transformations. In Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'18), pages 315--324, Oxford, UK, July 2018. ACM Press.
doi: 10.1145/3209108.3209182.
BibTex | DOI | Web page | PDF ]
[LFV18]
A. Le Coënt, L. Fribourg, and J. Vacher. Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method. In Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'18), volume 51 of IFAC-PapersOnLine, pages 259--264, Oxford, UK, July 2018. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2018.08.044.
BibTex | DOI | Web page | PDF ]
[FHLM18]
É. Fabre, L. Hélouët, E. Lefaucheux, and H. Marchand. Diagnosability of Repairable Faults. Discrete Event Dynamic Systems: Theory and Applications, 28(2):183--213, June 2018.
doi: 10.1007/s10626-017-0255-8.
BibTex | DOI | PDF ]
[Hal18]
S. Halfon. On Effective Representations of Well Quasi-Orderings. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, June 2018.
BibTex | Web page | PDF ]
[CGR18]
O. Carton, B. Guillon, and F. Reiter. Counter Machines and Distributed Automata. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 13--28, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_2.
BibTex | DOI | PDF ]
[CHP18a]
Th. Chatain, S. Haar, and L. Paulevé. Boolean Networks: Beyond Generalized Asynchronicity. In Proceedings of the 24th Annual International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA'18), volume 10875 of Lecture Notes in Computer Science, pages 29--42, Ghent, Belgium, June 2018. Springer.
doi: 10.1007/978-3-319-92675-9_3.
BibTex | DOI | Web page ]
[LGS18]
E. Lefaucheux, A. Giua, and C. Seatzu. Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 164--183, Bratislava, Slovakia, June 2018. Springer.
BibTex | PDF ]
[BBDH18]
B. Barbot, B. Bérard, Y. Duplouy, and S. Haddad. Integrating Simulink Models into the Model Checker Cosmos. In Proceedings of the 39th International Conference on Applications and Theory of Petri Nets (PETRI NETS'18), volume 10877 of Lecture Notes in Computer Science, pages 363--373, Bratislava, Slovakia, June 2018. Springer.
doi: 10.1007/978-3-319-91268-4_19.
BibTex | DOI | Web page | PDF ]
[SGF18b]
A. Saoud, A. Girard, and L. Fribourg. On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. In Proceedings of the 16th European Control Conference (ECC'18), pages 435--440, Limassol, Cyprus, June 2018. IEEE Press.
doi: 10.23919/ECC.2018.8550622.
BibTex | DOI | Web page | PDF ]
[AGK18]
S. Akshay, P. Gastin, and S. N. Krishna. Analyzing Timed Systems Using Tree Automata. Logical Methods in Computer Science, 14(2):1--35, May 2018.
doi: 10.23638/LMCS-14(2:8)2018.
BibTex | DOI | Web page | PDF ]
[FKLW18]
M. Függer, A. Kinali, C. Lenzen, and B. Wiederhake. Fast All-Digital Clock Frequency Adaptation Circuit for Voltage Droop Tolerance. In Proceedings of the 24th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'18), pages 68--77, Vienna, Austria, May 2018. IEEE Computer Society.
doi: 10.1109/ASYNC.2018.00025.
BibTex | DOI | Web page ]
[JMS18]
L. Jezequel, A. Madalinski, and S. Schwoon. Distributed computation of vector clocks in Petri nets unfolding for test selection. In Proceedings of the 14th Workshop on Discrete Event Systems (WODES'18), volume 51(7) of IFAC-PapersOnLine, pages 106--111, Sorrento Coast, Italy, May-June 2018. Elsevier Science Publishers.
BibTex | PDF ]
[ABG18]
C. Aiswarya, B. Bollig, and P. Gastin. An Automata-Theoretic Approach to the Verification of Distributed Algorithms. Information and Computation, 259:305--327, April 2018.
doi: 10.1016/j.ic.2017.05.006.
BibTex | DOI | PDF ]
[Gil18]
F. Gilbert. Extending higher-order logic with predicate subtyping. Thèse de doctorat, Université Paris 7, Paris, France, April 2018.
BibTex | PDF ]
[Bur18b]
G. Burel. Linking Focusing and Resolution with Selection. Research Report hal-01670476, HAL Research Report, April 2018.
BibTex | Web page | PDF ]
[SGF18a]
A. Saoud, A. Girard, and L. Fribourg. Contract based Design of Symbolic Controllers for Vehicle Platooning. In Proceedings of the 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC'18), pages 277--278, Porto, Portugal, April 2018. ACM Press. Poster.
doi: 10.1145/3178126.3187001.
BibTex | DOI | PDF ]
[Bla18]
F. Blanqui. Size-based termination of higher-order rewriting. Journal of Functional Programming, 28, April 2018.
doi: 10.1017/S0956796818000072.
BibTex | DOI | Web page | PDF ]
[JKS18]
C. Jacomme, S. Kremer, and G. Scerri. Symbolic Models for Isolated Execution Environments. In Proceedings of the 2nd IEEE European Symposium on Security and Privacy (EuroS&P'17), pages 530--545, Paris, France, April 2018. IEEE Press.
doi: 10.1109/EuroSP.2017.16.
BibTex | DOI | Web page ]
[Had18]
S. Haddad. Memoryless determinacy of finite parity games: Another simple proof. Information Processing Letters, 132:19--21, April 2018.
doi: 10.1016/j.ipl.2017.11.012.
BibTex | DOI | PDF ]
[CCD+18]
Th. Chatain, M. Comlan, D. Delfieu, L. Jezequel, and O. H. Roux. Pomsets and Unfolding of Reset Petri Nets. In Proceedings of the 12th International Conference on Language and Automata Theory and Applications (LATA'18), volume 10792 of Lecture Notes in Computer Science, pages 258--270, Bar-Ilan, Israel, April 2018. Springer.
doi: 10.1007/978-3-319-77313-1_20.
BibTex | DOI | Web page ]
[DLM18]
S. Demri, É. Lozes, and A. Mansutti. The Effects of Adding Reachability Predicates in Propositional Separation Logic. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 476--493, Thessaloniki, Greece, April 2018. Springer.
BibTex | PDF ]
[Bou18]
P. Bouyer. Games on graphs with a public signal monitoring. In Proceedings of the 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'18), volume 10803 of Lecture Notes in Computer Science, pages 530--547, Thessaloniki, Greece, April 2018. Springer.
doi: 10.1007/978-3-319-89366-2_29.
BibTex | DOI | Web page | PDF ]
[FMN+18]
M. Függer, J. Maier, R. Najvirt, Th. Nowak, and U. Schmid. A Faithful Binary Circuit Model with Adversarial Noise. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE'18), pages 1327--1332, Dresden, Germany, March 2018. IEEE Computer Society Press.
doi: 10.23919/DATE.2018.8342219.
BibTex | DOI | Web page | PDF ]
[BBF+18b]
B. Barbot, M. Beccuti, G. Franceschinis, S. Haddad, and C. Picaronny. Bounds Computation for Symmetric Nets. Research Report hal-01726011, HAL-Inria, March 2018.
BibTex | Web page | PDF ]
[GBM18]
P. Gardy, P. Bouyer, and N. Markey. Dependences in Strategy Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 34:1--34:15, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.34.
BibTex | DOI | Web page | PDF ]
[BFG18b]
B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
BibTex | DOI | Web page | PDF ]
[GKLZ18]
M. Ganardi, D. König, M. Lohrey, and G. Zetzsche. Knapsack problems for wreath products. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 32:1--32:13, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.32.
BibTex | DOI | Web page | PDF ]
[Bv18]
D. Berwanger and M. van den Bogaard. Consensus Game Acceptors and Iterated Transductions. International Journal of Foundations of Computer Science, 29(02):165--185, February 2018.
doi: 10.1142/S0129054118400026.
BibTex | DOI | Web page | PDF ]
[GM18]
P. Gastin and B. Monmege. A unifying survey on weighted logics and weighted automata. Soft Computing, 22(4):1047--1065, February 2018.
doi: 10.1007/s00500-015-1952-6.
BibTex | DOI | Web page | PDF ]
[BFL+18]
P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, J. Ouaknine, and J. Worrell. Model Checking Real-Time Systems. In Handbook of Model Checking, pages 1001--1046. Springer, 2018.
doi: 10.1007/978-3-319-10575-8_29.
BibTex | DOI | Web page | PDF ]
[BFM18]
M. Blondin, A. Finkel, and P. McKenzie. Handling Infinitely Branching Well-structured Transition Systems. Information and Computation, 258:28--49, 2018.
doi: 10.1016/j.ic.2017.11.001.
BibTex | DOI ]
[BGH18]
B. Bollig, M.-L. Grindei, and P. Habermehl. Realizability of Concurrent Recursive Programs. Formal Methods in System Design, 2018. To appear.
BibTex ]
[LR18b]
R. Lepigre and C. Raffalli. Practical Subtyping for Curry-Style Languages. ACM Transactions on Programming Languages and Systems, 41(1):5:1--5:58, 2018.
doi: 10.1145/3285955.
BibTex | DOI | PDF ]
[Lep18]
R. Lepigre. PML_2: Integrated Program Verification in ML. In Proceedings of the 23rd International Conference on Types for Proofs and Programs (TYPES'17, volume 104 of Leibniz International Proceedings in Informatics, pages 4:1--4:27, Budapest, Hungary, 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.TYPES.2017.4.
BibTex | DOI | Web page | PDF ]
[Dem18b]
S. Demri. Reasoning about reversal-bounded counter machines. In Ewa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, pages 441--479. Springer, 2018.
BibTex | Web page | PDF ]
[BLMP18]
V. Brattka, S. Le Roux, J. S. Miller, and A. Pauly. Connected Choice and Brouwer's Fixed Point Theorem. Journal of Mathematical Logic, 2018. To appear.
BibTex ]
[CYFFMF18]
R. Chane-Yack-Fa, M. Frappier, A. Mammar, and A. Finkel. Parameterized Verification of Monotone Information Systems. Formal Aspects of Computing, 30(3-4):463--489, 2018.
doi: 10.1007/s00165-018-0460-8.
BibTex | DOI | Web page ]
[Zet18]
G. Zetzsche. The Emptiness Problem for Valence Automata over Graph Monoids. Information and Computation, 2018. To appear.
BibTex ]
[LZ18]
M. Lohrey and G. Zetzsche. Knapsack in Graph Groups. Theory of Computing Systems, 62(1):192--246, January 2018.
doi: 10.1007/s00224-017-9808-3.
BibTex | DOI ]
[BHL18]
N. Bertrand, S. Haddad, and E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Information and Computation, 2018. To appear.
BibTex | PDF ]
[Gou18]
J. Goubault-Larrecq. A semantics for nabla. Mathematical Structures in Computer Science, pages 1--25, 2018. To appear.
doi: 10.1017/S0960129518000063.
BibTex | DOI | Web page ]
[BHSS18]
B. Bérard, S. Haar, S. Schmitz, and S. Schwoon. The Complexity of Diagnosability and Opacity Verification for Petri Nets. Fundamenta Informaticae, 161(4):317--349, 2018.
doi: 10.3233/FI-2018-1706.
BibTex | DOI | Web page ]
[LFM+18]
A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Compositional synthesis of state-dependent switching control. Theoretical Computer Science, 750:53--68, 2018.
doi: 10.1016/j.tcs.2018.01.021.
BibTex | DOI | Web page | PDF ]
[LACF18]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods in System Design, 53(3):363--383, 2018.
doi: 10.1007/s10703-017-0305-8.
BibTex | DOI | Web page | PDF ]
[ABDL18]
N. Alechina, N. Bulling, S. Demri, and B. Logan. On the Complexity of Resource-Bounded Logics. Theoretical Computer Science, 750:69--100, 2018.
doi: 10.1016/j.tcs.2018.01.019.
BibTex | DOI | PDF ]
[HGLJX18]
W. K. Ho, J. Goubault-Larrecq, A. Jung, and X. Xi. The Ho-Zhao Problem. Logical Methods in Computer Science, 14(1):1--19, January 2018.
doi: 10.23638/LMCS-14(1:7)2018.
BibTex | DOI | Web page | PDF ]

This file was generated by bibtex2html 1.98.

About LSV