The Succinct Solver of Nielson and Seidl is based on the Alternation-free Least Fixed Point Logic and it is implemented in SML using a combination of recursion, continuations, prefix trees and memoisation. It is known that the actual formulation of the analysis has a great impact on the execution time of the solver and the aim of this note is to provide some insight into which formulations are better than others. The experiments addresses three general issues: (i) the order of the parameters of relations, (ii) the order of conjuncts in preconditions and (iii) the use of memoisation. The experiments are performed for Control Flow Analyses for Discretionary Ambients.
Succinct Solver; Control Flow Analysis; Program Analysis; Constraint solving; Discretionary Ambients