1 citations · 1 across the 4 of their papers we have counts for
5 papers
Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
Chirantan Hebballi, Akash Poptani, Amrutha Benny +3
A Runtime Verification (RV) framework that supports online, at-speed verification of properties that can change dynamically (during in-field operations) will benefit a large variet…
Verification of Unbounded Client-Server Systems with Distinguishable Clients
Ramchandra Phawade, Tephilla Prince, S Sheerazuddin
Client-server systems are a computing paradigm in concurrent and distributed systems. We deal with unbounded client-server systems (UCS) where all clients are of the same type, int…
Bounded Model Checking for Unbounded Client Server Systems
Ramchandra Phawade, Tephilla Prince, S. Sheerazuddin
Bounded model checking (BMC) is an efficient formal verification technique which allows for desired properties of a software system to be checked on bounded runs of an abstract mod…
Kleene Theorems for Free Choice Nets Labelled with Distributed Alphabets
Ramchandra Phawade
We provided (PNSE'2014) expressions for free choice nets having "distributed choice property" which makes the nets "direct product" representable. In a recent work (PNSE'2016), we…
On Timed Scope-bounded Context-sensitive Languages
Devendra. Bhave, S. N. Krishna, Ramchandra Phawade +1
In (DLT 2016) we studied timed context sensitive languages characterized by multiple stack push down automata (MPA), with an explicit bound on number of stages where in each stage…