Dileep Kini

According to our database1, Dileep Kini authored at least 15 papers between 2011 and 2018.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
What happens-after the first race? enhancing the predictive power of happens-before based dynamic race detection.
Proc. ACM Program. Lang., 2018

Data race detection on compressed traces.
Proceedings of the 2018 ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2018

2017
Verification of linear-time properties for finite probabilistic systems
PhD thesis, 2017

Optimal Translation of LTL to Limit Deterministic Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Dynamic race prediction in linear time.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Complexity of Model Checking MDPs against LTL Specifications.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2015
How Can Automatic Feedback Help Students Construct Automata?
ACM Trans. Comput. Hum. Interact., 2015

Limit Deterministic and Probabilistic Automata for LTL ∖ GU.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

FlashNormalize: Programming by Examples for Text Normalization.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Probabilistic Automata for Safety LTL Specifications.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2014

Decidable Problems for Unary PFAs.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Quantitative Information Flow in Boolean Programs.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

2013
Automated Grading of DFA Constructions.
Proceedings of the IJCAI 2013, 2013

2011
Using non-convex approximations for efficient analysis of timed automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

On Construction of Safety Signal Automata for $MITL[\: \mathcal{U}, \: \mathcal{S}]$ Using Temporal Projections.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2011


  Loading...