Automated Complexity Analysis Based on the Dependency Pair Method
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but significantly extends the analytic power of existing direct methods. Our findings extend the class of TRSs whose linear or quadratic runtime complexity can be detected automatically. We provide ample numerical data for assessing the viability of the method.Proceedings of the 4th International Joint Conference, IJCAR 2008 Sydney, Australia, August 12-15, 2008
- Springerの論文
Springer | 論文
- Comparisons of germination traits of alpine plants between fellfield and snowbed habitats
- Photoreceptor Images of Normal Eyes and of Eyes with Macular Dystrophy Obtained In Vivo with an Adaptive Optics Fundus Camera
- Effect of Electrical Stimulation on IGF-1 Transcription by L-Type Calcium Channels in Cultured Retinal Muller Cells
- In Vivo Measurements of Cone Photoreceptor Spacing in Myopic Eyes from Images Obtained by an Adaptive Optics Fundus Camera
- Optical Quality of the Eye Degraded by Time-Varying Wavefront Aberrations with Tear Film Dynamics