Publications

Showing 1989
14.
Shapiro E. 1989. Linda in context Communications of the ACM. 1989 Oct , 32 (10):1244-1249.
13.
CODISH M., GALLAGHER J. & SHAPIRO E. 1989. Using safe approximations of fixed points for analysis of logic programs . 1989 , :233-261.
12.
GAIFMAN H., MAHER M. & SHAPIRO E. 1989. Reactive Behavior Semantics for Concurrent Constraint Logic‏ Programs - (Preliminary Version) . 1989 , :553-569.
11.
Shapiro E. 1989. The family of concurrent logic programming languages‏ Computing Surveys. 1989 Sept , 21 (3):413-510.
10.
Gerth R., Codish M. & Shapiro E. 1989. Control algebras for constraint logics and testing equivalence . 1989 , CS89-16 .
9.
GAIFMAN H. & SHAPIRO E. 1989. Fully abstract compositional semantics for logic programs‏ . 1989 , :134-142.
8.
Taylor S., Shapiro R. & Shapiro E. 1989. FCP: A summary of performance results . 1989 , :1364-1373.
7.
GAIFMAN H. & SHAPIRO E. 1989. Proof theory and semantics of logic programs‏ . 1989 , :50-62.
6.
HOURI A. & Shapiro E. 1989. A sequential abstract machine for Flat Concurrent Prolog‏ Journal of Logic Programming. 1989 Sept , 7 (2):85-123.
5.
LICHTENSTEIN Y. & Shapiro E. 1989. Concurrent algorithmic debugging . 1989 Jan , 24 :248-260.
4.
RECHES E., GUDES E. & Shapiro E. 1989. A distributed locking algorithm for a transactions system in flat concurrent prolog‏ . 1989 May , 367 :304-320.
3.
Shapiro E. 1989. OR-parallel PROLOG in flat concurrent PROLOG Journal of Logic Programming. 1989 May , 6 (3):243-267.
2.
A Houri, E Shapiro 1989. A sequential abstract machine for Flat Concurrent Prolog The Journal of Logic Programming . 1989 , 7 (2) :85-123.
1.
H Gaifman, E Shapiro 1989. Fully abstract compositional semantics for logic programs Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages. 1989 , .