Monotonicity Analysis Can Speed Up Verification

We introduce a strategy for the verification of relational specifications based on the analysis of monotonicity of variables within formulas. By comparing with the Alloy Analyzer, we show that for a relevant class of problems this technique outperforms analysis of the same problems using SAT-solvers, while consuming a fraction of the memory SAT-solvers require.

[1]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[2]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[3]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[4]  Daniel Jackson.  Nitpick: A Checkable Specification Language , 1996 .

[5]  Manu Sridharan,et al.  A micromodularity mechanism , 2001, ESEC/FSE-9.

[6]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[7]  Daniel Jackson,et al.  Alloy: a lightweight object modelling notation , 2002, TSEM.

[8]  Daniel Jackson,et al.  Alcoa: the Alloy constraint analyzer , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[9]  Nazareno Aguirre,et al.  Reasoning about static and dynamic properties in alloy , 2005, ACM Trans. Softw. Eng. Methodol..

[10]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[11]  Daniel Jackson.  Automating first-order relational logic , 2000, SIGSOFT '00/FSE-8.

[12]  Somesh Jha,et al.  Isomorph-free model enumeration: a new method for checking relational specifications , 1998, TOPL.