NDLI: Lightweight verification of separate compilation

Please wait, while we are loading the content...

Programming the world of uncertain things (keynote)

Breaking through the normalization barrier: a self-interpreter for f-omega

Temporal verification of higher-order functional programs

Query-guided maximum satisfiability

Fully-abstract compilation by approximate back-translation

Decidability of inferring inductive invariants

Dependent types and multi-monadic effects in F*

Automatic patch generation by learning correct code

Chapar: certified causally consistent distributed key-value stores

Principal type inference for GADTs

Combining static analysis with probabilistic models to enable market-scale Android inter-component analysis

SMO: an integrated approach to intra-array and inter-array storage optimization

Effects as sessions, sessions as effects

Modelling the ARMv8 architecture, operationally: concurrency and ISA

Newtonian program analysis via tensor product

Lattice-theoretic progress measures and coalgebraic model checking

Learning programs from noisy data

Synthesis of reactive controllers for hybrid systems (keynote)

Type theory in type theory using quotient inductive types

Scaling network verification using symmetry and surgery

String solving with word equations and transducers: towards a logic for analysing mutation XSS

Lightweight verification of separate compilation

The hardness of data packing

Fabular: regression formulas as probabilistic programming

Estimating types in binaries using predictive modeling

'Cause I'm strong enough: Reasoning about consistency choices in distributed systems

Abstracting gradual typing

Abstraction refinement guided by a learnt probabilistic model

PolyCheck: dynamic verification of iteration space transformations on affine programs

Monitors and blame assignment for higher-order session types

A concurrency semantics for relaxed atomics that permits optimisation and avoids thin-air executions

Casper: an efficient approach to call trace collection

Algorithms for algebraic path properties in concurrent systems of constant treewidth components

Optimizing synthesis with metasketches

Confluences in programming languages research (keynote)

System f-omega with equirecursive types for datatype-generic programming

Model checking for symbolic-heap separation logic with inductive predicates

Symbolic computation of differential equivalences

From MinX to MinC: semantics-driven decompilation of recursive datatypes

The complexity of interaction

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers

Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs

A program logic for concurrent objects under fair scheduling

The gradualizer: a methodology and algorithm for generating gradual type systems

Learning invariants using decision trees and implication counterexamples

Printing floating-point numbers: a faster, always correct method

Environmental bisimulations for probabilistic higher-order languages

Overhauling SC atomics in C11 and OpenCL

Pushdown control-flow analysis for free

Memoryful geometry of Interaction II: recursion and adequacy

Maximal specification synthesis

A theory of effects and resources: adjunction models and polarised calculi

Reducing crash recoverability to reachability

Unboundedness and downward closures of higher-order pushdown automata

Sound type-dependent syntactic language extension

Transforming spreadsheet data types using examples

PSync: a partially synchronous language for fault-tolerant distributed algorithms

Is sound gradual typing dead?

Symbolic abstract data type inference

Taming release-acquire consistency

Binding as sets of scopes

Example-directed synthesis: a type-theoretic interpretation

Lightweight verification of separate compilation

Content Provider	ACM Digital Library
Author	Vafeiadis, Viktor Kang, Jeehoon Kim, Yoonseung Hur, Chung-Kil Dreyer, Derek
Abstract	Major compiler verification efforts, such as the CompCert project, have traditionally simplified the verification problem by restricting attention to the correctness of whole-program compilation, leaving open the question of how to verify the correctness of separate compilation. Recently, a number of sophisticated techniques have been proposed for proving more flexible, compositional notions of compiler correctness, but these approaches tend to be quite heavyweight compared to the simple "closed simulations" used in verifying whole-program compilation. Applying such techniques to a compiler like CompCert, as Stewart et al. have done, involves major changes and extensions to its original verification. In this paper, we show that if we aim somewhat lower---to prove correctness of separate compilation, but only for a single compiler---we can drastically simplify the proof effort. Toward this end, we develop several lightweight techniques that recast the compositional verification problem in terms of whole-program compilation, thereby enabling us to largely reuse the closed-simulation proofs from existing compiler verifications. We demonstrate the effectiveness of these techniques by applying them to CompCert 2.4, converting its verification of whole-program compilation into a verification of separate compilation in less than two person-months. This conversion only required a small number of changes to the original proofs, and uncovered two compiler bugs along the way. The result is SepCompCert, the first verification of separate compilation for the full CompCert compiler. .
Starting Page	178
Ending Page	190
Page Count	13
File Format	PDF
ISBN	9781450335492
DOI	10.1145/2837614.2837642
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2016-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Separate compilation Compcert Compositional compiler verification
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in