| Abstract | .... 2 | |
| 1 | Introduction | .... 2 |
| 1.1 | Review of Concurrent Logic Programs | .... 3 |
| 1.2 | Motivation and Goals | .... 5 |
| 2 | Background Paths and Modes | .... 6 |
| 3 | Constraint Propagation Algorithm | .... 7 |
| 3.1 | Data Structures | .... 8 |
| 3.2 | Graph Creation | .... 10 |
| 3.3 | Abstract Unification | .... 11 |
| 3.4 | On Completencess | .... 15 |
| 4 | Process Network Analyzer | .... 16 |
| 4.1 | Distributed Unification | .... 16 |
| 4.2 | Terminating Unification | .... 17 |
| 4.3 | Accessing the Graph | .... 17 |
| 4.4 | Comparison with Static Analysis | .... 18 |
| 5 | Finite Domain Analysis | .... 19 |
| 5.1 | On Completeness | .... 20 |
| 6 | Mode Inference Method | .... 21 |
| 6.1 | Model Generation | .... 21 |
| 6.2 | Mode Analysis in MGTP | .... 22 |
| 6.3 | On Completeness | .... 25 |
| 7 | Performance Comparison | .... 26 |
| 7.1 | Execution Measurements | .... 27 |
| 8 | Summary and Conclusions | .... 30 |
| Acknowledgments | .... 31 | |
| References | .... 31 | |
| End | .... 33 |
ICOT研究論文(TR)一覧に戻る / Back to the list of ICOT Technical Reports