activity
20162022
most citedScalable and Precise Estimation and Debugging of the Worst-Case Execution Time for Analysis-Friendly Processors

8 citations · 10 across the 5 of their papers we have counts for

collaborators

5 papers

cs.SE2022

Automated Validation of Insurance Applications against Calculation Specifications

Advaita Datar, Amey Zare, Asia A +3

Insurance companies rely on their Legacy Insurance System (LIS) to govern day-to-day operations. These LIS operate as per the companys business rules that are formally specified in…

cs.SE2021★ 1 cited

Direct Construction of Program Alignment Automata for Equivalence Checking

Manish Goyal, Muqsit Azeem, Kumar Madhukar +1

The problem of checking whether two programs are semantically equivalent or not has a diverse range of applications, and is consequently of substantial importance. There are severa…

cs.SE2018★ 8 cited

Scalable and Precise Estimation and Debugging of the Worst-Case Execution Time for Analysis-Friendly Processors

Martin Becker, Ravindra Metta, R Venkatesh +1

Estimating the Worst-Case Execution Time (WCET) of an application is an essential task in the context of developing real-time or safety-critical software, but it is also a complex…

cs.PL2016★ 1 cited

Scaling Bounded Model Checking By Transforming Programs With Arrays

Anushri Jana, Uday P. Khedker, Advaita Datar +2

Bounded Model Checking is one the most successful techniques for finding bugs in program. However, for programs with loops iterating over large-sized arrays, bounded model checkers…

cs.LO2016

Scaling Bounded Model Checking By Transforming Programs With Arrays

Anushri Jana, Uday P. Khedker, Advaita Datar +2

Bounded Model Checking is one the most successful techniques for finding bugs in program. However, model checkers are resource hungry and are often unable to verify programs with l…