default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPriyanka Darke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c13]Priyanka Darke, Bharti Chimdyalwar:
OLA: Property Directed Outer Loop Abstraction for Efficient Verification of Reactive Systems. ICSME 2023: 436-440- [c12]Priyanka Darke
, Bharti Chimdyalwar, Sakshi Agrawal, Shrawan Kumar, R. Venkatesh, Supratik Chakraborty:
VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution). TACAS (2) 2023: 588-593 - 2022
- [j1]Priyanka Darke, Ravindra Metta, Raveendra Kumar Medicherla, R. Venkatesh:
Impactful research and tooling for program correctness. Commun. ACM 65(11): 52-53 (2022) - 2021
- [c11]Priyanka Darke, Sakshi Agrawal, R. Venkatesh:
VeriAbs: A Tool for Scalable Verification by Abstraction (Competition Contribution). TACAS (2) 2021: 458-462 - 2020
- [c10]Mohammad Afzal, Supratik Chakraborty, Avriti Chauhan, Bharti Chimdyalwar, Priyanka Darke, Ashutosh Gupta, Shrawan Kumar, Charles Babu M, Divyesh Unadkat, R. Venkatesh:
VeriAbs : Verification by Abstraction and Test Generation (Competition Contribution). TACAS (2) 2020: 383-387
2010 – 2019
- 2019
- [c9]Mohammad Afzal, Asia A, Avriti Chauhan, Bharti Chimdyalwar, Priyanka Darke, Advaita Datar, Shrawan Kumar, R. Venkatesh:
VeriAbs : Verification by Abstraction and Test Generation. ASE 2019: 1138-1141 - 2018
- [c8]Bharti Chimdyalwar, Priyanka Darke:
Statically relating program properties for efficient verification (short WIP paper). LCTES 2018: 99-103 - [c7]Priyanka Darke, Sumanth Prabhu, Bharti Chimdyalwar, Avriti Chauhan, Shrawan Kumar, Animesh Basak Chowdhury, R. Venkatesh, Advaita Datar, Raveendra Kumar Medicherla:
VeriAbs: Verification by Abstraction and Test Generation - (Competition Contribution). TACAS (2) 2018: 457-462 - 2017
- [c6]Priyanka Darke, Bharti Chimdyalwar, Avriti Chauhan, R. Venkatesh:
Efficient Safety Proofs for Industry-Scale Code Using Abstractions and Bounded Model Checking. ICST 2017: 468-475 - [c5]Bharti Chimdyalwar, Priyanka Darke, Avriti Chauhan, Punit Shah, Shrawan Kumar, R. Venkatesh:
VeriAbs: Verification by Abstraction (Competition Contribution). TACAS (2) 2017: 404-408 - 2015
- [c4]Priyanka Darke, Bharti Chimdyalwar, R. Venkatesh, Ulka Shrotri, Ravindra Metta:
Over-approximating loops to prove properties using bounded model checking. DATE 2015: 1407-1412 - [c3]Bharti Chimdyalwar, Priyanka Darke, Anooj Chavda, Sagar Vaghani, Avriti Chauhan:
Eliminating Static Analysis False Positives Using Loop Abstraction and Bounded Model Checking. FM 2015: 573-576 - 2012
- [c2]Priyanka Darke, Mayur Khanzode, Arun Nair, Ulka Shrotri, R. Venkatesh:
Precise Analysis of Large Industry Code. APSEC 2012: 306-309
2000 – 2009
- 2009
- [c1]Prasad Bokil, Priyanka Darke, Ulka Shrotri, R. Venkatesh:
Automatic Test Data Generation for C Programs. SSIRI 2009: 359-368
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:01 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:
