Show simple item record

dc.contributor.authorKling, Michael W.
dc.contributor.authorMisailovic, Sasa
dc.contributor.authorCarbin, Michael James
dc.contributor.authorRinard, Martin C
dc.date.accessioned2020-06-12T20:10:53Z
dc.date.available2020-06-12T20:10:53Z
dc.date.issued2012-10
dc.identifier.issn0362-1340
dc.identifier.issn1558-1160
dc.identifier.urihttps://hdl.handle.net/1721.1/125785
dc.description.abstractWe present Bolt, a novel system for escaping from infinite and long-running loops. Directed by a user, Bolt can attach to a running process and determine if the program is executing an infinite loop. If so, Bolt can deploy multiple strategies to escape the loop, restore the responsiveness of the program, and enable the program to deliver useful output. Bolt operates on stripped x86 and x64 binaries, dynamically attaches and detaches to and from the program as needed, and dynamically detects loops and creates program state checkpoints to enable exploration of different escape strategies. Bolt can detect and escape from loops in off-the-shelf software, without available source code, and with no overhead in standard production use. Copyright © 2012 ACM.en_US
dc.description.sponsorshipNSF (Grant CCF-0811397)en_US
dc.description.sponsorshipNSF (Grant CCF-0905244)en_US
dc.description.sponsorshipNSF (IIS-0835652)en_US
dc.description.sponsorshipNSF (Grant CCF-1036241)en_US
dc.description.sponsorshipDARPA (Grant FA8650-11-C-7192)en_US
dc.description.sponsorshipDARPA (Grant FA8750-12-2-0110)en_US
dc.description.sponsorshipUnited States Department of Energy (Grant DE-SC0005288)en_US
dc.language.isoen
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionof10.1145/2398857.2384648en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleBolt: on-demand infinite loop escape in unmodified binariesen_US
dc.typeArticleen_US
dc.identifier.citationKling, Michael, et al. "Bolt: on-demand infinite loop escape in unmodified binaries." ACM SIGPLAN Notes 47,10 (2012), 431–450. https://doi.org/10.1145/2398857.2384648en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journalACM SIGPLAN Noticesen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-07-02T15:50:38Z
dspace.date.submission2019-07-02T15:50:38Z
mit.journal.volume47en_US
mit.journal.issue10en_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record