Incremental Deletion: The Experiment
WS Presentations Main Page
Next: Incremental vs. Non-incremental
Up: Document: incanal
Previous: ``Bottom-up'' Deletion Algorithm
- The experiment:
- Each time a clause is deleted we can
- re-start analysis from scratch
- use incremental deletion
- using top-down algorithm
- using bottom-up algorithm.
- For each program we timed:
- time to analyze from scratch each time a clause is deleted (1)
- time to analyze incrementally using top-down algorithm (1/2.63)
- time to analyze incrementally using bottom-up algorithm
(1/8.21)
- Top-down / Bottom-up ratio: 3.12
- Average: 1 clause in 287 ms
Thu Jan 18 11:22:51 MET 1996 <herme@fi.upm.es>-<webmaster@clip.dia.fi.upm.es>