default search action
Dileep Kini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j2]Umang Mathur
, Dileep Kini, Mahesh Viswanathan:
What happens-after the first race? enhancing the predictive power of happens-before based dynamic race detection. Proc. ACM Program. Lang. 2(OOPSLA): 145:1-145:29 (2018) - [c12]Dileep Kini, Umang Mathur
Data race detection on compressed traces. ESEC/SIGSOFT FSE 2018: 26-37 - [i4]Dileep Kini, Umang Mathur, Mahesh Viswanathan:
Data Race Detection on Compressed Traces. CoRR abs/1807.08427 (2018) - [i3]Umang Mathur, Dileep Kini, Mahesh Viswanathan:
What Happens - After the First Race? Enhancing the Predictive Power of Happens - Before Based Dynamic Race Detection. CoRR abs/1808.00185 (2018) - 2017
- [b1]Dileep Raghunath Kini:
Verification of linear-time properties for finite probabilistic systems. University of Illinois Urbana-Champaign, USA, 2017 - [c11]Dileep Kini, Mahesh Viswanathan:
Complexity of Model Checking MDPs against LTL Specifications. FSTTCS 2017: 35:1-35:13 - [c10]Dileep Kini, Umang Mathur
Dynamic race prediction in linear time. PLDI 2017: 157-170 - [c9]Dileep Kini, Mahesh Viswanathan:
Optimal Translation of LTL to Limit Deterministic Automata. TACAS (2) 2017: 113-129 - [i2]Dileep Kini, Umang Mathur, Mahesh Viswanathan:
Dynamic Race Prediction in Linear Time. CoRR abs/1704.02432 (2017) - 2015
- [j1]Loris D'Antoni, Dileep Kini, Rajeev Alur, Sumit Gulwani, Mahesh Viswanathan, Björn Hartmann:
How Can Automatic Feedback Help Students Construct Automata? ACM Trans. Comput. Hum. Interact. 22(2): 9:1-9:24 (2015) - [c8]Dileep Kini, Sumit Gulwani:
FlashNormalize: Programming by Examples for Text Normalization. IJCAI 2015: 776-783 - [c7]Dileep Kini, Mahesh Viswanathan:
Limit Deterministic and Probabilistic Automata for LTL ∖ GU. TACAS 2015: 628-642 - 2014
- [c6]Rohit Chadha, Dileep Kini, Mahesh Viswanathan:
Quantitative Information Flow in Boolean Programs. POST 2014: 103-119 - [c5]Rohit Chadha, Dileep Kini, Mahesh Viswanathan:
Decidable Problems for Unary PFAs. QEST 2014: 329-344 - [c4]Dileep Kini, Mahesh Viswanathan:
Probabilistic Automata for Safety LTL Specifications. VMCAI 2014: 118-136 - 2013
- [c3]Rajeev Alur, Loris D'Antoni, Sumit Gulwani, Dileep Kini, Mahesh Viswanathan:
Automated Grading of DFA Constructions. IJCAI 2013: 1976-1982 - 2011
- [c2]Dileep Raghunath Kini, Shankara Narayanan Krishna, Paritosh K. Pandya:
On Construction of Safety Signal Automata for $MITL[\: \mathcal{U}, \: \mathcal{S}]$ Using Temporal Projections. FORMATS 2011: 225-239 - [c1]Frédéric Herbreteau, Dileep Kini, B. Srivathsan
Using non-convex approximations for efficient analysis of timed automata. FSTTCS 2011: 78-89 - [i1]Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz:
Using non-convex approximations for efficient analysis of timed automata. CoRR abs/1110.3704 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: