On Verifying TSO Robustness for Event-Driven Asynchronous Programs. - Ahmed Bouajjani; Constantin Enea; Madhavan Mukund; Rajarshi Roy 002 (NETYS, 2018)

Learning Interpretable Models in the Property Specification Language. - Rajarshi Roy 002; Dana Fisman; Daniel Neider (IJCAI, 2020)

Quality Guarantees for Autoencoders via Unsupervised Adversarial Attacks. - Benedikt Böing; Rajarshi Roy 002; Emmanuel Müller; Daniel Neider (ECML/PKDD (2), 2020)

Property-Directed Verification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (CoRR, 2020)

Learning Linear Temporal Properties from Noisy Data: A MaxSAT-Based Approach. - Jean-Raphaël Gaglione; Daniel Neider; Rajarshi Roy 002; Ufuk Topcu; Zhe Xu 005 (ATVA, 2021)

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (ATVA, 2021)

QUGA - Quality Guarantees for Autoencoders. - Benedikt Böing; Rajarshi Roy 002; Daniel Neider; Emmanuel Müller (OVERLAY@GandALF, 2021)

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. - Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Igor Khmelnitsky; Martin Leucker; Daniel Neider; Rajarshi Roy 002; Lina Ye (ICGI, 2021)

Learning Linear Temporal Properties from Noisy Data: A MaxSAT Approach. - Jean-Raphaël Gaglione; Daniel Neider; Rajarshi Roy 002; Ufuk Topcu; Zhe Xu 005 (CoRR, 2021)

Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (CoRR, 2021)

Expanding the Horizon of Linear Temporal Logic Inference for Explainability. - Daniel Neider; Rajarshi Roy 002 (RE Workshops, 2022)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (TACAS (1), 2022)

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. - Igor Khmelnitsky; Serge Haddad; Lina Ye; Benoît Barbot; Benedikt Bollig; Martin Leucker; Daniel Neider; Rajarshi Roy 002 (GandALF, 2022)

Learning Temporal Logic Properties: an Overview of Two Recent Methods. - Jean-Raphaël Gaglione; Rajarshi Roy 002; Nasim Baharisangari; Daniel Neider; Zhe Xu 005; Ufuk Topcu (CoRR, 2022)

MaxSAT-based temporal logic inference from noisy data. - Jean-Raphaël Gaglione; Daniel Neider; Rajarshi Roy 002; Ufuk Topcu; Zhe Xu 005 (Innov. Syst. Softw. Eng., 2022)

Learning Interpretable Temporal Properties from Positive Examples Only. - Rajarshi Roy 002; Jean-Raphaël Gaglione; Nasim Baharisangari; Daniel Neider; Zhe Xu 005; Ufuk Topcu (AAAI, 2023)

Specification Sketching for Linear Temporal Logic. - Simon Lutz; Daniel Neider; Rajarshi Roy 002 (ATVA, 2023)

Reinforcement Learning with Temporal-Logic-Based Causal Diagrams. - Yash Paliwal; Rajarshi Roy 002; Jean-Raphaël Gaglione; Nasim Baharisangari; Daniel Neider; Xiaoming Duan; Ufuk Topcu; Zhe Xu 005 (CD-MAKE, 2023)

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. - Lina Ye; Igor Khmelnitsky; Serge Haddad; Benoît Barbot; Benedikt Bollig; Martin Leucker; Daniel Neider; Rajarshi Roy 002 (CoRR, 2023)

Inferring Properties in Computation Tree Logic. - Rajarshi Roy 002; Daniel Neider (CoRR, 2023)

Learning Temporal Properties is NP-hard. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (CoRR, 2023)

Analysis of recurrent neural networks via property-directed verification of surrogate models. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (Int. J. Softw. Tools Technol. Transf., 2023)

What Is Formal Verification Without Specifications? A Survey on Mining LTL Specifications. - Daniel Neider; Rajarshi Roy 002 (Principles of Verification (3), 2024)

Learning Branching-Time Properties in CTL and ATL via Constraint Solving. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (FM (1), 2024)

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider; Guillermo A. Pérez 001 (VMCAI (2), 2024)

The Complexity of Learning Temporal Properties. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (CoRR, 2024)

Learning Temporal Properties for Explainability and Verification. - Rajarshi Roy 002 (2024)

Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. - Ritam Raha; Rajarshi Roy 002; Nathanaël Fijalkow; Daniel Neider (J. Open Source Softw., 2024)

The Complexity of Learning LTL, CTL and ATL Formulas. - Benjamin Bordais; Daniel Neider; Rajarshi Roy 002 (STACS, 2025)

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems. - Rajarshi Roy 002; Yash Pote; David Parker 001; Marta Kwiatkowska (CoRR, 2025)

Robust computation tree logic. - Satya Prakash Nayak; Daniel Neider; Rajarshi Roy 002; Martin Zimmermann 002 (Innov. Syst. Softw. Eng., 2025)