Abstract
In software systems engineering, the generally understood goal of verification is to assess the compliance of a software component with respect to the inputs and standards applying to a given phase in the design process. The goal of validation is to determine if the requirements are correct and complete, and validation is performed in the final system assessment phase. Nevertheless, the introduction of formal methods in model based engineering tends to blur the boundary between verification and validation, by allowing validation tasks to be performed early in the process, before the system has been fully designed and implemented. In particular, we consider recent work using constraint satisfaction techniques to perform formal verification and validation tasks at model level. The purpose of this article is twofold. First, we attempt to fit the existing methods and tools in a global design, verification and validation process. Second, we show that in addition to verification and validation, constraint based techniques can be used to automate part of the design activity itself, by synthesizing correct by construction and quantitatively optimal models from a specification.
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
Anastasakis, K., Bordbar, B., Georg, G., Ray, I.: UML2Alloy: A Challenging Model Transformation. In: Engels, G., Opdyke, B., Schmidt, D.C., Weil, F. (eds.) MODELS 2007. LNCS, vol. 4735, pp. 436–450. Springer, Heidelberg (2007)
Bailleux, O., Boufkhad, Y., Roussel, O.: New encodings of Pseudo-Boolean constraints into CNF. In: SAT (2009)
Barrett, C., Stump, A., Tinelli, C.: The smt-lib standard: Version 2.0. In: Proceedings of the 8th International Workshop on Satisfiability Modulo Theories, Edinburgh, England (2010)
Berardi, D., Calvanese, D., Giacomo, G.D.: Reasoning on UML class diagrams. Artificial Intelligence 168 (October 2005)
Cabot, J., Clarisó, R., Riera, D.: Verification of UML/OCL Class Diagrams using Constraint Programming. In: ICSTW 2008 (2008)
Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7) (1962)
Gogolla, M., Büttner, F., Richters, M.: USE: A UML-based specification environment for validating UML and OCL. Sci. Comput. Program. 69(1-3) (2007)
Jackson, D.: Alloy: A logical modelling language. In: Bert, D., Bowen, J.P., King, S. (eds.) ZB 2003. LNCS, vol. 2651, p. 1. Springer, Heidelberg (2003)
Jeanneret, C., Eyer, L., Markovié, S., Baar, T.: RoclET: Refactoring OCL Expressions by Transformations. In: ICSSEA (2006)
Jussien, N., Rochart, G., Lorca, X.: The CHOCO constraint programming solver. In: CPAIOR 2008 Workshop on Open-Source Software for Integer and Contraint Programming (OSSICP 2008), Paris, France (June 2008)
Leberre, D.: SAT4J, a SATisfiability library for java (2004)
Leberre, D., Parrain, A.: À propos de l’extension d’un solveur SAT pour traiter des contraintes pseudo-booléennes. In: JFPC 2007 (2007)
Manquinho, V.M., Martins, R., Lynce, I.: Improving unsatisfiability-based algorithms for boolean optimization. In: SAT (2010)
Moskewicz, M., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC (2001)
Roache, P.J.: Verification and validation in computational science and engineering. Hermosa Publishers (1998)
de Roquemaurel, M., Polacsek, T., Rolland, J.F., Bodeveix, J.P., Filali, M.: Assistance à la conception de modèles à l’aide de contraintes. In: AFADL 2010 (2010)
Sen, S., Baudry, B., Vangheluwe, H.: Towards domain-specific model editors with automatic model completion. Simulation 86(2) (2010)
Soeken, M., Wille, R., Kuhlmann, M., Gogolla, M., Drechsler, R.: Verifying UML/OCL Models Using Boolean Satisfiability. In: Mller, W. (ed.) Proc. Design, Automation and Test in Europe, DATE 2010 (2010)
Steinberg, D., Budinsky, F., Paternostro, M., Merks, E.: EMF: Eclipse Modeling Framework 2.0. Addison-Wesley Professional, Reading (2009)
Tamura, N., Tanjo, T., Banbara, M.: Solving constraint satisfaction problems with SAT technology. In: Blume, M., Kobayashi, N., Vidal, G. (eds.) FLOPS 2010. LNCS, vol. 6009, pp. 19–23. Springer, Heidelberg (2010)
Torlak, E., Jackson, D.: Kodkod: A relational model finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632–647. Springer, Heidelberg (2007)
Tseitin, G.S.: On the complexity of derivations in the propositional calculus. Studies in Mathematics and Mathematical Logic II (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delmas, R., Doose, D., Pires, A.F., Polacsek, T. (2011). Supporting Model Based Design. In: Bellatreche, L., Mota Pinto, F. (eds) Model and Data Engineering. MEDI 2011. Lecture Notes in Computer Science, vol 6918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24443-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-24443-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24442-1
Online ISBN: 978-3-642-24443-8
eBook Packages: Computer ScienceComputer Science (R0)