Share This Author
Introduction to the Theory of Computation
- Mahesh Viswanathan
Exercise 1. A 2-counter machine (2CM) has a finite state control, and two stacks on which it can push and pop tokens, where these tokens are all alike. The transition function for a 2CM takes as…
Statistical Model Checking of Black-Box Probabilistic Systems
The authors' algorithm checks, based on statistical hypothesis testing, whether the sample provides evidence to conclude the satisfaction or violation of a property, and computes a quantitative measure (p-value of the tests) of confidence in its answer, and may, at least in some cases, be faster than previous analysis methods.
On Statistical Model Checking of Stochastic Systems
A statistical model checking algorithm that also verifies CSL formulas with unbounded untils, based on Monte Carlo simulation of the model and hypothesis testing of the samples, as opposed to sequential hypothesis testing is presented.
VESTA: A statistical model-checker and analyzer for probabilistic systems
- Koushik Sen, Mahesh Viswanathan, G. Agha
- Computer ScienceSecond International Conference on the…
- 19 September 2005
We give a brief overview of a statistical model-checking and analysis tool VESTA. VESTA is a tool for statistical analysis of probabilistic systems. It supports statistical model-checking and…
The relationship between public key encryption and oblivious transfer
- Yael Gertner, Sampath Kannan, T. Malkin, O. Reingold, Mahesh Viswanathan
- Computer Science, MathematicsProceedings 41st Annual Symposium on Foundations…
- 12 November 2000
The main results show that public-key encryption and oblivious transfer are incomparable under black-box reductions and neither oblivious transfer nor trapdoor predicates imply trapdoor permutations.
Model-Checking Markov Chains in the Presence of Uncertainties
The PCTL model checking problem for both Uncertain Markov Chain semantics and Interval Markov Decision Process semantics is decidable in PSPACE, and lower bounds for these model checking problems are proved.
- Funda Ergün, Sampath Kannan, Ravi Kumar, R. Rubinfeld, Mahesh Viswanathan
- Computer ScienceSTOC '98
- 23 May 1998
This work presents spot-checkers for sorting, convex hull, element distinctness, set containment, set equality, total orders, and correctness of group and field operations and shows that the spot-checking model can be applied to problems in a wide range of areas, including problems regarding graphs, sets, and algebra.
Runtime Assurance Based On Formal Specifications
The Monitoring and Checking (MaC) framework which assures the correctness of the current execution at run-time and two languages to specify monitoring scripts and requirements are presented.
A Higher Order Modal Fixed Point Logic
We present a higher order modal fixed point logic (HFL) that extends the modal μ-calculus to allow predicates on states (sets of states) to be specified using recursively defined higher order…
An Approximate L1-Difference Algorithm for Massive Data Streams
A space-efficient, one-pass algorithm for approximating the L1-difference between two functions, when the function values ai and bi are given as data streams, and their order is chosen by an adversary.