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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayardo Jr, R.J., Schrag, R.C.: Using CSP look-back techniques to solve real world SAT instances. In: Proc. of the 14th National Conf. on Artificial Intelligence, pp. 203–208 (1997)
Frias, M.F., Lopez Pombo, C.G., Baum, G.A., Aguirre, N., Maibaum, T.S.E.: Reasoning About Static and Dynamic Properties in Alloy: A Purely Relational Approach, to appear in ACM TOSEM (in press)
Goldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-Solver. In: Proceedings of DATE 2002, pp. 142–149 (2002)
Jackson, D.: Nitpick: A checkable specification language. In: Proceedings of the Workshop on Formal Methods in Software Practice, San Diego, Calif. (January 1996)
Jackson D.: Automating First-Order Relational Logic. In: Proceedings of SIGSOFT FSE 2000, Proc. ACM SIGSOFT Conf. Foundations of Software Engineering, San Diego, November 2000, pp. 130-139 (2000)
Jackson, D.: Alloy: A Lightweight Object Modelling Notation. ACM Transactions on Software Engineering and Methodology (TOSEM) 11(2), 256–290 (2002)
Jackson, D., Jha, S., Damon, C.A.: Isomorph-Free Model Enumeration: A New Method for Checking Relational Specifications. ACM TOPLAS 20(2), 302–343 (1998)
Jackson, D., Schechter, I., Shlyakhter, I.: Alcoa: the Alloy Constraint Analyzer. In: Proceedings of the International Conference on Software Engineering, Limerick, Ireland (June 2000)
Jackson, D., Shlyakhter, I., Sridharan, M.: A Micromodularity Mechanism. In: Proc. ACM SIGSOFT Conf. Foundations of Software Engineering/European Software Engineering Conference (FSE/ESEC 2001), Vienna (September 2001)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: 39th Design Automation Conference (DAC 2001), Las Vegas (June 2001)
Tarski, A., Givant, S.: A Formalization of Set Theory without Variables, vol. 41. A.M.S. Coll. Pub. (1987)
Wegener, I.: Branching Programs and Binary Decision Diagrams. In: SIAM Discrete Mathematics and Applications, SIAM, Philadelphia (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frias, M.F., Gamarra, R., Steren, G., Bourg, L. (2006). Monotonicity Analysis Can Speed Up Verification. In: Schmidt, R.A. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2006. Lecture Notes in Computer Science, vol 4136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11828563_12
Download citation
DOI: https://doi.org/10.1007/11828563_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37873-0
Online ISBN: 978-3-540-37874-7
eBook Packages: Computer ScienceComputer Science (R0)