dc.creatorDegiovanni, Renzo Gastón
dc.creatorPonzio, Pablo Daniel
dc.creatorAguirre, Nazareno Matias
dc.creatorFrias, Marcelo Fabian
dc.date.accessioned2019-12-26T13:28:57Z
dc.date.accessioned2022-10-14T23:06:03Z
dc.date.available2019-12-26T13:28:57Z
dc.date.available2022-10-14T23:06:03Z
dc.date.created2019-12-26T13:28:57Z
dc.date.issued2018-03
dc.identifierDegiovanni, Renzo Gastón; Ponzio, Pablo Daniel; Aguirre, Nazareno Matias; Frias, Marcelo Fabian; Improving lazy abstraction for SCR specifications through constraint relaxation; John Wiley & Sons Ltd; Software Testing, Verification & Reliability; 28; 2; 3-2018
dc.identifier0960-0833
dc.identifierhttp://hdl.handle.net/11336/92885
dc.identifier1099-1689
dc.identifierCONICET Digital
dc.identifierCONICET
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/4317421
dc.description.abstractFormal requirements specifications, eg, software cost reduction (SCR) specifications, are challenging to analyse using automated techniques such as model checking. Since such specifications are meant to capture requirements, they tend to refer to real-world magnitudes often characterized through variables over large domains. At the same time, they feature a high degree of nondeterminism, as opposed to other analysis contexts such as (sequential) program verification. This makes model checking of SCR specifications difficult even for symbolic approaches. Moreover, automated abstraction refinement techniques such as counterexample guided abstraction refinement fail in many cases in this context, since the concrete state space is typically large, and reaching specific states of interest may require complex executions involving many different states, causing these approaches to perform many abstraction refinements, and making them ineffective in practice. In this paper, an approach to tackle the above situation, through a 2-stage abstraction, is presented. The specification is first relaxed, by disregarding the constraints imposed in the specification by physical laws or by the environment, before being fed to a counterexample guided abstraction refinement procedure, tailored to SCR. By relaxing the original specification, shorter spurious counterexamples are produced, favouring the abstraction refinement through the introduction of fewer abstraction predicates. Then, when a counterexample is concretizable with respect to the relaxed (concrete) specification but it is spurious with respect to the original specification, an efficient though incomplete refinement step is applied to the constraints, to cause the removal of the spurious case. This approach is experimentally assessed, comparing it with related techniques in the verification of properties and in automated test case generation, using various SCR specifications drawn from the literature as case studies. The experiments show that this new approach runs faster and scales better to larger, more complex specifications than related techniques.
dc.languageeng
dc.publisherJohn Wiley & Sons Ltd
dc.relationinfo:eu-repo/semantics/altIdentifier/url/https://onlinelibrary.wiley.com/doi/full/10.1002/stvr.1657
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/https://doi.org/10.1002/stvr.1657
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subjectLAZY ABSTRACTION
dc.subjectMODEL CHECKING
dc.subjectREQUIREMENTS SPECIFICATION
dc.subjectSOFTWARE COST REDUCTION (SCR)
dc.titleImproving lazy abstraction for SCR specifications through constraint relaxation
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución