Mostrar el registro completo del ítem
Vidal Oriola, GF. (2015). Symbolic execution as a basis for termination analysis. Science of Computer Programming. 102:142-157. https://doi.org/10.1016/j.scico.2015.01.007
Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/61507
Título: | Symbolic execution as a basis for termination analysis | |
Autor: | ||
Entidad UPV: |
|
|
Fecha difusión: |
|
|
Resumen: |
Program termination is a relevant property that has been extensively studied in the
context of many different formalisms and programming languages. Traditional approaches
to proving termination are usually based on ...[+]
|
|
Palabras clave: |
|
|
Derechos de uso: | Reserva de todos los derechos | |
Fuente: |
|
|
DOI: |
|
|
Editorial: |
|
|
Versión del editor: | http://dx.doi.org/10.1016/j.scico.2015.01.007 | |
Código del Proyecto: |
|
|
Agradecimientos: |
This work has been partially supported by the EU (FEDER) and the Spanish Ministerio de Economia y Competitividad (Secretaria de Estado de Investigacion, Desarrollo e Innovacion) under grant TIN2013-44742-C4-1-R and by the ...[+]
|
|
Tipo: |
|