10 citations · 63 across the 43 of their papers we have counts for
52 papers
MightyPPL: Verification of MITL with Past and Pnueli Modalities
Hsi-Ming Ho, Shankara Narayanan Krishna, Khushraj Madnani +2
Metric Interval Temporal Logic (MITL) is a popular formalism for specifying properties of reactive systems with timing constraints. Existing approaches to using MITL in verificatio…
Openness And Partial Adjacency In One Variable TPTL
Shankara Narayanan Krishna, Khushraj Madnani, Agnipratim Nag +1
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and T…
An efficient quantifier elimination procedure for Presburger arithmetic
Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani +2
All known quantifier elimination procedures for Presburger arithmetic require doubly exponential time for eliminating a single block of existentially quantified variables. It has e…
Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete
Shankara Narayanan Krishna, Khushraj Nanik Madnani, Rupak Majumdar +1
We investigate the decidability of the fragment of Timed Propositional Temporal Logic (TPTL). We show that the satisfiability checking of TPTL is PSPACE-c…
Optimal Reads-From Consistency Checking for C11-Style Memory Models
Hünkar Can Tunç, Parosh Aziz Abdulla, Soham Chakraborty +3
Over the years, several memory models have been proposed to capture the subtle concurrency semantics of C/C++.One of the most fundamental problems associated with a memory model M…
Unified Fairness for Weak Memory Verification
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Adwait Godbole +2
We consider the verification of omega-regular linear temporal properties of concurrent programs running under weak memory semantics. We observe that in particular, these properties…