Traversal, case analysis, and lowering for C++ program analysis /

Bibliographic Details
Main Author: Wagner, Luke A.
Other Authors: Stroustrup, Bjarne (Thesis advisor)
Format: Thesis eBook
Language:English
Published: [College Station, Tex.] : [Texas A&M University], [2010]
Subjects:
Online Access:Link to OAK Trust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000cam a2200000Ka 4500
001 in00002588024
005 20151201120124.0
006 m f d
007 cr unu||||||||
008 100427s2010 txu sbm 000 0 eng d
035 |a (OCoLC)ocn609589026 
035 |a (OCoLC)609589026 
035 |a (TxCM)http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-908 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM 
099 |a 2009  |a Thesis  |a 1969.1/ETD-TAMU-2009-08-908 
100 1 |a Wagner, Luke A. 
245 1 0 |a Traversal, case analysis, and lowering for C++ program analysis /  |c by Luke A. Wagner. 
264 1 |a [College Station, Tex.] :  |b [Texas A&M University],  |c [2010] 
300 |a 1 online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major Subject: Computer Science" 
500 |a Title from author supplied metadata (automated record created 2010-03-12 12:08:51). 
502 |b Master of Science  |c Texas A&M University  |d 2009  |o http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-908 
504 |a Includes bibliographical references. 
516 |a Text (Thesis) 
520 3 |a To work effectively, programmers need tools to support their typical development activities, such as the creation, analysis, and transformation of source code. Analysis and transformation tools can be difficult to write for modern programming languages and, without a reusable framework, each tool must separately implement nontrivial algorithms like name lookup and type checking. This thesis describes an extension to one such framework, named Pivot, that focuses on programs written in C++. This extension, named Filter, assists the tool builder in traversal, case analysis, and lowering of the data structure representing C++ programs. Comparisons described in the thesis show a 2-4x code reduction when solving basic problems (e.g., searching for uses of a given declaration) using the extension and a performance overhead that drops below 2x for larger problems (e.g., checking C++ layout compatibility). 
500 |a Electronic resource. 
650 4 |a Major computer science. 
653 |a C++ 
653 |a Traversal 
653 |a Program analysis 
700 1 |a Stroustrup, Bjarne,  |e thesis advisor. 
856 4 0 |u http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-908  |z Link to OAK Trust copy  |t 0 
994 |a C0  |b TXA 
948 |a cataloged  |b h  |c 2010/4/27  |d c  |e jwilkinson 
999 |a MARS 
999 f f |s bedb666f-ec98-3e36-ba0b-e2fb4ba6a16c  |i d1ede088-790e-3818-be8e-c82b50e6f708  |t 0 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |d Available Online  |t 0  |e 2009 Thesis 1969.1/ETD-TAMU-2009-08-908  |h Other scheme 
998 f f |a 2009 Thesis 1969.1/ETD-TAMU-2009-08-908  |t 0  |l Available Online