Skip to main content

Debugger for a parallel logic programing language Fleng

  • Concurrent Programming
  • Conference paper
  • First Online:
Logic Programming '89 (LP 1989)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 485))

Included in the following conference series:

  • 126 Accesses

Abstract

For the programming environment of a parallel logic programming language, it is an important problem to develop a debugger. However it is difficult to debug parallel programs by observing their execution traces. Using the characteristics of logic programming languages, one solution to this problem is debugging using declarative semantics programs. However parallel logic programming languages (Concurrent Prolog, GHC, etc.) are not pure logic programming languages because of their new primitives for synchronization. We must consider the causality relation between input and output because some operational meaning must be added to the declarative semantics for parallel logic programs. Hence, in this paper, we introduce a communicating process model to represent execution of parallel logic programs. And we present extended algorithmic debugging using this model.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brock, J. D. and Ackermann, W. B.: Scenarios: A Model of Nondeterminate Computation, Lecture Notes in Computer Science, No. 107, 1981.

    Google Scholar 

  2. Clark, K. and Gregory, S.: PARLOG: Parallel Programming in Logic, In ACM Transactions on Programming Language and Systems, Vol. 8, No. 1, 1986.

    Google Scholar 

  3. Lichtenstein, Y. and Shapiro E.: Abstract Algorithmic Debugging, Logic programming: proceedings of the fifth international conference and symposium, 1988.

    Google Scholar 

  4. Murakami, M.: An Axiomatic Verification Method for Synchronization of Guarded Horn Clauses Programs, Technical Report TR-339, 1988.

    Google Scholar 

  5. Murakami, M.: A Declarative Semantics of Parallel Logic Programs with Perpetual Processes, Technical Report TR-406, ICOT, 1988.

    Google Scholar 

  6. Nilsson, M. and Tanaka, H.: Fleng Prolog — The Language which turns Supercomputers into Prolog Machines, In Wada, E. (Ed.): Logic Programming '86, LNCS 264, Springer-Verlag, 1986.

    Google Scholar 

  7. Shapiro, E.: A Subset of Concurrent Prolog and Its Interpreter, Technical Report TR-003, ICOT, 1983.

    Google Scholar 

  8. Shapiro, E.: Algorithmic Program Debugging, MIT Press, 1983.

    Google Scholar 

  9. Takeuchi, A.: Algorithmic Debugging of GHC Programs and Its Implementation in GHC, Technical Report TR-185, ICOT, 1986.

    Google Scholar 

  10. Takeuchi, A.: A Semantic Model of Guarded Horn Clauses Technical Report, ICOT, 1987.

    Google Scholar 

  11. Ueda, K.: Guarded Horn Clauses, Technical Report, TR-103, ICOT, 1985.

    Google Scholar 

  12. Ueda, K.: GHC Compiler User's Guide, NEC Corporation, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Koichi Furukawa Hozumi Tanaka Tetsunosuke Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tatemura, J., Tanaka, H. (1991). Debugger for a parallel logic programing language Fleng. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '89. LP 1989. Lecture Notes in Computer Science, vol 485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53919-0_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-53919-0_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53919-3

  • Online ISBN: 978-3-540-46398-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics