Time Bounds for General Function Pointers | Zendy

Robert Dockins | Zendy; Aquinas Hobor | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Time Bounds for General Function Pointers

Author(s) -

Robert Dockins,

Aquinas Hobor

Publication year - 2012

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2012.08.010

Subject(s) - soundness , computer science , programming language , quantifier (linguistics) , function (biology) , bounding overwatch , theoretical computer science , semantics (computer science) , algorithm , artificial intelligence , evolutionary biology , biology

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research