Protocol proof checking simplified with SMT

Proceedings - IEEE 11th International Symposium on Network Computing and Applications, NCA 2012

Volumn , Issue , 2012, Pages 195-202

  Tuttle, Mark R ^a   Goel, Amit ^a  

^a INTEL CORPORATION   (United States)

Author keywords

consensus; Deductive Verification Framework (DVF); distributed computing; Formal methods; model checking; Satisfiability Modulo Theories (SMT); theorem proving

Indexed keywords

CONSENSUS; DEDUCTIVE VERIFICATION; DISTRIBUTED PROTOCOLS; FAULT-TOLERANT; FORMAL VERIFICATIONS; PROOF CHECKERS; PROOF CHECKING; PROTOCOL DESIGNERS; SATISFIABILITY MODULO THEORIES;

DISTRIBUTED COMPUTER SYSTEMS; FORMAL METHODS; MODEL CHECKING;

THEOREM PROVING;

EID: 84867965306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NCA.2012.46     Document Type: Conference Paper

References (25)

1. S. Doherty, L. Groves, V. Luchangco, and M. Moir, "Towards formally specifying and verifying transactional memory," Formal Aspects of Computing, Mar. 2012, doi:10.1007/s00165-012-0225-8.
2. S. Owre, N. Shankar, and J. Rushby, "PVS: A prototype verification system," in Proceedings of the 11th International Conference on Automated Deduction (CADE), ser. Lecture Notes in Artificial Intelligence, D. Kapur, Ed., vol. 607. Springer-Verlag, Jun. 1992, pp. 748-752.
3. E. M. Clarke, O. Grumberg, and D. Peled, Model Checking. MIT Press, 2001.
4. K. L. McMillan, "Parameterized verification of the FLASH cache coherence protocol by compositional model checking," in Proceedings of the 11th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), ser. Lecture Notes in Computer Science, vol. 2144. Springer, Sep. 2001, pp. 179-195. (Pubitemid 33332729)
5. C.-T. Chou, P. K. Mannava, and S. Park, "A simple method for parameterized verification of cache coherence protocols," in Proceedings of the 5th International Conference on Formal Methods in Computer-Aided Design (FMCAD), 2004.
6. S. Krstic, "Parameterized system verification with guard strengthening and parameter abstraction," in Automated Verification of Infinite State Systems, 2005.
7. M. Talupur and M. Tuttle, "Going with the flow: Parameterized verification using message flows," in Proceedings of the 8th International Conference on Formal Methods in Computer-Aided Design (FMCAD), Nov. 2008, pp. 69-76.
8. J. O'Leary, M. Talupur, and M. R. Tuttle, "Protocol verification using flows: An industrial experience," in Proceedings of the 9th International Conference on Formal Methods in Computer-Aided Design (FMCAD), Nov. 2009, pp. 172-179.
9. C. Barrett and C. Tinelli, "CVC3," in Proceedings of the 19th International Conference on Computer Aided Verification (CAV), 2007, pp. 298-302.
10. B. Dutertre and L. D. Moura, "The Yices SMT solver," SRI, Tech. Rep., 2006.
11. L. M. de Moura and N. Bjørner, "Z3: An efficient SMT solver," in Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2008, pp. 337-340.
12. A. Goel, S. Krstić, R. Leslie, and M. R. Tuttle, "SMT-based system verification with DVF," in Proceedings of the 10th Annual International Workshop on Satisfiability Modulo Theories (SMT Workshop), Manchester, Jun. 2012.
13. L. Lamport, Specifying Systems. Addison-Wesley, 2002.
14. C. N. Ip and D. L. Dill, "Better verification through symmetry," in Proceedings of the 11th International Conference on Computer Hardware Description Languages and their Applications (CHDL), 1993, pp. 97-111.
15. G. Holzman, The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2004.
16. N. A. Lynch and M. R. Tuttle, "An introduction to input/output automata," CWI Quarterly, vol. 2, no. 3, pp. 219-246, Sep. 1989.
17. M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of distributed consensus with one faulty process," Journal of the ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985. (Pubitemid 15488351)
18. M. Pease, R. Shostak, and L. Lamport, "Reaching agreement in the presence of faults," Journal of the ACM, vol. 27, no. 2, pp. 228-234, 1980.
19. C. Dwork and Y. Moses, "Knowledge and common knowledge in a byzantine environment: crash failures," Information and Computation, vol. 88, no. 2, pp. 156-186, Aug. 1990. (Pubitemid 20735592)
20. Y. Moses and M. R. Tuttle, "Programming simultaneous actions using common knowledge," Algorithmica, vol. 3, no. 1, pp. 121-169, 1988. (Pubitemid 18550591)
21. D. Dolev and H. R. Strong, "Authenticated algorithms for byzantine agreement," SIAM Journal of Computation, vol. 12, no. 4, pp. 656-666, Nov. 1983.
22. N. Lynch, Distributed Algorithms. Morgan Kauffman, 1996.
23. H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, 2004.
24. M. J. C. Gordon and T. F. Melham, Eds., Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
25. T. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL - A Proof Assistant for Higher-Order Logic, ser. Lecture Notes in Computer Science. Springer, 2002, vol. 2283.