Time Bounds for General Function Pointers

Authors:
Robert Dockins;Aquinas Hobor
Affiliations:
Princeton University;National University of Singapore
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2012

Citing 12
Cited 0

A compositional logic for polymorphic higher-order functions

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
From process logic to program logic

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Semantics of types for mutable state

Semantics of types for mutable state
A program logic for resources

Theoretical Computer Science
State-dependent representation independence

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Oracle semantics

Oracle semantics
A theory of indirection via approximation

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nested Hoare triples and frame rules for higher-order store

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
The approximation modality in models of higher-order types

The approximation modality in models of higher-order types
A logical mix of approximation and separation

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Boogie: a modular reusable verifier for object-oriented programs

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Descriptive and relative completeness of logics for higher-order functions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a logic of explicit time resource bounds for a language with function pointers and semantic assertions. We apply our logic to examples containing nontrivial ''higher-order'' uses of function pointers and we prove soundness with respect to a standard operational semantics. Our core technique is very compact and may be applicable to other resource bounding problems, and is the first application of step-indexed models in which the outermost quantifier is existential instead of universal. Our results are machine checked in Coq.