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
24
views
16
references
Top references
cited by
9
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
109
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Programming Languages and Systems
Verifying a Compiler for Java Threads
other
Author(s):
Andreas Lochbihler
Publication date
(Print):
2010
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
ScienceOpen Research
Most cited references
16
Record
: found
Abstract
: not found
Article
: not found
Formal verification of a realistic compiler
Xavier Leroy
(2009)
0
comments
Cited
117
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A Formally Verified Compiler Back-end
Xavier Leroy
(2009)
0
comments
Cited
33
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
A machine-checked model for a Java-like language, virtual machine, and compiler
Gerwin Klein
,
Tobias Nipkow
(2006)
0
comments
Cited
32
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 427-447
DOI:
10.1007/978-3-642-11957-6_23
SO-VID:
f0ed0973-04df-481b-bd43-f82b0f575a32
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
The Audacity of Hope: Thoughts on Reclaiming the Database Dream
pp. 2
Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions
pp. 23
Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
pp. 43
Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays
pp. 64
A Semantic Framework for Declassification and Endorsement
pp. 85
Amortised Resource Analysis with Separation Logic
pp. 125
Testing Polymorphic Properties
pp. 145
Formal Verification of Coalescing Graph-Coloring Register Allocation
pp. 165
A Theory of Speculative Computation
pp. 185
Propositional Interpolation and Abstract Interpretation
pp. 205
Functional Programming in Sublinear Space
pp. 226
Logical Concurrency Control from Sequential Proofs
pp. 246
Fluid Updates: Beyond Strong vs. Weak Updates
pp. 267
Parameterized Memory Models and Concurrent Separation Logic
pp. 287
Amortized Resource Analysis with Polynomial Potential
pp. 307
Generative Operational Semantics for Relaxed Memory Models
pp. 327
Automating Security Mediation Placement
pp. 345
TRX: A Formally Verified Parser Interpreter
pp. 366
On the Expressive Power of Primitives for Compensation Handling
pp. 387
Separating Shape Graphs
pp. 407
Deadlock-Free Channels and Locks
pp. 427
Verifying a Compiler for Java Threads
pp. 448
A Grammar-Based Approach to Invertible Programs
pp. 468
Faulty Logic: Reasoning about Fault Tolerant Programs
pp. 488
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
pp. 507
A Universal Calculus for Stream Processing Languages
pp. 529
Enforcing Stateful Authorization and Information Flow Policies in Fine
pp. 550
Stateful Contracts for Affine Types
pp. 570
CFA2: A Context-Free Approach to Control-Flow Analysis
pp. 590
Weighted Dynamic Pushdown Networks
pp. 610
Explicit Stabilisation for Modular Rely-Guarantee Reasoning
Similar content
109
A Formally Verified Compiler Back-end
Authors:
Xavier Leroy
Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers
Authors:
David Monniaux
Efficient exception handling in Java bytecode-to-C ahead-of-time compiler for embedded systems
Authors:
Dong-Heon Jung
,
JongKuk Park
,
Sung-Hwan Bae
…
See all similar
Cited by
9
Verifying an Open Compiler Using Multi-language Semantics
Authors:
James T. Perconti
,
Amal Ahmed
A Decision Procedure for (Co)datatypes in SMT Solvers
Authors:
Andrew Reynolds
,
Jasmin Christian Blanchette
Formal Approaches to Secure Compilation
Authors:
Marco Patrignani
,
Amal Ahmed
,
Dave Clarke
See all cited by