Monotonicity analysis can speed up verification

Authors:
Marcelo F. Frias;Rodolfo Gamarra;Gabriela Steren;Lorena Bourg
Affiliations:
Department of Computer Science, School of Exact and Natural Sciences, Universidad de Buenos Aires, Argentina;Department of Computer Science, School of Exact and Natural Sciences, Universidad de Buenos Aires, Argentina;Department of Computer Science, School of Exact and Natural Sciences, Universidad de Buenos Aires, Argentina;Department of Computer Science, School of Exact and Natural Sciences, Universidad de Buenos Aires, Argentina
Venue:
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Year:
2006

Citing 9
Cited 0

Isomorph-free model enumeration: a new method for checking relational specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Alcoa: the alloy constraint analyzer

Proceedings of the 22nd international conference on Software engineering
Automating first-order relational logic

SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
A micromodularity mechanism

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Alloy: a lightweight object modelling notation

ACM Transactions on Software Engineering and Methodology (TOSEM)
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Reasoning about static and dynamic properties in alloy: A purely relational approach

ACM Transactions on Software Engineering and Methodology (TOSEM)
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.