Academic literature on the topic 'Binary instrumentation'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Binary instrumentation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Binary instrumentation"

1

Pan, Heidi, Krste Asanović, Robert Cohn, and Chi-Keung Luk. "Controlling program execution through binary instrumentation." ACM SIGARCH Computer Architecture News 33, no. 5 (2005): 45–50. http://dx.doi.org/10.1145/1127577.1127587.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sridhar, Meera, Richard Wartell, and Kevin W. Hamlen. "Hippocratic binary instrumentation: First do no harm." Science of Computer Programming 93 (November 2014): 110–24. http://dx.doi.org/10.1016/j.scico.2014.02.024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Roy, Amitabha, Steven Hand, and Tim Harris. "Hybrid binary rewriting for memory access instrumentation." ACM SIGPLAN Notices 46, no. 7 (2011): 227–38. http://dx.doi.org/10.1145/2007477.1952711.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Feiner, Peter, Angela Demke Brown, and Ashvin Goel. "Comprehensive kernel instrumentation via dynamic binary translation." ACM SIGARCH Computer Architecture News 40, no. 1 (2012): 135–46. http://dx.doi.org/10.1145/2189750.2150992.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

POPA, Marius, and Sergiu Marin CAPISIZU. "Using Binary Code Instrumentation in Computer Security." Informatica Economica 17, no. 4/2013 (2013): 47–63. http://dx.doi.org/10.12948/issn14531305/17.4.2013.05.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Feiner, Peter, Angela Demke Brown, and Ashvin Goel. "Comprehensive kernel instrumentation via dynamic binary translation." ACM SIGPLAN Notices 47, no. 4 (2012): 135–46. http://dx.doi.org/10.1145/2248487.2150992.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Mingwei, Rui Qiao, Niranjan Hasabnis, and R. Sekar. "A platform for secure static binary instrumentation." ACM SIGPLAN Notices 49, no. 7 (2014): 129–40. http://dx.doi.org/10.1145/2674025.2576208.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rodriguez, Ricardo J., Juan Antonio Artal, and Jose Merseguer. "Performance Evaluation of Dynamic Binary Instrumentation Frameworks." IEEE Latin America Transactions 12, no. 8 (2014): 1572–80. http://dx.doi.org/10.1109/tla.2014.7014530.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Levchenko, A. V., and S. A. Fyodorov. "Dynamic Binary Instrumentation Tool for Data Locality Analysis." St. Petersburg State Polytechnical University Journal. Computer Science. Telecommunications and Control Systems. 236, no. 1 (2016): 53–64. http://dx.doi.org/10.5862/jcstcs.236.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Schulz, Martin, Dong Ahn, Andrew Bernat, et al. "Scalable dynamic binary instrumentation for Blue Gene/L." ACM SIGARCH Computer Architecture News 33, no. 5 (2005): 9–14. http://dx.doi.org/10.1145/1127577.1127581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Binary instrumentation"

1

Kleckner, Reid (Reid N. ). "Optimization of naïve dynamic binary instrumentation Tools/." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/76984.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 59-60).<br>The proliferation of dynamic program analysis tools has done much to ease the burden of developing complex software. However, creating such tools remains a challenge. Dynamic binary instrumentation frameworks such as DyanamoRIO and Pin provide support for such tools by taking responsibility for application transparency and machine code manipulation. However, tool writers must still make a tough choice when writing instrumentation: should they inject custom inline assembly into the application code, or should they use the framework facilities for inserting callbacks into regular C code? Custom assembly can be more performant and more flexible, but it forces the tool to take some responsibility for maintaining application transparency. Callbacks into C, or "clean calls," allow the tool writer to ignore the details of maintaining transparency. Generally speaking, a clean call entails switching to a safe stack, saving all registers, materializing the arguments, and jumping to the callback. This thesis presents a suite of optimizations for DynamoRIO that improves the performance of "naive tools," or tools which rely primarily on clean calls for instrumentation. Most importantly, we present a novel partial inlining optimization for instrumentation routines with conditional analysis. For simpler instrumentation routines, we present a novel call coalescing optimization that batches calls into fewer context switches. In addition to these two novel techniques, we provide a suite of machine code optimizations designed to leverage the opportunities created by the aforementioned techniques. With this additional functionality built on DynamoRIO, we have shown improvements of up to 54.8x for a naive instruction counting tool as well as a 3.7x performance improvement for a memory alignment checking tool on average for many of the benchmarks from the SPEC 2006 CPU benchmark suite.<br>by Reid Kleckner.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
2

Nethercote, Nicholas James. "Dynamic binary analysis and instrumentation : or building tools is easy." Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.616254.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gorgovan, Cosmin. "Optimising Dynamic Binary Modification across ARM microarchitectures." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/optimising-dynamic-binary-modification-across-arm-microarchitectures(baa23b94-348f-47db-9a7b-a0b5df0c2626).html.

Full text
Abstract:
Dynamic Binary Modification (DBM) is a technique for modifying applications at runtime, working at the level of native code. It has numerous applications, including instrumentation, translation and optimisation. However, DBM introduces a performance overhead, which in some cases can dominate execution time, making many uses impractical. While avenues for reducing this overhead have been widely explored on x86, ARM, an architecture gaining widespread adoption, has received little attention. Consequently, the overhead of DBM on ARM, as reported in the literature and measured using the available DBM systems, has fallen behind the state-of-the-art by one or two orders of magnitude. The research questions addressed in this thesis are: 1) how to develop low overhead DBM systems for the ARM architecture, and 2) whether new optimisations are plausible and needed. Towards that end, a number of novel optimisations were developed and evaluated specifically to address the sources of overhead for DBM on various ARM microarchitectures. Furthermore, many of the optimisations in the literature were ported to ARM and evaluated. This work was enabled by a new DBM system, named MAMBO, created specifically for this purpose. MAMBO, using the optimisations presented in this thesis, is able to achieve an overhead an order of magnitude smaller than that of the most efficient DBM system for ARM available at the start of this PhD.
APA, Harvard, Vancouver, ISO, and other styles
4

Naciri, William Malik. "Bug Finding Methods for Multithreaded Student Programming Projects." Thesis, Virginia Tech, 2017. http://hdl.handle.net/10919/78675.

Full text
Abstract:
The fork-join framework project is one of the more challenging programming assignments in the computer science curriculum at Virginia Tech. Students in Computer Systems must manage a pool of threads to facilitate the shared execution of dynamically created tasks. This project is difficult because students must overcome the challenges of concurrent programming and conform to the project's specific semantic requirements. When working on the project, many students received inconsistent test results and were left confused when debugging. The suggested debugging tool, Helgrind, is a general-purpose thread error detector. It is limited in its ability to help fix bugs because it lacks knowledge of the specific semantic requirements of the fork-join framework. Thus, there is a need for a special-purpose tool tailored for this project. We implemented Willgrind, a debugging tool that checks the behavior of fork-join frameworks implemented by students through dynamic program analysis. Using the Valgrind framework for instrumentation, checking statements are inserted into the code to detect deadlock, ordering violations, and semantic violations at run-time. Additionally, we extended Willgrind with happens-before based checking in WillgrindPlus. This tool checks for ordering violations that do not manifest themselves in a given execution but could in others. In a user study, we provided the tools to 85 students in the Spring 2017 semester and collected over 2,000 submissions. The results indicate that the tools are effective at identifying bugs and useful for fixing bugs. This research makes multithreaded programming easier for students and demonstrates that special-purpose debugging tools can be beneficial in computer science education.<br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
5

Gopal, Prasad. "Top: An Infrastructure for detecting Application-Specific Program Errors by Binary Runtime Instrumentation." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/36014.

Full text
Abstract:
Finding errors in applications has been achieved using a wide variety of techniques. Some tools instrument the application to check for program properties dynamically whereas others analyze the program statically. We use a technique that analyzes a program's execution by binary runtime instrumentation. Unlike tools that work on a particular language or an intermediate representation of a language, our approach works directly on binaries and hence it is not bound to any language. In order to instrument binaries, we use a binary instrumentation system called Pin, which provides APIs to instrument the application at runtime. We have built an infrastructure using Pin called Top that allows program entities like variables and events to be traced. Using finite automata we can check if certain events take place during the execution of the program. Top consists of a Tracing System that can trace movement of pointers to memory locations or 32-bit data values and keeps track of all their copies. It also provides an Event Framework that reports the occurrence of events such as function calls or returns. Top provides a programming interface which allows querying for particular events. The query is compiled with Top to produce a customized analysis tool, also called client. Running the analysis tool with the application, under Pin, results in events of interest being detected and reported. Using Top, we built a Memory Checker that checks for incorrect usage of dynamic memory allocation APIs and semantically incorrect accesses to dynamically allocated memory. Since we perform fine-grained checking by tracing references, our memory checker found some errors that a popular memory checker called valgrind did not. We have also built an MPI Checker which is used to check if programs use MPI's asynchronous communication primitives properly. This checker can detect errors related to illegal data buffer accesses and errors where the programmer inadvertently overwrote a handle needed to finish the processing of a request.<br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
6

Janjusic, Tomislav. "Framework for Evaluating Dynamic Memory Allocators Including a New Equivalence Class Based Cache-conscious Allocator." Thesis, University of North Texas, 2013. https://digital.library.unt.edu/ark:/67531/metadc500151/.

Full text
Abstract:
Software applications’ performance is hindered by a variety of factors, but most notably by the well-known CPU-memory speed gap (often known as the memory wall). This results in the CPU sitting idle waiting for data to be brought from memory to processor caches. The addressing used by caches cause non-uniform accesses to various cache sets. The non-uniformity is due to several reasons, including how different objects are accessed by the code and how the data objects are located in memory. Memory allocators determine where dynamically created objects are placed, thus defining addresses and their mapping to cache locations. It is important to evaluate how different allocators behave with respect to the localities of the created objects. Most allocators use a single attribute, the size, of an object in making allocation decisions. Additional attributes such as the placement with respect to other objects, or specific cache area may lead to better use of cache memories. In this dissertation, we proposed and implemented a framework that allows for the development and evaluation of new memory allocation techniques. At the root of the framework is a memory tracing tool called Gleipnir, which provides very detailed information about every memory access, and relates it back to source level objects. Using the traces from Gleipnir, we extended a commonly used cache simulator for generating detailed cache statistics: per function, per data object, per cache line, and identify specific data objects that are conflicting with each other. The utility of the framework is demonstrated with a new memory allocator known as equivalence class allocator. The new allocator allows users to specify cache sets, in addition to object size, where the objects should be placed. We compare this new allocator with two well-known allocators, viz., Doug Lea and Pool allocators.
APA, Harvard, Vancouver, ISO, and other styles
7

Coker, Carl. "The Frequency of Binary Companions Around KELT Planet Host Stars." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu149978799487883.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Piano, Matteo. "Multi-Architecture Binary Rewriter to Prevent ROP Arbitrary Code Execution." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-220524.

Full text
Abstract:
Despite the increasing attention to the topic of computer security, the amount of vulnerable software services is still high. The exploitation of a common vulnerability like memory management bugs brought to the development of an attack known as Return Oriented Programming (ROP). Such technique employs malicious memory injections to hijack the control flow of the targeted application and execute an arbitrary series of instructions. This thesis explores the design and implementation of a static binary rewriting tool able to instrument applications compiled for the Linux operating system in order to offer protection against ROP exploitation on x86 and ARM platforms. The instrumentation is achieved by extracting re-compilable assembler code from executable binary files which is then processed and modified. The effectiveness of such solution is tested with a selection of benchmarking utilities in order to evaluate the cost in terms of performance caused by its employment. The results obtained from these experiments show that on average the added overheads are acceptably low and, consequently, the proposed tool is a valid solution to improve the security of vulnerable applications when the original source code is not available.<br>Trots den ökande uppmärksamheten på ämnet datasäkerhet är mängden sårbara mjukvarutjänster fortfarande stor. Utnyttjandet av en vanlig sårbarhet som minneshanteringsfel har lett till utvecklingen av en attack som kallas Return Oriented Programming (ROP). Denna teknik utnyttjar skadliga minnesinjektioner för att ändra kontrollflödet för den riktade applikationen och utföra en godtycklig serie instruktioner. Detta exjobb undersöker utformningen och genomförandet av ett verktyg för statisk binär omskrivning som kan användas för att instrumentera applikationer för Linux-operativsystemet för att erbjuda skydd mot ROP-exploatering på x86- och ARM-plattformar. Instrumentering uppnås genom att extrahera återkompilerbar assemblerkod från exekverbara binära filer som sedan behandlas och modifieras. Effektiviteten av sådan lösning testas med ett urval av benchmarkingverktyg för att utvärdera kostnaden när det gäller prestanda som orsakas av dess användning. Resultaten från dessa experiment visar att de extra kostnaderna i genomsnitt är acceptabelt låga och, följaktligen, är det föreslagna verktyget en giltig lösning för att förbättra säkerheten för sårbara applikationer när den ursprungliga källkoden inte är tillgänglig.
APA, Harvard, Vancouver, ISO, and other styles
9

Schlenker, Stefan. "Very high energy gamma rays from the binary pulsar PSR B1259-63." Doctoral thesis, [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=976502267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kargén, Ulf. "Development of a prototype taint tracing tool for security and other purposes." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-75363.

Full text
Abstract:
In recent years there has been an increasing interest in dynamic taint tracing of compiled software as a powerful analysis method for security and other purposes. Most existing approaches are highly application specific and tends to sacrifice precision in favor of performance. In this thesis project a generic taint tracing tool has been developed that can deliver high precision taint information. By allowing an arbitrary number of taint labels to be stored for every tainted byte, accurate taint propagation can be achieved for values that are derived from multiple input bytes. The tool has been developed for x86 Linux systems using the dynamic binary instrumentation framework Valgrind. The basic theory of taint tracing and multi-label taint propagation is discussed, as well as the main concepts of implementing a taint tracing tool using dynamic binary instrumentation. The impact of multi-label taint propagation on performance and precision is evaluated. While multi-label taint propagation has a considerable impact on performance, experiments carried out using the tool show that large amounts of taint information is lost with approximate methods using only one label per tainted byte.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Binary instrumentation"

1

Andriesse, Dennis. Practical Binary Analysis: Build Your Own Linux Tools for Binary Instrumentation, Analysis, and Disassembly. No Starch Press, 2018.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Anderson, Crystal S. Soul in Seoul. University Press of Mississippi, 2020. http://dx.doi.org/10.14325/mississippi/9781496830098.001.0001.

Full text
Abstract:
Soul in Seoul: African American Popular Music and K-pop examines how K-pop cites musical and performative elements of Black popular music culture as well as the ways that fans outside of Korea understand these citations. K-pop represents a hybridized mode of Korean popular music that emerged in the 1990s with global aspirations. Its hybridity combines musical elements from Korean and foreign cultures, particularly rhythm and blues-based genres (R&amp;B) of African American popular music. Korean pop, R&amp;B and hip-hop solo artists and groups engage in citational practices by simultaneously emulating R&amp;B’s instrumentation and vocals and enhancing R&amp;B by employing Korean musical strategies to such an extent that K-pop becomes part of a global R&amp;B tradition. Korean pop groups use dynamic images and quality musical production to engage in cultural work that culminates the kind of global form of crossover pioneered by Black American music producers. Korean R&amp;B artists, with a focus on vocals, take the R&amp;B tradition beyond the Black-white binary, and Korean hip-hop practitioners use sampling and live instrumentation to promote R&amp;B’s innovative music aesthetics. K-pop artists also cite elements of African American performance in Korean music videos that disrupt limiting representations. K-pop’s citational practices reveal diverse musical aesthetics driven by the interplay of African American popular music and Korean music strategies. As a transcultural fandom, global fans function as part of K-pop’s music press and deem these citational practices authentic. Citational practices also challenge homogenizing modes of globalization by revealing the multiple cultural forces that inform K-pop.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Binary instrumentation"

1

Mohanta, Abhijit, and Anoop Saldanha. "Binary Instrumentation for Reversing Automation." In Malware Analysis and Detection Engineering. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-6193-4_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Wenchuan, Yifei Wang, Baojiang Cui, and Chen Chen. "A Static Instrumentation Method for ELF Binary." In Innovative Mobile and Internet Services in Ubiquitous Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-22263-5_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ermakov, Mikhail. "Static Binary Code Instrumentation for ARM Architecture." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-74313-4_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sullivan, D. J., M. Walkington, and E. Budding. "Scanner Observations of Some Close Binary Systems." In Instrumentation and Research Programmes for Small Telescopes. Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-010-9433-7_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Mohin, S., A. V. Raveendran, and M. V. Mekkaden. "Photometry of the RS CVn Binary II Peg." In Instrumentation and Research Programmes for Small Telescopes. Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-010-9433-7_67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Filho, Ailton Santos, Ricardo J. Rodríguez, and Eduardo L. Feitosa. "Reducing the Attack Surface of Dynamic Binary Instrumentation Frameworks." In Smart Innovation, Systems and Technologies. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-9155-2_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Menzies, J. W., and F. Marang. "A New B-Subdwarf Eclipsing Binary with an Extremely Short Period." In Instrumentation and Research Programmes for Small Telescopes. Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-010-9433-7_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chatterjee, Nachiketa, Saurabh Singh Thakur, and Partha Pratim Das. "Resource Management in Native Languages Using Dynamic Binary Instrumentation (PIN)." In Advances in Intelligent Systems and Computing. Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2653-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Zhao, Jing Ling, Lei He, and Bing He. "C++ Memory Check tool based on Dynamic Binary Instrumentation Platform." In Advances on Broad-Band Wireless Computing, Communication and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-49106-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Feng, Zhai, Kong Lingda, Xu Yongjin, and Ye Xin. "Power Meter Software Quality Analysis Based on Dynamic Binary Instrumentation." In Innovative Mobile and Internet Services in Ubiquitous Computing. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79728-7_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Binary instrumentation"

1

Williams, C. C. "Interactive binary instrumentation." In "Second International Workshop on Remote Analysis and Measurement of Software Systems (RAMSS 04)" - W15S Workshop - 26th International Conference on Software Engineering. IEE, 2004. http://dx.doi.org/10.1049/ic:20040346.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hsu, Chin-Chia, Che-Yu Wu, Hsu-Chun Hsiao, and Shih-Kun Huang. "INSTRIM: Lightweight Instrumentation for Coverage-guided Fuzzing." In Workshop on Binary Analysis Research. Internet Society, 2018. http://dx.doi.org/10.14722/bar.2018.23014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bernat, Andrew R., and Barton P. Miller. "Anywhere, any-time binary instrumentation." In the 10th ACM SIGPLAN-SIGSOFT workshop. ACM Press, 2011. http://dx.doi.org/10.1145/2024569.2024572.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bernat, Andrew R., Kevin Roundy, and Barton P. Miller. "Efficient, sensitivity resistant binary instrumentation." In the 2011 International Symposium. ACM Press, 2011. http://dx.doi.org/10.1145/2001420.2001432.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Du, Kunping, Fei Kang, Hui Shu, and Li Dai. "Dynamic Binary Instrumentation Technology Overview." In 2012 National Conference on Information Technology and Computer Science. Atlantis Press, 2012. http://dx.doi.org/10.2991/citcs.2012.132.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peng, Fei, Xiang Gao, Naijie Gu, and Ji Qiu. "SEntre: A dynamic binary instrumentation infrastructure." In 2011 International Conference on Electronics, Communications and Control (ICECC). IEEE, 2011. http://dx.doi.org/10.1109/icecc.2011.6066387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Arafa, Pansy, Guy Martin Tchamgoue, Hany Kashif, and Sebastian Fischmeister. "QDIME: QoS-Aware Dynamic Binary Instrumentation." In 2017 IEEE 25th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 2017. http://dx.doi.org/10.1109/mascots.2017.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brignon, Enzo, and Laurence Pierre. "Assertion-Based Verification through Binary Instrumentation." In 2019 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2019. http://dx.doi.org/10.23919/date.2019.8715117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Laurenzano, Michael A., Mustafa M. Tikir, Laura Carrington, and Allan Snavely. "PEBIL: Efficient static binary instrumentation for Linux." In Software (ISPASS). IEEE, 2010. http://dx.doi.org/10.1109/ispass.2010.5452024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Feiner, Peter, Angela Demke Brown, and Ashvin Goel. "Comprehensive kernel instrumentation via dynamic binary translation." In the seventeenth international conference. ACM Press, 2012. http://dx.doi.org/10.1145/2150976.2150992.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography