Edit and verify
| dc.creator | Grigore, Radu | |
| dc.creator | Moskal, Michał | |
| dc.date | 2007-08-06 | |
| dc.date.accessioned | 2026-07-07T08:22:18Z | |
| dc.date.available | 2026-07-07T08:22:18Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0708.0713 | |
| dc.identifier | http://arxiv.org/abs/0708.0713 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/135608 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.2.4 | |
| dc.title | Edit and verify | |
| dc.type | text |