THE TEMPORAL SEMANTICS OF CONCURRENT PROGRAMSPNUELI A.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 13; NO 1; PP. 45-60; BIBL. 24 REF.Article

THE MODAL LOGIC OF PROGRAMSMANNA Z; PNUELI A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 385-409; BIBL. 7 REF.Conference Paper

A DIRECT ALGORITHM FOR CHECKING EQUIVALENCE OF LL(K) GRAMMARS.OLSHANSKY T; PNUELI A.1977; THEOR. COMPUTER SCI.; NETHERL.; DA. 1977; VOL. 4; NO 3; PP. 321-349; BIBL. 14 REF.Article

REALIZING AN EQUATIONAL SPECIFICATIONPNUELI A; ZARHI R.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 459-478; BIBL. 12 REF.Conference Paper

AUTOMATIC PROGRAMMING OF FINITE STATE LINEAR PROGRAMSPNUELI A; SLUTZKI G.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 519-535; BIBL. 8 REF.Article

AXIOMATIC APPROACH TO TOTAL CORRECTNESS OF PROGRAMS.MANNA Z; PNUELI A.1974; ACTA INFORMAT.; ALLEM.; DA. 1974; VOL. 3; NO 3; PP. 243-263; BIBL. 5 REF.Article

Adiabatic charge transport, the eta invariant, and Hall conductance for spinorsPNUELI, A.Journal of physics. A, mathematical and general. 1994, Vol 27, Num 7, pp 2593-2604, issn 0305-4470Article

SYNCHRONOUS SCHEMES AND THEIR DECISION PROBLEMSMANNA Z; PNUELI A.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 62-67; BIBL. 8 REF.Conference Paper

PERMUTATION GRAPHS AND TRANSITIVE GRAPHSEVEN S; PNUELI A.1972; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1972; VOL. 19; NO 3; PP. 400-410; BIBL. 4 REF.Serial Issue

NON-PROCEDURAL COMPUTER PROGRAMMING WITH MODELSHASTRY S; PRYWES N; PNUELI A et al.1977; COMPSAC 77. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 1/1977-11-08/CHICAGO; USA; NEW YORK: IEEE; DA. 1977; 500-506; BIBL. 8 REF.Conference Paper

TERMINATION OF PROBABILISTIC CONCURRENT PROGRAMS (EXTENDED ABSTRACT)HART S; SHARIR M; PNUELI A et al.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 1-6; BIBL. 8 REF.Conference Paper

FINITE MODELS FOR DETERMINISTIC PROPOSITIONAL DYNAMIC LOGICBEN ARI M; HALPERN JY; PNUELI A et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 249-263; BIBL. 10 REF.Conference Paper

The grammar of dimensions in machine drawingsDORI, D; PNUELI, A.Computer vision, graphics, and image processing. 1988, Vol 42, Num 1, pp 1-18, issn 0734-189XArticle

Proving partial order propertiesPELED, D; PNUELI, A.Theoretical computer science. 1994, Vol 126, Num 2, pp 143-182, issn 0304-3975Article

Probabilistic verificationPNUELI, A; ZUCK, L. D.Information and computation (Print). 1993, Vol 103, Num 1, pp 1-29, issn 0890-5401Article

Automatic program generation in distributed cooperative computationPRYWES, N; PNUELI, A.IEEE transactions on systems, man, and cybernetics. 1984, Vol 14, Num 2, pp 275-286, issn 0018-9472Article

ON THE TEMPORAL ANALYSIS OF FAIRNESSGABBAY D; PNUELI A; SHELAH S et al.1980; ANNUAL SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 7/1980/LAS VEGAS NV; USA; NEW YORK: ACM; DA. 1980; PP. 163-173; BIBL. 14 REF.Conference Paper

A linear-history semantics for languages for distributed programmingFRANCEZ, N; LEHMANN, D; PNUELI, A et al.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 25-46, issn 0304-3975Article

Fair termination revisited-with delayAPT, K. R; PNUELI, A; STAVI, J et al.Theoretical computer science. 1984, Vol 33, Num 1, pp 65-84, issn 0304-3975Article

Verification of data-insensitive circuits : An in-order-retirement case studyPNUELI, A; ARONS, T.Lecture notes in computer science. 1998, pp 351-368, issn 0302-9743, isbn 3-540-65191-8Conference Paper

Symmetric and economical solutions to the mutual exclusion problem in a distributed systemCOHEN, S; LEHMANN, D; PNUELI, A et al.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 215-225, issn 0304-3975Conference Paper

A comparison of two verification methods for speculative instruction executionARONS, T; PNUELI, A.Lecture notes in computer science. 2000, pp 487-502, issn 0302-9743, isbn 3-540-67282-6Conference Paper

Translation validationPNUELI, A; SIEGEL, M; SINGERMAN, E et al.Lecture notes in computer science. 1998, pp 151-166, issn 0302-9743, isbn 3-540-64356-7Conference Paper

Very high level concurrent programmingSHI, Y; PRYWES, N; SZYMANSKI, B et al.IEEE transactions on software engineering. 1987, Vol 13, Num 9, pp 1038-1046, issn 0098-5589Article

Is the interesting part of process logic uninteresting?: a translation from PL to PDLSHERMAN, R; PNUELI, A; HAREL, D et al.SIAM journal on computing (Print). 1984, Vol 13, Num 4, pp 825-839, issn 0097-5397Article