The Succinct Solver Suite

The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. The solvers have proved to be useful for a variety of applications including security properties of Java Card byte-code, access control features of Mobile and Discretionary Ambients, and validation of protocol narrations formalised in a suitable process algebra. Both solvers operate over finite domains although they can cope with regular sets of trees by direct encoding of the tree grammars; they differ in fine details about the demands on the universe and the extent to which universal quantification is allowed. A number of transformation strategies, mainly automatic, have been studied aiming on the one hand to increase the efficiency of the solving process, and on the other hand to increase the ease with which users can develop analyses. The results from benchmarking against state-of-the-art solvers are encouraging.

[1]  Flemming Nielson,et al.  Security for Mobility , 2002, FOSAD.

[2]  David A. McAllester.  On the complexity analysis of static analyses , 1999, JACM.

[3]  Flemming Nielson,et al.  Observation Predicates in Flow Logic , 2003 .

[4]  Flemming Nielson,et al.  Automatic Complexity Analysis , 2002, ESOP.

[5]  René Rydhof Hansen.  A Prototype Tool for JavaCard Firewall Analysis , 2002 .

[6]  David A. Schmidt,et al.  The Essence of Computation , 2002 .

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

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[9]  Flemming Nielson,et al.  A Succinct Solver for ALFP , 2002, Nord. J. Comput..

[10]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[11]  Flemming Nielson,et al.  Principles of Program Analysis , 1999, Springer Berlin Heidelberg.

[12]  Henrik Pilegaard.  A feasibility Study: The Succinct Solver v2.0, XSB Prolog v2.6, and Flow-Logic Based Program Analysis for Carmel , 2003 .

[13]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[14]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[15]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[16]  Flemming Nielson,et al.  Flow Logic: A Multi-paradigmatic Approach to Static Analysis , 2002, The Essence of Computation.

[17]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[18]  Flemming Nielson,et al.  Experiments with Succinct Solvers , 2002 .

[19]  Phokion G. Kolaitis.  Implicit definability on finite structures and unambiguous computations , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[20]  Divesh Srivastava,et al.  The CORAL deductive system , 1994, The VLDB Journal.

[21]  Flemming Nielson,et al.  Automatic validation of protocol narration , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..