Efficient analysis of concurrent constraint logic programs
- 1 January 1993
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Suspension analyses for concurrent logic programsACM Transactions on Programming Languages and Systems, 1994
- Deadlock analysis in networks of communicating processesDistributed Computing, 1991
- Data flow analysis of communicating finite state machinesACM Transactions on Programming Languages and Systems, 1991
- The semantic foundations of concurrent constraint programmingPublished by Association for Computing Machinery (ACM) ,1991
- The family of concurrent logic programming languagesACM Computing Surveys, 1989
- Moded type systems for logic programmingPublished by Association for Computing Machinery (ACM) ,1989
- Notes on Communicating Sequential SystemsPublished by Springer Nature ,1986
- Closures and fairness in the semantics of programming logicTheoretical Computer Science, 1984
- Deadlock absence proofs for networks of communicating processesInformation Processing Letters, 1979
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977