Result: Dynamic heap type inference for program understanding and debugging

Title:
Dynamic heap type inference for program understanding and debugging
Authors:
POLISHCHUK, Marina, LIBLIT, Ben, SCHUIZE, W
Source:
POPL® 2007: The 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages®: Papers presented at the Symposium, January 17-19, 2007, Nice, FranceACM SIGPLAN notices. 42(1):39-46
Publisher Information:
Broadway, NY: ACM, 2007.
Publication Year:
2007
Physical Description:
print, 25 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Langages de programmation, Programming languages, Organisation des mémoires. Traitement des données, Memory organisation. Data processing, Gestion des mémoires et des fichiers (y compris la protection et la sécurité des fichiers), Memory and file management (including protection and security), Accès mémoire, Storage access, Acceso memoria, Analyse information, Information analysis, Analyse symbolique, Symbolic analysis, Análisis simbolico, Annotation, Anotación, Débogage, Debugging, Puesta a punto programa, Facteur humain, Human factor, Factor humano, Fiabilité, Reliability, Fiabilidad, Gestion mémoire, Storage management, Gestión memoria, Langage programmation, Programming language, Lenguaje programación, Localisation, Localization, Localización, Programme débogage, Debugging program, Programa puesta a punto, Ramasse-miettes, Garbage collector, Recogemigas, Soustype, Subtype, Subtipo, Sécurité, Safety, Seguridad, Théorie type, Type theory, Visualisation, Visualization, Visualización, Algorithms, Human Factors, Languages, conservative garbage collection, constraints, debugging tools, dynamic type inference, heap visualization, physical subtyping
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Microsoft Corporation, United States
University of Wisconsin-Madison, United States
Oracle Corporation, United States
ISSN:
1523-2867
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=18600637
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18600637
Database:
PASCAL Archive

Further Information

C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency with program types. Our approach builds on ideas from physical subtyping and conservative garbage collection. We infer a program-defined type for each allocated storage location or identify untypable blocks that reveal heap corruption or type safety violations. The analysis exploits symbolic debug information if present, but requires no annotation or recompilation beyond a list of defined program types and allocated heap blocks. We have integrated our analysis into the GNU Debugger (gdb), and describe our initial experience using this tool with several small to medium-sized programs.