%A David Harel
%A R. Sherman
%T Looping vs. repeating in dynamic logic
%R Research Report CS83-02
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Harel
%A R. Sherman
%T Propositional dynamic logic of flowcharts
%R Research Report CS83-03
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Peleg
%T A generalized closure and complement phenomenon
%R Research Report CS83-04
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Harel
%T Recurring dominoes: making the highly undecidable highly understandable
%R Research Report CS83-05
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A Ehud Y. Shapiro
%T A subset of Concurrent Prolog and its interpreter
%R Research Report CS83-06
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983
%X This is a revised version of technical report TR-003,
ICOT-Institute for New Generation Computing Technology.

%A Ehud Y. Shapiro
%A Akikazu Takeuchi
%T Object oriented programming in Concurrent Prolog
%R Research Report CS83-08
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A Jeanette Schmidt-Pruzan
%A Eli Shamir
%A Eli Upfal
%T Random hypergraph coloring algorithms and the weak chromatic number
%R Research Report CS83-09
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A Jeanette Schmidt-Pruzan
%T Probabilistic analysis of strong hypergraph coloring algorithms
and the strong chromatic number
%R Research Report CS83-10
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Harel
%A David Peleg
%T Process logic with regular formulas
%R Research Report CS83-11
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A L. Hellerstein
%A Ehud Y. Shapiro
%T Implementing parallel algorithms in Concurrent Prolog
%R Research Report CS83-12
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983
%X Summary/draft, August 1983

%A Zohar Manna
%A Amir Pnueli
%T How to cook a temporal proof system for your pet language
%R Research Report CS83-13
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Harel
%T A simple highly undecidable domino problem
(or, a lemma on infinite trees, with applications)
%R Research Report CS83-14
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A David Harel
%A David Peleg
%T On static logics, dynamic logics and complexity classes
%R Research Report CS83-15
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A Achi Brandt
%A Dan Ophir
%T Gridpack: toward unification of general grid programming
%R Research Report CS83-17
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A Yishai A. Feldman
%T A decidable propositional probabilistic dynamic logic
%R Research Report CS83-18
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983

%A A. Shamir
%A C. P. Schnorr
%T Cryptanalysis of certain variants of Rabin's signature scheme
%R Research Report CS83-20
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1983
%K cryptography, digital signatures

%A Jeanette Schmidt-Pruzan
%A Eli Shamir
%T Component structure of random hypergraphs
%R Research Report CS83-19
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Zohar Manna
%A Amir Pnueli
%T Proving precedence properties: the temporal way
%R Research Report CS84-04
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A David Harel
%T Statecharts: a visual approach to complex systems
%R Research Report CS84-05
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Ehud Y. Shapiro
%A Colin Mierowsky
%T Fair, biased, and self-balancing merge operators:
their specification and implementation in Concurrent Prolog
%R Research Report CS84-07
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A A. Fiat
%A A. Shamir
%A Y. Tulpan
%T How to control the use of software
%R Research Report CS84-08
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Howard Barringer
%A Ruurd Kuiper
%A Amir Pnueli
%T Now you may compose temporal logic specifications
%R Research Report CS84-09
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Ehud Y. Shapiro
%T The Bagel: a systolic Concurrent Prolog machine (lecture notes)
%R Research Report CS84-10
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Dorit Ron
%A Flavia Rosemberg
%A Amir Pnueli
%T A hardware implementation of the CSP primitives and its verification
%R Research Report CS84-11
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Aviezri S. Fraenkel
%A Elisheva Goldschmidt
%T PSPACE-hardness of some combinatorial games
%R Research Report CS84-12
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Irit Cohen
%A Aviezri S. Fraenkel
%T LIRSORT - linked radix sort
%R Research Report CS84-13
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A David Peleg
%T Concurrent dynamic logic
%R Research Report CS84-14
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Amir Pnueli
%A Lenore Zuck
%T Verification of multiprocess probabilistic protocols
%R Research Report CS84-18
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Colin Mierowsky
%T Design and implementation of flat Concurrent Prolog
%R Research Report CS84-21
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984
%O M.S. Thesis

%A Charlene Bloch
%T Source-to-source transformations of logic programs
%R Research Report CS84-22
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984
%O M.S. Thesis

%A Omri Viner
%T Distributed constraint propagation
%R Research Report CS84-24
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984
%O thesis

%A David Peleg
%T Concurrent program schemes and their logics
%R Research Report CS84-25
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Orna Lichtenstein
%A Amir Pnueli
%T Checking that finite state concurrent programs
satisfy their linear specification
%R Research Report CS84-26
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Yossi Nygate
%T Python: a bridge expert on squeezes
%R Research Report CS84-27
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1984

%A Ehud Y. Shapiro
%A Muli Safra
%T Fast multiway merge using destructive operations
%R Research Report CS85-01
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1985

%A David Harel
%A Amir Pnueli
%T On the development of reactive systems
%R Research Report CS85-02
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1985

%A Orna Lichtenstein
%A Amir Pnueli
%A Lenore Zuck
%T The glory of the past
%R Research Report CS85-04
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1985
%K propositional temporal logic

%A C. Mierowsky
%A S. Taylor
%A E. Shapiro
%A J. Levy
%A S. Safra
%T The design and implementation of Flat Concurrent Prolog
%R Research Report CS85-09
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D July 1985

%A Stephen Taylor
%A Lisa Hellerstein
%A Shmual Safra
%A Ehud Y. Shapiro
%T Notes on the complexity of systolic programs
%R Research Report CS86-16
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D November 1985

%A Stephen Taylor
%A Evyatar Av-Ron
%A Ehud Shapiro
%T A layered method for process and code mapping
%R Research Report CS86-17
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D March 1986
%K Flat Concurrent Prolog, Intel iPSC Hypercube

%A A. Houri
%A E. Shapiro
%T A sequential abstract machine for Flat Concurrent Prolog
%R Research Report CS86-19
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1986

%A W. Silverman
%A et al
%T The Logic system user manual, version 1.2
%R Research Report CS86-21
%I Department of Applied Mathematics, Weizmann Institute of Science
%C Rehovot, Israel
%D 1986