Zohar Manna

Zohar Manna

Zohar Manna (born 1939) is a professor of computer science at Stanford University. He is the author of "The Mathematical Theory of Computation" (McGraw Hill, 1974; reprinted Dover, 2003), one of the first texts to provide extensive coverage of the mathematical concepts behind computer programming.

With Amir Pnueli, he co-authored an unfinished trilogy of textbooks on temporal logic and verification of reactive systems: "The Temporal Logic of Reactive and Concurrent Systems: Specification" (Springer-Verlag, 1991), "The Temporal Logic of Reactive and Concurrent Systems: Safety" (Springer-Verlag, 1995) and "The Temporal Logic of Reactive and Concurrent Systems: Progress" (unpublished; first three chapters posted at [http://theory.stanford.edu/~zm/tvors3.html http://theory.stanford.edu/~zm/tvors3.html] ).

In 1994 he was inducted as a Fellow of the Association for Computing Machinery.

External links

* [http://theory.stanford.edu/~zm/ Zohar Manna's home page]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Manna (disambiguation) — Manna is the food produced for the Israelites in the desert, as described in the Biblical book of Exodus. Manna may also refer to: Metropolitan AIDS Neighborhood Nutrition Alliance the Gothic word for man , related to the *mannaz rune Manna… …   Wikipedia

  • Richard Waldinger — Richard J. Waldinger is a computer science researcher at SRI Artificial Intelligence Laboratory (where he has worked since 1969) whose interests focus on the application of automated deductive reasoning to problems in software engineering and… …   Wikipedia

  • McCarthy 91 function — The McCarthy 91 function is a recursive function, defined by computer scientist John McCarthy as a test case for formal verification within computer science. The McCarthy 91 function is defined as The results of evaluating the function are given… …   Wikipedia

  • List of computer scientists — Expand list|date=August 2008This is a list of well known computer scientists, people who do work in computer science, in particular researchers and authors.Some persons notable as programmers are included here because they work in research as… …   Wikipedia

  • Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… …   Wikipedia

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Adi Shamir — Infobox Scientist name = Adi Shamir image width = 200px caption = At the CRYPTO 2003 conference birth date = 1952 birth place = Tel Aviv, Israel death date = death place = residence = Israel citizenship = nationality = ethnicity = field =… …   Wikipedia

  • Alan Perlis — Infobox Scientist name = Alan Jay Perlis birth date = birth date|1922|4|1 birth place = Pittsburgh, Pennsylvania, USA death date = death date and age|1990|2|7|1922|4|1 death place = nationality = USA field = Computer Science work institution =… …   Wikipedia

  • Temporal logic — In logic, the term temporal logic is used to describe any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time. It is sometimes also used to refer to tense logic, a particular modal logic… …   Wikipedia

  • Structured program theorem — The structured program theorem is a result in programming language theory. It states that every computable function can be implemented in a programming language that combines subprograms in only three specific ways. These three control structures …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”