Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Personal communication with Luis Fernando P. de Castro from the XSB team, http://sourceforge.net/mailarchive/message.php?msg_id=4349555
Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols – The Spi calculus. Information and Computation 148(1), 1–70 (1999)
Apt, K., Blair, H., Walker, A.: A theory of declarative programming. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Francisco (1988)
Bodei, C., Buchholtz, M., Degano, P., Nielson, F., Riis Nielson, H.: Automatic validation of protocol narration. In: Proceedings of the 16th Computer Security Foundations Workshop (CSFW 2003), pp. 126–140. IEEE Computer Society Press, Los Alamitos (2003)
Buchholtz, M., Nielson, F., Riis Nielson, H.: Experiments with Succinct Solvers. Technical Report IMM-TR-2002-4, Informatics and Mathematical Modelling, Technical University of Denmark (2002)
Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Chandra, A., Harel, D.: Computable queries for relational data bases. Journal of Computer and System Sciences 21(2), 156–178 (1980)
Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: POPL 1997, pp. 238–252. ACM Press, New York (1997)
Rydhof Hansen, R.: A prototype tool for JavaCard firewall analysis. In: Nordic Workshop on Secure IT-Systems, NordSec 2002, Karlstad, Sweden, Proceedings published as Karlstad University Studies 2002:31 (November 2002)
Kolaitis, P.G.: Implicit definability on finite structures and unambiguous computations (preliminary report). In: 5th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 168–180 (1990)
Marlet, R.: DeMoney: Java Card implementation. SECSAFE-TL-008, Trusted Logic (November 2002)
McAllester, D.: On the complexity analysis of static analyses. In: Cortesi, A., Filé, G. (eds.) SAS 1999. LNCS, vol. 1694, pp. 312–329. Springer, Heidelberg (1999)
Nielson, F., Riis Nielson, H., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)
Nielson, F., Riis Nielson, H., Seidl, H.: Automatic Complexity Analysis. In: Le Métayer, D. (ed.) ESOP 2002. LNCS, vol. 2305, pp. 243–261. Springer, Heidelberg (2002)
Nielson, F., Riis Nielson, H., Sun, H.: Observation predicates in Flow Logic. Secsafe-imm-010, Informatics and Mathematical Modelling, Technical University of Denmark (September 2003)
Nielson, F., Seidl, H., Riis Nielson, H.: A Succinct Solver for ALFP. Nordic Journal of Computing 9, 335–372 (2002)
Riis Nielson, H., Nielson, F.: Flow Logic: a multi-paradigmatic approach to static analysis. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 223–244. Springer, Heidelberg (2002)
Riis Nielson, H., Nielson, F., Buchholtz, M.: Security for mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2001. LNCS, vol. 2946, pp. 207–265. Springer, Heidelberg (2004)
Pilegaard, H.: A feasibility study - the Succinct Solver v.2.0, XSB Prolog v.2.6, and flow-logic based program analysis for Carmel. SECSAFE-IMM-008, Informatics and Mathematical Modelling, Technical University of Denmark (October 2003)
Ramakrishnan, R., Srivastava, D., Sudarshan, S., Seshadri, P.: The CORAL Deductive System. VLDB Journal 3(2), 161–210 (1994)
Sagonas, K., Swift, T., Warren, D.S., Freire, J., Rao, P., Cui, B., Johnson, E.: The XSB System (2003), Web page: http://xsb.sourceforge.net/
Siveroni, I.: SecSafe (2003), Web page: http://www.doc.ic.ac.uk/~siveroni/secsafe/
Sun, H., Riis Nielson, H., Nielson, F.: Extended features in the Succinct Solver (V2.0). SECSAFE-IMM-009, Informatics and Mathematical Modelling, Technical University of Denmark (October 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nielson, F. et al. (2004). The Succinct Solver Suite. In: Jensen, K., Podelski, A. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2004. Lecture Notes in Computer Science, vol 2988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24730-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-24730-2_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21299-7
Online ISBN: 978-3-540-24730-2
eBook Packages: Springer Book Archive