Abstract
In this paper a formal model for program dependence analysis of concurrent logic programs is proposed with the following contributions. First, two language-independent program representations are presented for explicitly representing control flows and/or data flows in a concurrent logic program. Then based on these representations, program dependences between literals in concurrent logic programs are defined formally, and a dependence-based program representation named the Literal Dependence Net (LDN) is presented for explicitly representing primary program dependences in a concurrent logic program. Finally, as applications of the LDNs, some important software engineering activities including program slicing, debugging, testing, complexity measurement, and maintenance are discussed in a programming environment for concurrent logic programs.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS |
| Publisher | IEEE |
| Pages | 282-291 |
| Number of pages | 10 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) - Tokyo, Jpn Duration: Jun 3 1996 → Jun 6 1996 |
Other
| Other | Proceedings of the 1996 International Conference on Parallel and Distributed Systems (ICPADS'96) |
|---|---|
| City | Tokyo, Jpn |
| Period | 6/3/96 → 6/6/96 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture