Abstract
In the last years, the concern with the correctness of programs has been leading programmers to enrich their programs with annotations following the principles of design-by-contract, in order to be able to guarantee their correct behaviour and to facilitate reuse of verified components without having to reconstruct proofs of correctness. In this paper we adapt the idea of specification-based slicing to the scope of (contract-based) program verification systems and behaviour specification languages. In this direction, we introduce the notion of contract-based slice of a program and show how any specification-based slicing algorithm can be used as the basis for a contract-based slicing algorithm. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Da Cruz, D., Henriques, P. R., & Sousa Pinto, J. (2010). Contract-based slicing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6415 LNCS, pp. 106–120). https://doi.org/10.1007/978-3-642-16558-0_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
