default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRavindra Metta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Ravindra Metta
, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty:
PROTON: PRObes for Termination Or Not (Competition Contribution). TACAS (3) 2024: 393-398- [c20]Anand Yeolekar, Ravindra Metta, Samarjit Chakraborty:
SMT-based Control Safety Property Checking in Cyber-Physical Systems under Timing Uncertainties. VLSID 2024: 276-280 - [i2]Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty, Samarjit Chakraborty:
A shallow dive into the depths of non-termination checking for C programs. CoRR abs/2409.12985 (2024) - 2023
- [c19]Sanaa Siddiqui, Ravindra Metta, Kumar Madhukar:
Towards Multi-Language Static Code Analysis. ISSREW 2023: 81-82 - [c18]Ravindra Metta, Prasanth Yeduru, Hrishikesh Karmarkar, Raveendra Kumar Medicherla:
VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution). TACAS (2) 2023: 594-599 - 2022
- [j3]Priyanka Darke, Ravindra Metta, Raveendra Kumar Medicherla, R. Venkatesh:
Impactful research and tooling for program correctness. Commun. ACM 65(11): 52-53 (2022) - [c17]Anand Yeolekar, Ravindra Metta, Clara Hobbs, Samarjit Chakraborty:
Checking Scheduling-Induced Violations of Control Safety Properties. ATVA 2022: 100-116 - [c16]Ravindra Metta, Raveendra Kumar Medicherla, Samarjit Chakraborty:
BMC+Fuzz: Efficient and Effective Test Generation. DATE 2022: 1419-1424 - [c15]Ravindra Metta, Raveendra Kumar Medicherla, Hrishikesh Karmarkar:
VeriFuzz: Good Seeds for Fuzzing (Competition Contribution). FASE 2022: 341-346 - [c14]Hrishikesh Karmarkar, Raveendra Kumar Medicherla, Ravindra Metta, Prasanth Yeduru:
FuzzNT : Checking for Program Non-termination. ICSME 2022: 409-413
2010 – 2019
- 2019
- [j2]Martin Becker, Ravindra Metta, R. Venkatesh, Samarjit Chakraborty:
Scalable and precise estimation and debugging of the worst-case execution time for analysis-friendly processors: a comeback of model checking. Int. J. Softw. Tools Technol. Transf. 21(5): 515-543 (2019) - [c13]Samarjit Chakraborty, James H. Anderson, Martin Becker, Helmut Graeb, Samiran Halder, Ravindra Metta, Lothar Thiele, Stavros Tripakis, Anand Yeolekar:
Cross-Layer Interactions in CPS for Performance and Certification. DATE 2019: 1439-1444 - [c12]Martin Becker, Samarjit Chakraborty, Ravindra Metta, R. Venkatesh:
Imprecision in WCET estimates due to library calls and how to reduce it (WIP paper). LCTES 2019: 208-212 - 2018
- [c11]Anand Yeolekar, Ravindra Metta, R. Venkatesh, Samarjit Chakraborty:
Refining Task Specifications using Model Checking. RTCSA 2018: 185-191 - [i1]Martin Becker, Ravindra Metta, R. Venkatesh, Samarjit Chakraborty:
Scalable and Precise Estimation and Debugging of the Worst-Case Execution Time for Analysis-Friendly Processors. CoRR abs/1802.09239 (2018) - 2016
- [c10]Ravindra Metta, Martin Becker, Prasad Bokil, Samarjit Chakraborty, R. Venkatesh:
TIC: a scalable model checking based approach to WCET estimation. LCTES 2016: 72-81 - 2015
- [c9]Martin Becker, Sajid Mohamed, Karsten Albers, P. P. Chakrabarti, Samarjit Chakraborty, Pallab Dasgupta, Soumyajit Dey, Ravindra Metta:
Timing Analysis of Safety-Critical Automotive Software: The AUTOSAFE Tool Flow. APSEC 2015: 385-392 - [c8]Priyanka Darke, Bharti Chimdyalwar, R. Venkatesh, Ulka Shrotri, Ravindra Metta:
Over-approximating loops to prove properties using bounded model checking. DATE 2015: 1407-1412 - [c7]Kumar Madhukar, Mandayam K. Srivas, Björn Wachter, Daniel Kroening, Ravindra Metta:
Verifying synchronous reactive systems using lazy abstraction. DATE 2015: 1571-1574 - 2014
- [c6]Aniket Kulkarni, Ravindra Metta:
A code obfuscation framework using code clones. ICPC 2014: 295-299 - [c5]Aniket Kulkarni, Ravindra Metta:
A New Code Obfuscation Scheme for Software Protection. SOSE 2014: 409-414 - 2013
- [c4]Kumar Madhukar, Ravindra Metta, Ulka Shrotri, R. Venkatesh:
Trace based reachability verification for statecharts. FormaliSE@ICSE 2013: 22-28 - [c3]Kumar Madhukar, Ravindra Metta, Priyanka Singh, R. Venkatesh:
Reachability Verification of Rhapsody Statecharts. ICST Workshops 2013: 96-101 - 2011
- [c2]Ravindra Metta:
Verifying Code and Its Optimizations: An Experience Report. ICST Workshops 2011: 578-583 - 2010
- [j1]Srihari Sukumaran, Ashok Sreenivas, Ravindra Metta:
The dependence condition graph: Precise conditions for dependence between program points. Comput. Lang. Syst. Struct. 36(1): 96-121 (2010) - [c1]Ulka Shrotri, R. Venkatesh, Ravindra Metta:
Proving unreachability using bounded model checking. ISEC 2010: 73-82
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 2025-01-21 00:08 CET 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:
