Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
18
views
17
references
Top references
cited by
3
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
3,267
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Compiler Construction
A System for Generating Static Analyzers for Machine Instructions
other
Author(s):
Junghee Lim
,
Thomas Reps
Publication date
(Print):
2008
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Annual Reviews AI, Machine Learning, and Society
Most cited references
17
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Systematic design of program analysis frameworks
Patrick Cousot
,
Radhia Cousot
(1979)
0
comments
Cited
101
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Trace Partitioning in Abstract Interpretation Based Static Analyzers
Laurent Mauborgne
,
Xavier Rival
(2005)
0
comments
Cited
28
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Analyzing Memory Accesses in x86 Executables
Gogul Balakrishnan
,
Thomas Reps
(2004)
0
comments
Cited
16
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Pages
: 36-52
DOI:
10.1007/978-3-540-78791-4_3
SO-VID:
313d9d63-95e7-4cba-a224-61288cef150c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Design Choices in a Compiler Course or How to Make Undergraduates Love Formal Notation
pp. 16
Improved Memory-Access Analysis for x86 Executables
pp. 36
A System for Generating Static Analyzers for Machine Instructions
pp. 53
IDE Dataflow Analysis in the Presence of Large Object-Oriented Libraries
pp. 69
An Adaptive Strategy for Inline Substitution
pp. 85
Automatic Transformation of Bit-Level C Code to Support Multiple Equivalent Data Layouts
pp. 100
Control Flow Emulation on Tiled SIMD Architectures
pp. 116
Generating SIMD Vectorized Permutations
pp. 132
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
pp. 147
How to Do a Million Watchpoints: Efficient Debugging Using Dynamic Instrumentation
pp. 163
Compiler-Guaranteed Safety in Code-Copying Virtual Machines
pp. 178
Hardware JIT Compilation for Off-the-Shelf Dynamically Reconfigurable FPGAs
pp. 193
Visualization of Program Dependence Graphs
pp. 197
On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis
pp. 213
Efficiency, Precision, Simplicity, and Generality in Interprocedural Data Flow Analysis: Resurrecting the Classical Call Strings Method
pp. 229
Java Bytecode Verification for @NonNull Types
pp. 245
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
pp. 260
Coqa: Concurrent Objects with Quantized Atomicity
pp. 276
Keep Off the Grass: Locking the Right Path for Atomicity
pp. 291
Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization
Similar content
3,267
RADAR-Base: Open Source Mobile Health Platform for Collecting, Monitoring, and Analyzing Data Using Sensors, Wearables, and Mobile Devices
Authors:
Yatharth Ranjan
,
Zulqarnain Rashid
,
Callum Stewart
…
The FOXO1 Transcription Factor Instructs the Germinal Center Dark Zone Program.
Authors:
David Dominguez-Sola
,
Jennifer Kung
,
Antony Holmes
…
Analyzing signatures of aerosol-cloud interactions from satellite retrievals and the GISS GCM to constrain the aerosol indirect effect
Authors:
Surabi Menon
,
Anthony Del Genio
,
Yoram Kaufman
…
See all similar
Cited by
3
Directed Proof Generation for Machine Code
Authors:
Aditya Thakur
,
Junghee Lim
,
Akash Lal
…
The BINCOA Framework for Binary Code Analysis
Authors:
Sébastien Bardin
,
Philippe Herrmann
,
Jérôme Leroux
…
Improved Memory-Access Analysis for x86 Executables
Authors:
Thomas Reps
,
Gogul Balakrishnan
See all cited by