pith. sign in

arxiv: 0708.0713 · v1 · submitted 2007-08-06 · 💻 cs.LO

Edit and verify

classification 💻 cs.LO
keywords extendedperformancestaticapproachesautomatedbottleneckchangescheckers
0
0 comments X
read the original abstract

Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental changes to the code. We propose to exploit this usage pattern to improve performance. We present two approaches of how to do so and a full solution.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.