Rajarshi Roy

Orcid: 0000-0002-0202-1169

Affiliations:
  • Max Planck Institute for Software Systems, Kaiserslautern, Germany
  • Chennai Mathematical Institute, Chennai, India (former)


According to our database1, Rajarshi Roy authored at least 27 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic.
J. Open Source Softw., January, 2024

The Complexity of Learning Temporal Properties.
CoRR, 2024

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2024

Learning Branching-Time Properties in CTL and ATL via Constraint Solving.
Proceedings of the Formal Methods - 26th International Symposium, 2024

2023
Analysis of recurrent neural networks via property-directed verification of surrogate models.
Int. J. Softw. Tools Technol. Transf., June, 2023

Learning Temporal Properties is NP-hard.
CoRR, 2023

Inferring Properties in Computation Tree Logic.
CoRR, 2023

Analyzing Robustness of Angluin's L<sup>*</sup> Algorithm in Presence of Noise.
CoRR, 2023

Reinforcement Learning with Temporal-Logic-Based Causal Diagrams.
Proceedings of the Machine Learning and Knowledge Extraction, 2023

Specification Sketching for Linear Temporal Logic.
Proceedings of the Automated Technology for Verification and Analysis, 2023

Learning Interpretable Temporal Properties from Positive Examples Only.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
MaxSAT-based temporal logic inference from noisy data.
Innov. Syst. Softw. Eng., 2022

Learning Temporal Logic Properties: an Overview of Two Recent Methods.
CoRR, 2022

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise.
Proceedings of the 13th International Symposium on Games, 2022

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Expanding the Horizon of Linear Temporal Logic Inference for Explainability.
Proceedings of the 30th IEEE International Requirements Engineering Conference Workshops, 2022

Robust Computation Tree Logic.
Proceedings of the NASA Formal Methods - 14th International Symposium, 2022

2021
Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic.
CoRR, 2021

Learning Linear Temporal Properties from Noisy Data: A MaxSAT Approach.
CoRR, 2021

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search.
Proceedings of the 15th International Conference on Grammatical Inference, 2021

QUGA - Quality Guarantees for Autoencoders.
Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, 2021

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks.
Proceedings of the Automated Technology for Verification and Analysis, 2021

Learning Linear Temporal Properties from Noisy Data: A MaxSAT-Based Approach.
Proceedings of the Automated Technology for Verification and Analysis, 2021

2020
Property-Directed Verification of Recurrent Neural Networks.
CoRR, 2020

Quality Guarantees for Autoencoders via Unsupervised Adversarial Attacks.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

Learning Interpretable Models in the Property Specification Language.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2018
On Verifying TSO Robustness for Event-Driven Asynchronous Programs.
Proceedings of the Networked Systems - 6th International Conference, 2018


  Loading...