Alpuente Frasnedo, M.; Pardo Pont, D.; Villanueva García, A. (2018). Abstract Contract Synthesis and Verification in the Symbolic K Framework. Universitat Politècnica de València. http://hdl.handle.net/10251/100304
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/100304
Título:
|
Abstract Contract Synthesis and Verification in the Symbolic K Framework
|
Autor:
|
Alpuente Frasnedo, María
Pardo Pont, Daniel
Villanueva García, Alicia
|
Entidad UPV:
|
Universitat Politècnica de València. Grupo de Extensiones de la Programación Lógica (ELP)
Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
|
Fecha difusión:
|
|
Resumen:
|
[EN] In this article, we propose a symbolic technique that can be used for automatically inferring software contracts from programs that are written in a non-trivial fragment of C, called KernelC, that supports pointer-based ...[+]
[EN] In this article, we propose a symbolic technique that can be used for automatically inferring software contracts from programs that are written in a non-trivial fragment of C, called KernelC, that supports pointer-based structures and heap manipulation. Starting from the semantic definition of KernelC in the K semantic framework, we enrich the symbolic execution facilities recently provided by K with novel capabilities for contract synthesis that are based on abstract subsumption. Roughly speaking, we define an abstract symbolic technique that axiomatically explains the execution of any (modifier) C function by using other (observer) routines in the same program. We implemented our technique in the automated tool KindSpec 2.1, which generates logical axioms that express pre- and postcondition assertions which define the precise input/output behavior of the C routines. Thanks to the integrated support for symbolic execution and deductive verification provided by K, some synthesized axioms that cannot be guaranteed to be correct by construction due to abstraction can finally be verified in our framework with little effort.
[-]
|
Palabras clave:
|
Contract
,
Inference
,
Symbolic execution
,
Abstract
,
Subsumption
,
Deductive
,
Verification
,
Contrato
,
Inferencia
,
Ejecución simbólica
,
Subsunción
,
Abstracta
,
Deductiva
,
Verificación
,
Contracte
,
Inferència
,
Execució simbòlica
,
Subsumpció
,
Verificació
|
Derechos de uso:
|
Reconocimiento - No comercial - Compartir igual (by-nc-sa)
|
Editorial:
|
Universitat Politècnica de València
|
Código del Proyecto:
|
info:eu-repo/grantAgreement/MINECO//TIN2015-69175-C4-1-R/ES/SOLUCIONES EFECTIVAS BASADAS EN LA LOGICA/
info:eu-repo/grantAgreement/MINECO//TIN2013-45732-C4-1-P/ES/UNA APROXIMACION DECLARATIVA AL MODELADO, ANALISIS Y RESOLUCION DE PROBLEMAS/
info:eu-repo/grantAgreement/GVA//PROMETEOII%2F2015%2F013/ES/SmartLogic: Logic Technologies for Software Security and Performance/
info:eu-repo/grantAgreement/MECD//FPU14%2F01830/ES/FPU14%2F01830/
|
Agradecimientos:
|
This work has been partially supported by the EU (FEDER) and Spanish MINECO under
grant TIN2015-69175-C4-1-R, and and TIN2013-45732-C4-1-P, and by Generalitat Valenciana
PROMETEOII/2015/013. Daniel Pardo was supported ...[+]
This work has been partially supported by the EU (FEDER) and Spanish MINECO under
grant TIN2015-69175-C4-1-R, and and TIN2013-45732-C4-1-P, and by Generalitat Valenciana
PROMETEOII/2015/013. Daniel Pardo was supported by FPU-ME grant FPU14/01830.
[-]
|
Tipo:
|
Informe
|