NDLI: Compositional certified resource bounds

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

Automatically improving accuracy for floating point expressions

Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack

Mechanized verification of fine-grained concurrent programs

LaminarIR: compile-time queues for structured streams

Verification of a cryptographic primitive: SHA-256 (abstract)

Asynchronous programming, analysis and testing with state machines

Efficient synthesis of network updates

Composing concurrency control

DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs

A formal C memory model supporting integer-pointer casts

Static detection of asymptotic performance bugs in collection traversals

Declarative programming over eventually consistent data stores

Automatic induction proofs of data-structures in imperative programs

Celebrating diversity: a mixture of experts approach for runtime mapping in dynamic environments

Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises

Concurrency debugging with differential schedule projections

Diagnosing type errors with class

Automatic error elimination by horizontal code transfer across multiple applications

Verification of producer-consumer synchronization in GPU programs

Optimizing off-chip accesses in multicores

Stateless model checking concurrent programs with maximal causality reduction

Efficient synthesis of probabilistic programs

Dynamic partial order reduction for relaxed memory models

Exploring and enforcing security guarantees via program dependence graphs

Defining the undefinedness of C

Autotuning algorithmic choice for input sensitivity

Blame and coercion: together again for the first time

Compositional certified resource bounds

Efficient execution of recursive programs on commodity vector hardware

Finding counterexamples from parsing conflicts

Synthesis of machine code from semantics

Provably correct peephole optimizations with alive

Light: replay via tightly bounded recording

Relaxing safely: verified on-the-fly garbage collection for x86-TSO

Improving compiler scalability: optimizing large programs at small price

Synthesizing racy tests

FlashRelate: extracting relational data from semi-structured spreadsheets using examples

Monitoring refinement via symbolic reasoning

Making numerical program analysis fast

KJS: a complete formal semantics of JavaScript

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code

Lightweight, flexible object-oriented generics

Peer-to-peer affine commitment using bitcoin

Loop and data transformations for sparse matrix code

Interactive parser synthesis by example

Synthesis of ranking functions using extremal counterexamples

Many-core compiler fuzzing

Verifying read-copy-update in a logic for weak memory

The Push/Pull model of transactions

Synthesizing data structure transformations from input-output examples

Preventing glitches and short circuits in high-level self-timed chip specifications

Tree dependence analysis

Verdi: a framework for implementing and formally verifying distributed systems

Profile-guided meta-programming

Relatively complete counterexamples for higher-order programs

Termination and non-termination specification inference

Synthesizing parallel graph programs via automated planning

A simpler, safer programming and execution model for intermittent systems

Type-and-example-directed program synthesis

Compositional certified resource bounds

Content Provider	ACM Digital Library
Author	Carbonneaux, Quentin Hoffmann, Jan Shao, Zhong
Abstract	This paper presents a new approach for automatically deriving worst-case resource bounds for C programs. The described technique combines ideas from amortized analysis and abstract interpretation in a unified framework to address four challenges for state-of-the-art techniques: compositionality, user interaction, generation of proof certificates, and scalability. Compositionality is achieved by incorporating the potential method of amortized analysis. It enables the derivation of global whole-program bounds with local derivation rules by naturally tracking size changes of variables in sequenced loops and function calls. The resource consumption of functions is described abstractly and a function call can be analyzed without access to the function body. User interaction is supported with a new mechanism that clearly separates qualitative and quantitative verification. A user can guide the analysis to derive complex non-linear bounds by using auxiliary variables and assertions. The assertions are separately proved using established qualitative techniques such as abstract interpretation or Hoare logic. Proof certificates are automatically generated from the local derivation rules. A soundness proof of the derivation system with respect to a formal cost semantics guarantees the validity of the certificates. Scalability is attained by an efficient reduction of bound inference to a linear optimization problem that can be solved by off-the-shelf LP solvers. The analysis framework is implemented in the publicly-available tool C4B. An experimental evaluation demonstrates the advantages of the new technique with a comparison of C4B with existing tools on challenging micro benchmarks and the analysis of more than 2900 lines of C code from the cBench benchmark suite. .
Starting Page	467
Ending Page	478
Page Count	12
File Format	PDF
ISBN	9781450334686
DOI	10.1145/2737924.2737955
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-06-03
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Resource bound analysis Lp solving Program logic Quantitative verification Amortized analysis Static analysis
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