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).


Indo-French publications

Frédéric Herbreteau, B. Srivathsan, T.T. Tran, Igor Walukiewicz. Why liveness for timed automata is hard, and what we can do about it. 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.

Thomas Place, Varun Ramanathan, Pascal Weil. Covering and separation for logical fragments with modular predicates. Submitted.

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. To appear (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), to appear.

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

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.

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

C. Aiswarya, Benedikt Bollig, Paul Gastin. An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. 259(3): 305-327 (2018). DOI:

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, N. Bertrand, N. 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, B. Bollig and P. 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.


Indo-French 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.