Program debugging and validation using semantic approximations and partial specifications
Data(s) |
01/07/2002
|
---|---|
Resumo |
The technique of Abstract Interpretation [11] has allowed the development of sophisticated program analyses which are provably correct and practical. The semantic approximations produced by such analyses have been traditionally applied to optimization during program compilation. However, recently, novel and promising applications of semantic approximations have been proposed in the more general context of program validation and debugging [3,9,7]. |
Formato |
application/pdf |
Identificador | |
Idioma(s) |
eng |
Publicador |
Facultad de Informática (UPM) |
Relação |
http://oa.upm.es/14251/1/HERMENE_IPT_2002-1.pdf http://link.springer.com/chapter/10.1007%2F3-540-45465-9_7 |
Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
Fonte |
Automata, Languages and Programming | 29th International Colloquium, ICALP 2002 | July 8-13, 2002 | Malaga, Spain |
Palavras-Chave | #Informática |
Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |