 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 1124 of 24

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) 
Korthikanti, Vijay Anand; Viswanathan, Mahesh; Kwon, YoungMin; Agha, Gul A. (2010)We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as exhibiting a behavior that is a sequence of ...
application/pdf
PDF (404kB) 
Roohi, Nima; Viswanathan, Mahesh (Springer, 20140623)Initialized hybrid automata with linear differential inclusions and rectangular constraints are hybrid automata where the invariants, guards, resets, and initial values are given by rectangular constraints, the flows are ...
application/pdf
PDF (1MB) 
Chadha, Rohit; Sistla, A. Parsad; Viswanathan, Mahesh (20170418)We consider the problem of verifying the security of finitely many sessions of a protocol that tosses coins in addition to standard cryptographic primitives against a DolevYao adversary. Two properties are investigated ...
application/pdf
PDF (457kB) 
Sobeih, Ahmed A.; d'Amorim, Marcelo; Viswanathan, Mahesh; Marinov, Darko; Hou, Jennifer C. (200708)Verification and Validation (V&V) is a critically important phase in the development life cycle of a simulation model. In the context of network simulation, traditional network simulators perform well in using a simulation ...
application/pdf
PDF (298kB)
Now showing items 1124 of 24