symbolic polytopes for quantitative interpolation and
play

Symbolic Polytopes for Quantitative Interpolation and Verification - PowerPoint PPT Presentation

Symbolic Polytopes for Quantitative Interpolation and Verification Klaus v. Gleissenthall, TU Munich joint work with Andrey Rybalchenko, Microsoft Research and Boris Kpf, IMDEA Verification Quantitative verification Quantitative


  1. Symbolic Polytopes for Quantitative Interpolation and Verification Klaus v. Gleissenthall, TU Munich joint work with Andrey Rybalchenko, Microsoft Research and Boris Köpf, IMDEA

  2. Verification

  3. Quantitative verification

  4. Quantitative reachability property

  5. This talk ž Constraint solving problem ž Quantitative interpolation ž Symbolic polytopes and generating functions

  6. Program as formula int ¡v; ¡ ¡ main(int ¡k) ¡{ ¡ ¡ ¡ ¡init(v,k); ¡ ¡ ¡ ¡while ¡(1) ¡step(v); ¡ ¡ } ¡

  7. Quantitative verification is a logic problem

  8. Simple yet expressive

  9. Unfold, guess, and check Bounded problem Recursion check 9

  10. Bounded problem is interpolation [Craig’57, McMillan’03]

  11. Interpolants as polytopes ž Integer points represented by linear inequalities ž Model for numeric data types

  12. Generating functions

  13. Decomposition [Brion’88, Barvinok’93]

  14. Quantitative interpolation w/o size

  15. Evaluation

  16. Find h: generating recursive bounded functions

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend