 IDEALS Home
 →
 College of Engineering
 →
 Dept. of Computer Science
 →
 Research and Tech Reports  Computer Science
 →
 Browse Research and Tech Reports  Computer Science by Author
Browse Research and Tech Reports  Computer Science by Author "Viswanathan, Mahesh"
Now showing items 120 of 23

Sobeih, Ahmed A.; Viswanathan, Mahesh; Hou, Jennifer C. (200504)Network simulators perform well in evaluating the performance of network protocols, but lack the capability of verifying their correctness. In order to address this lacuna, we have extended the J Sim network simulator ...
application/pdf
PDF (185kB) 
Chadha, Rohit; Legay, Axel; Prabhakar, Pavithra; Viswanathan, Mahesh (Springer Verlag, 2009)We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software systems. We model timed software systems ...
application/pdf
PDF (232kB) 
Alur, Rajeev; Kumar, Viraj; Madhusudan, P.; Viswanathan, Mahesh (200504)We study congruences on words in order to characterize the class of visibly pushdown languages (VPL), a subclass of contextfree languages. For any language L, we define a natural congruence on words that resembles the ...
application/pdf
PDF (263kB) 
Chadha, Rohit; Viswanathan, Mahesh (200706)We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have ( possibly) infinitely many control states along with an auxiliary ...
application/pdf
PDF (266kB) 
Prabhakar, Pavithra; Vladimerou, Vladimeros; Viswanathan, Mahesh; Dullerud, Geir E. (200801)The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows ...
application/pdf
PDF (193kB) 
Bhattiprolu, Vijay; Gordon, Spencer; Viswanathan, Mahesh (20170623)We prove an analog of Parikh's theorem for weighted contextfree grammars over commutative, idempotent semirings, and exhibit a stochastic contextfree grammar with behavior that cannot be realized by any stochastic ...
application/pdf
PDF (299kB) 
Roohi, Nima; Prabhakar, Pavithra; Viswanathan, Mahesh (2016)
application/pdf
PDF (660kB) 
Sobeih, Ahmed A.; Viswanathan, Mahesh; Hou, Jennifer C. (200407)Existing network simulators perform reasonably well in evaluating the performance of network protocols, but lack the capability of verifying the correctness of network protocols. In this paper, we present our ongoing ...
application/pdf
PDF (274kB) 
Vardhan, Abhay; Viswanathan, Mahesh (200508)We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of ...
application/pdf
PDF (232kB) 
Vardhan, Abhay; Sen, Koushik; Viswanathan, Mahesh; Agha, Gul A. (200406)We present a novel approach for verifying safety properties of finite state machines communicating over unbounded FIFO channels that is based on applying machine learning techniques. We assume that we are given a model of ...
application/pdf
PDF (336kB) 
Kumar, Viraj; Madhusudan, P.; Viswanathan, Mahesh (200606)Boolean programs with recursion are convenient abstractions of sequential, imperative programs. Recursive state machines (RSM) serve as machine models for Boolean programs and are semantically equivalent to pushdown automata. ...
application/pdf
PDF (330kB) 
Sen, Koushik; Viswanathan, Mahesh (200601)In order to make multithreaded programming manageable, programmers often follow a design principle where they break the problem into tasks which are then solved asynchronously and concurrently on different threads. This ...
application/pdf
PDF (154kB) 
Sen, Koushik; Viswanathan, Mahesh; Agha, Gul A. (200601)We investigate the problem of model checking Intervalvalued Discretetime Markov Chains (IDTMC). IDTMCs are discretetime finite Markov Chains for which the exact transition probabilities are not known. Instead in IDTMCs, ...
application/pdf
PDF (246kB) 
Bauer, Matthew S; Chadha, Rohit; Viswanathan, Mahesh (2017)Security protocols that provide privacy and anonymity guarantees are growing increasingly prevalent in the online world. The highly intricate nature of these protocols makes them vulnerable to subtle design flaws. Formal ...
application/pdf
PDF (558kB) 
Sen, Koushik; Viswanathan, Mahesh; Agha, Gul A. (200412)Statistical methods to model check stochastic systems have been, thus far, developed only for a sublogic of continuous stochastic logic (CSL) that does not have steady state operators and unbounded until formulas. In this ...
application/pdf
PDF (230kB) 
Chadha, Rohit; Sistla, A. Parsad; Viswanathan, Mahesh (200902)The continuous runtime monitoring of the behavior of a system is a technique that is used both as a complementary approach to formal verification and testing to ensure reliability, as well as a means to discover emergent ...
application/pdf
PDF (368kB) 
Chadha, Rohit; Sistla, A. Parsad; Viswanathan, Mahesh (200902)The continuous runtime monitoring of the behavior of a system is a technique that is used both as a complementary approach to formal verification and testing to ensure reliability, as well as a means to discover emergent ...
application/pdf
PDF (368kB) 
Kini, Dileep; Viswanathan, Mahesh (2017)A crucial step in model checking Markov Decision Processes (MDP) is to translate the LTL specification into automata. Efforts have been made in improving deterministic automata construction for LTL but such translations ...
application/pdf
PDF (452kB) 
Kini, Dileep; Viswanathan, Mahesh (2015)LTL\GU is a fragment of linear temporal logic (LTL), where negations appear only on propositions, and formulas are built using the temporal operators X (next), F (eventually), G (always), and U (until, with the restriction ...
application/pdf
PDF (368kB) 
Hendrix, Joe; Ohsaki, Hitoshi; Viswanathan, Mahesh (200602)In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates ...
application/pdf
PDF (307kB)
Now showing items 120 of 23