• Published 2011

Verifying Time Bounds for General Function Pointers

@inproceedings{Dockins2011VerifyingTB,
  title={Verifying Time Bounds for General Function Pointers},
  author={Robert Dockins and Aquinas Hobor},
  year={2011}
}
We develop a logic of explicit time resource bounds for a lang uage with function pointers and semantic assertions. We apply ou r l gic to examples containing nontrivial “higher-order” uses of functio n 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 bound ing problems, and is the first application of step-indexed models in which the o utermost quantifier is existential instead of… CONTINUE READING

Figures from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

A theory of terminat on via indirection

  • K. H. Hofmann G. Gierz, K. Kiemel, J. D. Lawson, M. Mislove, D. S. Scott
  • Modelling , Controlling and Reasoning About State
  • 2010

Appel and Sandrine Blazy . Separation logicfor smallstep C minor

  • W. Andrew
  • TPHOLS , pages
  • 2007

Descriptive andrelative completeness of logics for higher - order functions

  • M. Berger K. Honda, N. Yoshida
  • Continuous Lattices and Domains , volume 93 of Encylopedia of Mathematics and its Applications
  • 2003