Search for Author All Reviews
	Chadha, Rohit     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       Verification methods for the computationally complete symbolic attacker based on indistinguishability Bana G., Chadha R., Eeralla A., Okada M. ACM Transactions on Computational Logic 21(1): 1-44, 2019.  Type: Article First-order logic formalization for security protocols and attackers enables formal verification. Once a formalization is established, standard tools such as a theorem prover can be used in the analysis....... Dec 16 2019     A counterexample-guided abstraction-refinement framework for Markov decision processes Chadha R., Viswanathan M. ACM Transactions on Computational Logic 12(1): 1-49, 2010.  Type: Article In this paper, Chadha and Viswanathan study notions of counterexamples for finite-state Markov decision processes (MDPs). An appropriate definition of counterexamples is the most important ingredient for generalizing counterexample-gui...... Jul 19 2011
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy