"Logic Wins!"

Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security properties. In particular, we examine confidentiality objectives in hardware circuit descriptions written in VHDL.

[1]  Bertram Fronhöfer,et al.  Workshop Theorem Proving with Analytic Tableaux and Related Methods, Lautenbach. Universität Karlsruhe, Fakultät für Informatik, Institut für Logik, Komplexität und Deduktionssysteme, Interner Bericht 8/92, March 18-20, 1992 , 1992, International Conference on Theorem Proving with Analytic Tableaux and Related Methods.

[2]  Jean Goubault-Larrecq,et al.  Deciding H1 by resolution , 2005, Inf. Process. Lett..

[3]  Jean Goubault-Larrecq,et al.  Cryptographic Protocol Analysis on Real C Code , 2005, VMCAI.

[4]  John C. Mitchell,et al.  Undecidability of bounded security protocols , 1999 .

[5]  K. Claessen,et al.  New Techniques that Improve MACE-style Finite Model Finding , 2007 .

[6]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[7]  Jean Goubault-Larrecq,et al.  Towards Producing Formally Checkable Security Proofs, Automatically , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[8]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9]  R. Bryant.  Graph-Based Algorithms for Boolean Function Manipulation12 , 1986 .

[10]  Pascal Lafourcade,et al.  Towards automated proofs for asymmetric encryption schemes in the random oracle model , 2008, CCS.

[11]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[12]  Charles Hymans.  Checking Safety Properties of Behavioral VHDL Descriptions by Abstract Interpretation , 2002, SAS.

[13]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[14]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[15]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[16]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[17]  Flemming Nielson,et al.  Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi , 2002, SAS.

[18]  Jean Goubault-Larrecq,et al.  Finite models for formal security proofs , 2010, J. Comput. Secur..

[19]  Jean Goubault-Larrecq.  Implementing Tableaux by Decision Diagrams , 1996 .

[20]  Christoph Weidenbach,et al.  Towards an Automatic Analysis of Security Protocols in First-Order Logic , 1999, CADE.

[21]  Jaime G. Carbonell,et al.  Automated Deduction — CADE-16 , 2002, Lecture Notes in Computer Science.

[23]  Jörg Würtz,et al.  Smallest Horn Clause Programs , 1996, J. Log. Program..

[24]  Simon S. Lam,et al.  A semantic model for authentication protocols , 1993, Proceedings 1993 IEEE Computer Society Symposium on Research in Security and Privacy.

[25]  Jean Goubault-Larrecq.  Deciding H 1 by Resolution ? , .

[26]  Bruno Blanchet,et al.  An efficient cryptographic protocol verifier based on prolog rules , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..