Publications

Not every publication of a member or an associate member of ReLaX is joint with a co-author from the other country. We list here only the publications with an India-based and a France-based co-author or with an explicit reference to the UMI ReLaX, along with some publications presented in FSTTCS, the yearly international conference in theoretical computer science sponsored by the IARCS (Indian Association for Research in Computing Science) and ICLA, the biennial conference in logic sponsored by ALI (Association for Logic in India).

2020

ReLaX publications

Paul Gastin, Amaldev Manuel, R. Govind. Reversible Regular Languages: Logical and Algebraic Characterisations. Submitted.

Paul Gastin, Sayan Mukherjee, B. Srivathsan. Submitted. Reachability for updatable timed automata made faster and more effective. Submitted.

C. Aiswarya, Paul Gastin. Weighted Tiling Systems for Graphs: Evaluation complexity. Submitted.

Hans van Ditmarsch, David Fernández Duque, Vaishnavi Sundararajan, S.P. Suresh. Who holds the best card? Secure communication of optimal secret bits. Submitted.

Sougata Bose, S.N. Krishna, Anca Muscholl, Gabriele Puppis. One-way Resynchronization of Word Transducers. Submitted.

Diego Figueira, Anirban Majumdar, M. Praveen. Playing with Repetitions in Data Words Using Energy Games. Logical Methods in Computer Science, to appear.

V. Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay. A special case of rational identity testing and the Brešar-Klep theorem. In Proceedings of MFCS 2020, to appear.

Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil. Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces. In Proceedings of CONCUR 2020, to appear.

Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers. Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. In Proceedings of PODC 2020, to appear.

Francesco Amoroso, Sinnou David. Covolumes, unités, régulateur: conjectures de D. Bertrand et F. Rodriguez-Villegas.  Annales mathématiques du Québec, to appear.

Sinnou David, Noriko Hirata-Kohno, Makoto Kawashima. Can polylogarithms at algebraic points be linearly independent? J. Comb. Numb. Theory, to appear.

Frédéric Herbreteau, B. Srivathsan, T.T. Tung, Igor Walukiewicz. Why liveness for timed automata is hard, and what we can do about it. ACM Trans. Comput. Logic, to appear.

Vrunda Dave, Paul Gastin, S. Krishna. Regular Transducer Expressions for Regular Transformations. Information and Computation, to appear.

Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals.  MaxSAT Resolution and Subcube Sums. In Proceedings 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT) (L. Pulina and M. Seidl eds), Lecture Notes in Computer Science 12178, Springer, 2020, to appear.

Julien Baste, Michael R. Fellows, Lars Jaffke, Tomáš Masařík, Mateus de Oliveira Oliveira, Geevarghese Philip, Frances A. Rosamond. Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory. In IJCAI-PRICAI 2020, to appear.

Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh. A (2+ε)-factor approximation algorithm for split vertex deletion. In ICALP 2020, to appear.

Geevarghese Philip, M. R. Rani, R. Subashini. On Computing the Hamiltonian index of graphs. In CSR 2020, to appear.

Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh. 2-Approximating feedback vertex set in tournaments. In Proceedings of SODA 2020. DOI: 10.1137/1.9781611975994.61.

Anantha Padmanabha, R. Ramanujam. Verifying implicitly quantified modal logic over dynamic networks of processes. Proceedings of ICDCIT 2020, Lecture Notes in Computer Science 11969, Springer, 2020, 165-176. DOI: 10.1007/978-3-030-36987-3_10.

S. Akshay, Paul Gastin, S. Krishna, Sparsa Roychowdhury. Revisiting underapproximate reachability for multipushdown systems. Proceedings of TACAS’20, part 1, Lecture Notes in Computer Science 12078, Springer, 2020, 387-404. DOI: 10.1007/978-3-030-45190-5_21.

Diego Figueira, Adwait Godbole, S. Krishna, Wim Martens, Matthias Niewerth, Tina Trautner. Containment of Simple Regular Path Queries, Proceedings of KR’20.

Hugo Gimbert, Soumyajit Paul, B. Srivathsan. A Bridge between polynomial optimization and games with imperfect recall. Proceedings of 19th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2020, pages 456 – 464. DOI: 10.5555/3398761.3398818.

Olga Kharlampovich, Pascal Weil. On the generalized membership problem in relatively hyperbolic groups. In Fields of Logic and Computation III — Essays dedicated to Yuri Gurevich on the occasion of his 80th birthday (A. Blass, P. Cégielski, N. Dershowitz, M. Droste, B. Finkbeiner, eds), Lecture Notes in Computer Science 12180, Springer, 2020, 147-155. DOI:10.1007/978-3-030-48006-06_11.

Frédérique Bassino, Cyril Nicaud, Pascal Weil. Random presentations and random subgroups: a survey. In Complexity and Randomness in Group Theory – GAGTA Book 1, de Gruyter, 2020.

Frédérique Bassino, Ilya Kapovich, Markus Lohrey, Alexei Miasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov, Pascal Weil. Complexity and Randomness in Group Theory – GAGTA Book 1, de Gruyter, 2020. DOI: 10.1515/9783110667028.

R. Ramanujam, Vaishnavi Sundararajan and S.P. Suresh. The complexity of disjunction in intuitionistic logicJournal of Logic and Computation 30:1 (2020), 421–445.DOI: 10.1093/logcom/exaa018.

Shweta Bhandari, Frédéric Herbreteau, V. Laxmi, Akka Zemmari, M. S. Gaur, P. S. Roop. SneakLeak+: Large-Scale Klepto Apps Analysis. Future Generation Computer Systems 109 (2020), 593-603. DOI: 10.1016/j.future.2018.05.047.

Ahmed Bouajjani, Constantin Enea, Madhavan Mukund, Gautham Shenoy R., S. P. Suresh. Formalizing and Checking Multilevel Consistency. In Proceedings of VMCAI 2020, Lecture Notes in Computer Science 11990, pp. 379-400, Springer (2020). DOI: 10.1007/978-3-030-39322-9_18.

Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen. The Ideal Approach to Computing Closed Subsets in Well-Quasi-Orderings. Chapter 3 in Well-Quasi Orders in Logic, Language and Reasoning – A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory (eds. P. Schuster, M. Seisenberger, A. Weiermann), pp. 55-105. Trends in Logic 53, Springer (2020). DOI: 10.1007/978-3-030-30229-0_3.

J. Gajrani, U. Agarwal, Vijaya Laxmi, B. Bezawada, Manoj Singh Gaur, M. Tripathi, Akka Zemmari. EspyDroid+: Precise Reflection Analysis of Android Apps. Computers & Security 90 (2020). DOI: 10.1016/j.cose.2019.101688

2019

ReLaX publications

Arkadev Chattopadhyay, Paul Gastin editors. Proceedings of the 39th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’19), Leibniz International Proceedings in Informatics (LIPIcs), volume 150,  2019.

Ramit Das, R. Ramanujam, Sunil Simon. Reasoning about social choice and games in monadic fixed-point logic. In Proceedings of TARK 2019, pages 106-120.

Anantha Padmanabha, R. Ramanujam. Propositional modal logic with implicit modal quantification. In Logic and its applications, 8th Indian Conference ICLA, Lecture Notes in Computer Science 11600, pp. 6-17, Springer, 2019. DOI: 10.1007/978-3-662-58771-3\_2.

Agnishom Chattopadhyay, M. Praveen. Query Preserving Watermarking Schemes for Locally Treelike Databases. In Proceedings of FSTTCS 2019, volume 150 of LIPIcs, pages 36:1 – 36:14, 2019. DOI: 10.4230/LIPIcs.FSTTCS.2019.36

N. Bertrand, P. Bouyer, and A. Majumdar. Concurrent parameterized games. In Proceedings of FSTTCS 2019, volume 150 of LIPIcs, pages 31:1–31:15, 2019. DOI: 10.4230/LIPIcs.FSTTCS.2019.31.

Ekanshdeep Gupta, Alain Finkel. The well structured problem for Presburger counter machines. In Proceedings of FSTTCS 2019, volume 150 of LIPIcs, pages 41:1 – 41:15. DOI: 10.4230/LIPIcs.FSTTCS.2019.41.

Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers. Long-Lived Counters with Polylogarithmic Amortized Step Complexity. In Proceedings of DISC 2019, volume 146 of LIPIcs, pages 3:1 – 3:16. DOI: 10.4230/LIPIcs.DISC.2019.3

Loïc Hélouët, Nicolas Markey, Ritam Raha. Reachability games with relaxed energy constraints, GANDALF 2019, EPTCS. DOI: 10.4204/EPTCS.305.2

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Reconfiguration and message losses in parameterized broadcast networks. In Proceedings of CONCUR 2019, volume 140 of LIPIcs, pages 32:1 – 32:15. DOI: 10.4230/LIPIcs.CONCUR.2019.32

Alain Finkel, M. Praveen. Verification of Flat FIFO Systems. In Proceedings of CONCUR 2019, volume 140 of LIPIcs, pages 12:1 – 12:17. DOI: 10.4230/LIPIcs.CONCUR.2019.12

R. Govind, Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Revisiting local time semantics for networks of timed automata. In Proceedings of CONCUR 2019, volume 140 of LIPIcs, pages 16:1 – 16:15. DOI: 10.4230/LIPIcs.CONCUR.2019.16

Diego Figueira, Varun Ramanathan, Pascal Weil. The quantifier alternation hierarchy of synchronous relations. In Proceedings of MFCS 2019, volume 138 of LIPIcs, pages 29:1 – 29:14. DOI: 10.4230/LIPIcs.MFCS.2019.29.

Anantha Padmanabha, R. Ramanujam. Two variable fragment of term modal logic. In Proceedings of MFCS 2019, volume 138 of LIPIcs, pages 30:1 – 30:14. DOI: 10.4230/LIPIcs.MFCS.2019.30.

Sougata Bose, S.N. Krishna, Anca Muscholl, Vincent Penelle, Gabriele Puppis. On Synthesis of Resynchronizers for Transducers. In Proceedings of MFCS 2019, volume 138 of LIPIcs, pages 69:1 – 69:14. DOI: 10.4230/LIPIcs.MFCS.2019.69.

Paul Gastin, Amaldev 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), Lecture Notes in Computer Science 11647, pp. 182-191, Springer, 2019. DOI: 10.1007/978-3-030-24886-4_13.

Paul Gastin, Sayan Mukherjeee, B. Srivathsan. Fast Algorithms for Handling Diagonal Constraints in Timed Automata, In  Proceedings of CAV 2019, Lecture Notes in Computer Science 11561, pp. 41-59, Springer, 2019. DOI: 10.1007/978-3-030-25540-4_3.

S. Akshay, Paul Gastin, Vincent Jugé, 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), pp. 1-13, IEEE Press, 2019. DOI: 10.1109/LICS.2019.8785684.

Anantha Padmanabha, R. Ramanujam. The monadic fragment of propositional term modal logicStudia Logica 107:3 (2019) 533-557. DOI: 10.1007/s11225-018-9784-x.

Jérôme Leroux, M. Praveen, Philippe Schnoebelen, Grégoire Sutre. 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.

Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Godpole. Controlling a populationLogical Methods in Computer Science 15(3) (2019). DOI: 10.23638/LMCS-15(3:6)2019.

Thomas Place, Varun Ramanathan, Pascal Weil. Covering and separation for logical fragments with modular predicates. Logical Methods in Computer Science 15:2 (2019) 11:1-11:32. DOI: 10.23638/LMCS-15(2:11)2019.

Vinod P., Akka Zemmari, Mauro Conti. A machine learning based approach to detect malicious Android apps using discriminant system callsFuture Generation Computer Systems 94 333–350 (2019).

Prateek Karandikar, Philippe 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 (2019). DOI: 10.23638/LMCS-15(2:6)2019.

Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale. Subset feedback vertex set in chordal and split graphs. Algorithmica 81(9) (2019) 3586-3629. DOI: 10.1007/s00453-019-00590-9.

Julien Baste, Lars Jaffke, Tomás Masarík, Geevarghese Philip, Günter Rote. FPT algorithms for diverse collections of hitting sets. Algorithms 12(12) (2019) 254. DOI: 10.3390/a12120254.

Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale. Subset feedback vertex set in chordal and split graphs. In Proceedings of CIAC 2019, pp. 365-376. DOI: 10.1007/978-3-030-17402-6_30.

Other 2019 papers related to ReLaX

Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume. A Strategy for Dynamic Programs: Start over and Muddle through. Logical Methods in Computer Science 15(2) (2019).

V. Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay. Efficient black-box identity testing over free group algebra, Approx-Random 2019, LIPIcs. In Proceedings of APPROX-RANDOM 2019, volume 145 of LIPIcs, pages 57:1 – 57:16. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.57

Kavitha Gopal, Meghana Nasre, Prajakta Nimbhorkar, and T. Pradeep Reddy. Many-to-one Popular Matchings with Two-Sided Preferences and One-Sided Ties, COCOON 2019.

2018

ReLaX publications

Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume. Reachability is in DynFO. J. ACM 65(5): 33:1-33:24 (2018).

Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee. Shortest k-disjoint paths via determinants. FSTTCS 2018: 19:1-19:21, LIPIcs. DOI: 10.4230/LIPIcs.FSTTCS.2018.19

S. Akshay, Paul Gastin, S.N. Krishna. Analyzing timed systems using tree automata.   Logical Methods in Computer Science, 14(2): 1-35. 2018. DOI: 10.23638/LMCS-14(2:8)2018.

Shweta Bhandari, R. Panihar, S. Naval, V. Laxmi, Akka Zemmari, M. S. Gaur. SWORD: Semantic AWare AndrOid MalwaRe Detector. Journal of Information Security and Applications 42: 46-56 (2018)

S. Saharan, V. Laxmi, M. S. Gaur, Akka Zemmari. Privacy Preserving Data-Computation Offloading. In Proceedings of the 13th International Conference on Risks and Security of Internet and Systems (CRISIS 2018), 2018, pages 86-92.

Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip and Saket Saurabh. Finding even subgraphs even fasterJournal of Computer and System Sciences 97: 1-13 (2018).

Samir Datta, Anish Mukherjee, Niels Vortmeier, Thomas Zeume. Reachability and distances under multiple changes. ICALP 2018: 120:1-120:14, LIPIcs. DOI: 10.4230/LIPIcs.ICALP.2018.120

Samir Datta, Raghav Kulkarni, Anish Kumar, Anish Mukherjee. Planar Maximum Matching: Towards a Parallel Algorithm, ISAAC 2018: 21:1-21:13, LIPIcs. DOI: 10.4230/LIPIcs.ISAAC.2018.21

Paul Gastin, Sayan Mukherjee, B. Srivathsan: Reachability in timed automata with diagonal constraints. In Proceedings of CONCUR 2018, volume 118 of LIPIcs, pages 28:1 – 28:17.

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan. Verifying Quantitative Temporal Properties of Procedural Programs. In Proceedings of CONCUR 2018, volume 118 of LIPIcs, pages 15:1 – 15:17.

Wojciech Czerwinski, Slawomir Lasota, Roland Meyer, Sebastian Muskalla, K. Narayan Kumar, Prakash Saivasan. Regular Separability of Well-Structured Transition Systems. In Proceedings of CONCUR 2018, volume 118 of LIPIcs. pages 35:1-35:18.

Krishnapriya A. M., Meghana Nasre, Prajakta Nimbhorkar, Amit Rawat. How good are Popular Matchings? In Proceedings of the 17th Symposium on Experimental Algorithms, SEA 2018, volume 103 of LIPIcs, pages 9:1-9:14.

Vrunda Dave, Paul Gastin, Shankara Narayanan Krishna. Regular Transducer Expressions for Regular Transformations. In LICS 2018: 315-324. Long version on ArXiv.

Diego Figueira, M. Praveen. Playing with Repetitions in Data Words Using Energy Games. Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jul 2018, Oxford, United Kingdom. 2018.

Denis Kuperberg and Anirban Majumdar. Width of non-deterministic automata. In STACS 2018, Leibniz International Proceedings in Informatics 96, pages 47:1-47:14. Leibniz-Zentrum für Informatik, 2018. DOI: 10.4230/LIPIcs.STACS.2018.47.

Balasubramanian A.R, Nathalie Bertrand, Nicolas Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. In TACAS’18 (Part II), Lecture Notes in Computer Science 10806, pages 38-54. Springer-Verlag, April 2018. DOI: 10.1007/978-3-319-89963-3_3

C. Aiswarya, Benedikt Bollig, Paul Gastin.  An Automata-Theoretic Approach to the Verification of Distributed Algorithms.  Information and Computation, 259(3): 305-327. 2018. DOI: 10.1016/j.ic.2017.05.006.

Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi: Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth. SODA 2018: 262-273.

Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé, Meirav Zehavi. Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. SODA 2018: 331-342.

Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh. When Recursion is Better than Iteration: A Linear Time Algorithm for Acyclicity with Few Error Vertices. SODA 2018: 1916-1933.

Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi. Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms. SODA 2018: 2785-2800.

Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi. Parameterized Algorithms for Survivable Network Design with Uniform Demands. SODA 2018: 2838-2850.

2017

ReLaX publications

N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert. Controlling a Population. In  CONCUR’17, Leibniz International Proceedings in Informatics 85, pages 12:1-12:16. DOI: 10.4230/LIPIcs.CONCUR.2017.12

S. Akshay, P. Gastin, S. N. Krishna and I. Sarkar.  Towards an Efficient Tree Automata based technique for Timed Systems.  In  CONCUR’17, Leibniz International Proceedings in Informatics 85, pages 39:1-39:15. Leibniz-Zentrum für Informatik, 2017. doi: 10.4230/LIPIcs.CONCUR.2017.39

S. Bhandari, W. Ben Jaballah, V. Jain, V. Laxmi, A. Zemmari, M. S. Gaur, M. Mosbah, M. Conti. Android inter-app communication threats and detection techniques. Computers & Security, 70: 392-421 (2017).

Abdullah Abdul Khadir, Madhavan Mukund and S.P. Suresh. Knowledge transfer and information leakage in protocols. In Proceedings of ATVA 2017, Springer, Lect. Notes in Comp. Science 10482  (2017), 225-240.

J. Gajrani, V. Laxmi, M. Tripathi, M.S. Gaur, D. R. Sharma, A. Zemmari, M. Mosbah, M. Conti. Unraveling Reflection Induced Sensitive Leaks in Android Apps. In Proceedings of the 12th International Conference on Risks and Security of Internet and Systems (CRISIS 2017), Dinard.

S. Bhandari, F. Herbreteau, V. Laxmi, A. Zemmari, P. S. Roop, M. S. Gaur. SneakLeak: Detecting Multipartite Leakage Paths in Android Apps. TrustCom/BigDataSE/ICESS 2017: 285-292.

V. Jain, S. Bhandari, V. Laxmi, M. S. Gaur, M. Mosbah. SniffDroid: Detection of Inter-App Privacy Leaks in Android. TrustCom/BigDataSE/ICESS 2017: 331-338.

S. Bhandari, F. Herbreteau, V. Laxmi, A. Zemmari, P. S. Roop, M. S. Gaur. POSTER: Detecting Inter-App Information Leakage Paths. AsiaCCS 2017: 908-910.

M. F. Atig, A. Bouajjani, K. Narayan Kumar, P. Saivasan. Verification of Asynchronous Programs with Nested Locks. FSTTCS 2017, LIPIcs volume 93 (2018), pp. 11:1-11:14.

Hugo Gimbert. On the Control of Asynchronous Automata. FSTTCS 2017, LIPIcs volume 93 (2018), pp. 30:1-30:15.

Other papers presented at FSTTCS 2017 and ICLA 2017

Zeinab Bakhtiari, Hans van Ditmarsch, Helle Hvid HansenNeighbourhood Contingency Bisimulation. ICLA 2017: 48-63.

Anca Muscholl. Automated synthesis: a distributed viewpoint. Invited speaker, FSTTCS 2017, LIPIcs volume 93 (2018), pp. 3:1-3:5.

M. Blondin, A. Finkel and J. Goubault-Larrecq.  Forward Analysis for WSTS, Part III: Karp-Miller Trees. FSTTCS 2017, LIPIcs volume 93 (2018), pp. 16:1-16:5.

S. Demri, E. Lozes, D. Lugiez. On Symbolic Heaps Modulo Permission Theories. FSTTCS 2017, LIPIcs volume 93 (2018), pp. 25:1-25:14.