His primary areas of investigation include Correctness, Formal verification, Model checking, Theoretical computer science and Programming language. Mahesh Viswanathan usually deals with Correctness and limits it to topics linked to Formal specification and Formal methods, Specification language and System requirements. His Model checking research includes themes of Statistical hypothesis testing, Probabilistic logic, Monte Carlo method and Software.
His research integrates issues of Algorithm, Sample, Operator and Black box in his study of Monte Carlo method. His Algorithm research is multidisciplinary, relying on both Random variable, Symmetric difference, Combinatorics, Set and Function. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Probabilistic encryption, Encryption, Key distribution and Public-key cryptography.
Mahesh Viswanathan mainly focuses on Theoretical computer science, Algorithm, Discrete mathematics, Model checking and Decidability. His studies deal with areas such as Finite-state machine and Time complexity as well as Theoretical computer science. Mahesh Viswanathan combines subjects such as Property, Probabilistic logic, Set and Markov chain with his study of Algorithm.
He interconnects Fragment, Quantum finite automata, Combinatorics, Probabilistic automaton and Hybrid system in the investigation of issues within Discrete mathematics. His Model checking study incorporates themes from Correctness, Network simulation, Semantics, Communications protocol and Heuristics. His Correctness research also works with subjects such as
His primary scientific interests are in Algorithm, Automaton, Discrete mathematics, Model checking and Theoretical computer science. His study in Algorithm is interdisciplinary in nature, drawing from both Probabilistic logic, Bounded function, Relation and Markov chain. His Automaton research integrates issues from Affine transformation, Applied mathematics and Counterexample.
His studies in Discrete mathematics integrate themes in fields like Regular language and Combinatorics. In his study, which falls under the umbrella issue of Model checking, Linear temporal logic is strongly linked to Markov decision process. The concepts of his Theoretical computer science study are interwoven with issues in Cryptographic protocol, Cryptographic primitive, Formal methods and Software.
Mahesh Viswanathan mainly investigates Hybrid system, Algorithm, Automaton, Linear system and Reachability. The study incorporates disciplines such as Automotive engineering, State space and Benchmark in addition to Hybrid system. His study in the field of Model checking is also linked to topics like Superposition principle.
He has included themes like Affine transformation, Discrete mathematics, Counterexample and Applied mathematics in his Automaton study. The various areas that he examines in his Linear system study include Dimension, Sequence, Set and Contrast. His Reachability research includes elements of Data-driven, Randomized algorithm, Complex system and Computer engineering.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
An Approximate L 1 -Difference Algorithm for Massive Data Streams
Joan Feigenbaum;Sampath Kannan;Martin J. Strauss;Mahesh Viswanathan.
SIAM Journal on Computing (2003)
Statistical model checking of black-box probabilistic systems
Koushik Sen;Mahesh Viswanathan;Gul Agha.
computer aided verification (2004)
Java-MaC: A Run-Time Assurance Approach for Java Programs
Moonzoo Kim;Mahesh Viswanathan;Sampath Kannan;Insup Lee.
formal methods (2004)
On statistical model checking of stochastic systems
Koushik Sen;Mahesh Viswanathan;Gul Agha.
computer aided verification (2005)
An approximate L/sup 1/-difference algorithm for massive data streams
J. Feigenbaum;S. Kannan;M. Strauss;M. Viswanathan.
foundations of computer science (1999)
Java-MaC: A Run-time Assurance Tool for Java Programs
Moonjoo Kim;Sampath Kannan;Insup Lee;Oleg Sokolsky.
runtime verification (2001)
Runtime Assurance Based On Formal Specifications
Insup Lee;Sampath Kannan;Moonjoo Kim;Oleg Sokolsky.
parallel and distributed processing techniques and applications (1999)
The relationship between public key encryption and oblivious transfer
Y. Gertner;S. Kannan;T. Malkin;O. Reingold.
foundations of computer science (2000)
VESTA: A statistical model-checker and analyzer for probabilistic systems
K. Sen;M. Viswanathan;G. Agha.
quantitative evaluation of systems (2005)
Formally specified monitoring of temporal properties
Moonjoo Kim;M. Viswanathan;H. Ben-Abdallah;S. Kannan.
euromicro conference on real time systems (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: