{"id":"https://openalex.org/W2121579803","doi":"https://doi.org/10.1109/sp.2008.30","title":"Preventing Memory Error Exploits with WIT","display_name":"Preventing Memory Error Exploits with WIT","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2121579803","doi":"https://doi.org/10.1109/sp.2008.30","mag":"2121579803"},"language":"en","primary_location":{"id":"doi:10.1109/sp.2008.30","doi":"https://doi.org/10.1109/sp.2008.30","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sp.2008.30","pdf_url":null,"source":{"id":"https://openalex.org/S4210233669","display_name":"IEEE Symposium on Security and Privacy (S&P)","issn_l":"1081-6011","issn":["1081-6011","2375-1207"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Symposium on Security and Privacy (sp 2008)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028229413","display_name":"Periklis Akritidis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Periklis Akritidis","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research - Cambridge)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research - Cambridge)","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053355200","display_name":"Cristian Cadar","orcid":"https://orcid.org/0000-0002-3599-7264","observed_orcids":["https://orcid.org/0000-0002-3599-7264"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Cristian Cadar","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research - Cambridge)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research - Cambridge)","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008493066","display_name":"Costin Raiciu","orcid":"https://orcid.org/0000-0002-5937-2162","observed_orcids":["https://orcid.org/0000-0002-5937-2162"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Costin Raiciu","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research - Cambridge)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research - Cambridge)","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110237883","display_name":"Manuel Costa","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Manuel Costa","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research - Cambridge)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research - Cambridge)","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059491225","display_name":"Miguel Castro","orcid":"https://orcid.org/0000-0002-1277-3604","observed_orcids":["https://orcid.org/0000-0002-1277-3604","https://orcid.org/0000-0001-6197-0818","https://orcid.org/0000-0001-9517-1408","https://orcid.org/0000-0001-6578-2662"]},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Miguel Castro","raw_affiliation_strings":["Microsoft Research Limited, Cambridge, UK","Microsoft Research - Cambridge)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Limited, Cambridge, UK","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft Research - Cambridge)","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":12.9905,"has_fulltext":false,"cited_by_count":315,"citation_normalized_percentile":{"value":0.99448947,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"277"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/points-to-analysis","display_name":"points-to analysis","score":0.796999990940094},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"control flow graph","score":0.7409999966621399},{"id":"https://openalex.org/keywords/static-analysis","display_name":"static analysis","score":0.5109999775886536},{"id":"https://openalex.org/keywords/code-instrumentation","display_name":"code instrumentation","score":0.6039999723434448},{"id":"https://openalex.org/keywords/program-execution-control","display_name":"program execution control","score":0.3089999854564667},{"id":"https://openalex.org/keywords/runtime-overhead","display_name":"runtime overhead","score":0.5989999771118164}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8642363548278809},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7992027997970581},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.7021538019180298},{"id":"https://openalex.org/C102379954","wikidata":"https://www.wikidata.org/wiki/Q2589940","display_name":"Call graph","level":2,"score":0.697532057762146},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.6944475769996643},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6917060613632202},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6271405220031738},{"id":"https://openalex.org/C64869954","wikidata":"https://www.wikidata.org/wiki/Q1859747","display_name":"False positive paradox","level":2,"score":0.5761100053787231},{"id":"https://openalex.org/C200833197","wikidata":"https://www.wikidata.org/wiki/Q333707","display_name":"Compile time","level":3,"score":0.545737087726593},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5398733615875244},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4973013699054718},{"id":"https://openalex.org/C63116202","wikidata":"https://www.wikidata.org/wiki/Q7676227","display_name":"Taint checking","level":3,"score":0.4762328267097473},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.46774083375930786},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4627542495727539},{"id":"https://openalex.org/C202491316","wikidata":"https://www.wikidata.org/wiki/Q272683","display_name":"Instruction set","level":2,"score":0.45317700505256653},{"id":"https://openalex.org/C28180684","wikidata":"https://www.wikidata.org/wiki/Q4080983","display_name":"Memory safety","level":3,"score":0.44945991039276123},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4246549904346466},{"id":"https://openalex.org/C156731835","wikidata":"https://www.wikidata.org/wiki/Q751740","display_name":"Memory leak","level":4,"score":0.4137778580188751},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4113600254058838},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.3240166902542114},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.2906923294067383},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.2880779504776001},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2786693572998047},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.25713425874710083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18329134583473206},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.13234049081802368},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.11649742722511292},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.08642557263374329},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08263477683067322},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sp.2008.30","doi":"https://doi.org/10.1109/sp.2008.30","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sp.2008.30","pdf_url":null,"source":{"id":"https://openalex.org/S4210233669","display_name":"IEEE Symposium on Security and Privacy (S&P)","issn_l":"1081-6011","issn":["1081-6011","2375-1207"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-2"],"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Symposium on Security and Privacy (sp 2008)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.414.2949","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.2949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fuxi.cs.txstate.edu/~nasdg/papers/2008sp/Preventing Memory Error Exploits with WIT 2008.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:98637","doi":null,"is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/98637/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: (Proceedings) IEEE Symposium on Security and Privacy. (pp. 263-+). IEEE COMPUTER SOC (2008)","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1112477","https://openalex.org/W206265171","https://openalex.org/W332253968","https://openalex.org/W1499992849","https://openalex.org/W1513884898","https://openalex.org/W1535713556","https://openalex.org/W1539430313","https://openalex.org/W1565113942","https://openalex.org/W1579850852","https://openalex.org/W1582331515","https://openalex.org/W1587981097","https://openalex.org/W1593678010","https://openalex.org/W1825457006","https://openalex.org/W1989060313","https://openalex.org/W2000181257","https://openalex.org/W2031006315","https://openalex.org/W2068615994","https://openalex.org/W2069476565","https://openalex.org/W2081768685","https://openalex.org/W2090181646","https://openalex.org/W2096267728","https://openalex.org/W2098806455","https://openalex.org/W2101699859","https://openalex.org/W2102970979","https://openalex.org/W2117115928","https://openalex.org/W2117703831","https://openalex.org/W2120138937","https://openalex.org/W2121218648","https://openalex.org/W2123886726","https://openalex.org/W2134028114","https://openalex.org/W2136651729","https://openalex.org/W2136938453","https://openalex.org/W2137390305","https://openalex.org/W2149237601","https://openalex.org/W2150277819","https://openalex.org/W2156729262","https://openalex.org/W2165100126","https://openalex.org/W4232483807","https://openalex.org/W4239120913","https://openalex.org/W4250981365","https://openalex.org/W4254762831","https://openalex.org/W4256532365","https://openalex.org/W4285719527","https://openalex.org/W6611405367","https://openalex.org/W6675416627"],"related_works":["https://openalex.org/W2508691117","https://openalex.org/W2424036363","https://openalex.org/W1969519208","https://openalex.org/W2081768685","https://openalex.org/W2979406021","https://openalex.org/W6946113368","https://openalex.org/W1591211019","https://openalex.org/W2188998287","https://openalex.org/W2994546767","https://openalex.org/W7099003870"],"abstract_inverted_index":{"Attacks":[0],"often":[1],"exploit":[2],"memory":[3],"errors":[4],"to":[5,25,51,76,94,132],"gain":[6],"control":[7,98],"over":[8],"the":[9,53,57,69,86,90,103,110,121,188],"execution":[10],"of":[11,59,177],"vulnerable":[12],"programs.":[13],"These":[14],"attacks":[15],"remain":[16],"a":[17,34,175],"serious":[18],"problem":[19],"despite":[20],"previous":[21],"research":[22],"on":[23],"techniques":[24],"prevent":[26,77],"them.":[27],"We":[28,125],"present":[29],"write":[30],"integrity":[31],"testing":[32],"(WIT),":[33],"new":[35],"technique":[36],"that":[37,61,82,96],"provides":[38],"practical":[39],"protection":[40],"from":[41,79],"these":[42],"attacks.":[43],"WIT":[44,116],"uses":[45],"points-to":[46],"analysis":[47,111],"at":[48],"compile":[49],"time":[50,136],"compute":[52],"control-flow":[54,104],"graph":[55],"and":[56,93,135,149,162,181],"set":[58,87,176],"objects":[60,81],"can":[62,140],"be":[63,141],"written":[64],"by":[65,89,102],"each":[66],"instruction":[67],"in":[68,85,143],"program.":[70],"Then":[71],"it":[72,146,154,163,182],"generates":[73],"code":[74],"instrumented":[75],"instructions":[78],"modifying":[80],"are":[83,100],"not":[84,113],"computed":[88],"static":[91],"analysis,":[92],"ensure":[95],"indirect":[97],"transfers":[99],"allowed":[101],"graph.":[105],"To":[106],"improve":[107],"coverage":[108,157],"where":[109],"is":[112,171,183,187],"precise":[114],"enough,":[115],"inserts":[117],"small":[118],"guards":[119],"between":[120],"original":[122],"program":[123],"objects.":[124],"describe":[126],"an":[127],"efficient":[128],"implementation":[129,139],"with":[130,158],"optimizations":[131],"reduce":[133],"space":[134],"overhead.":[137,166],"This":[138],"used":[142],"practice":[144],"because":[145],"compiles":[147],"C":[148],"C++":[150],"programs":[151],"without":[152],"modifications,":[153],"has":[155,164],"high":[156],"no":[159],"false":[160],"positives,":[161],"low":[165],"WIT's":[167],"average":[168],"runtime":[169],"overhead":[170],"only":[172],"7%":[173],"across":[174],"CPU":[178],"intensive":[179],"benchmarks":[180],"negligible":[184],"when":[185],"IO":[186],"bottleneck.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":25},{"year":2018,"cited_by_count":24},{"year":2017,"cited_by_count":20},{"year":2016,"cited_by_count":19},{"year":2015,"cited_by_count":22},{"year":2014,"cited_by_count":17},{"year":2013,"cited_by_count":16},{"year":2012,"cited_by_count":27}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}