@inbook{5d2505e25056483bbf538c0bf1665068,
title = "The Succinct Solver Suite",
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 bytecode, 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.",
author = "Flemming Nielson and Nielson, {Hanne Riis} and Hongyan Sun and Mikael Buchholtz and Hansen, {Ren{\'e} Rydhof} and Henrik Pilegaard and Helmut Seidl",
year = "2004",
doi = "10.1007/978-3-540-24730-2_21",
language = "English",
isbn = "354021299X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "251--265",
editor = "Kurt Jensen and Andreas Podelski",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}