#### Filter Results:

- Full text PDF available (208)

#### Publication Year

1969

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

#### Organism

Learn More

- Amir Pnueli
- 18th Annual Symposium on Foundations of Computer…
- 1977

A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in which the time dependence of events is the basic concept. Two formal systems are presented for providing a basis for temporal reasoning. One forms a formalization of the method of… (More)

- Zohar Manna, Amir Pnueli
- 1992

Imagine that you get such certain awesome experience and knowledge by only reading a book. How can? It seems to be greater when a book can be the best thing to discover. Books now will appear in printed and soft file collection. One of them is this book the temporal logic of reactive and concurrent systems specification. It is so usual with the printed… (More)

- David Harel, Hagi Lachover, +5 authors Mark B. Trakhtenbrot
- IEEE Trans. Software Eng.
- 1988

This paper provides a brief overview of the STATEMATE system, constructed over the past three years by i-Logix Inc., and Ad Cad Ltd. STATEMATE is a graphical working environment, intended for the specification, analysis, design and documentation of large and complex reactive systems, such as real-time embedded systems, control and communication systems, and… (More)

- Nir Piterman, Amir Pnueli, Yaniv Sa'ar
- VMCAI
- 2006

We consider the problem of synthesizing digital designs from their LTL specification. In spite of the theoretical double exponential lower bound for the general case, we show that for many expressive specifications of hardware designs the problem can be solved in time N . We describe the context of the problem, as part of the Prosyd European Project which… (More)

- Zohar Manna, Amir Pnueli
- 1995

One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain those all requirements when having much money? Why don't you try to get something simple at first? That's something that will lead you to know more about the world, adventure, some places, history, entertainment, and more? It is… (More)

- Amir Pnueli, Roni Rosner
- POPL
- 1989

We consider the synthesis of a reactive module with input <italic>x</italic> and output <italic>y</italic>, which is specified by the linear temporal formula @@@@(<italic>x</italic>, <italic>y</italic>). We show that there exists a program satisfying @@@@ iff the branching time formula (∀<italic>x</italic>) (∃<italic>y</italic>)… (More)

- Mordechai Ben-Ari, Zohar Manna, Amir Pnueli
- Acta Informatica
- 1981

A temporal language and system are presented which are based on branching time structure. By the introduction of symmetrically dual sets of temporal operators, it is possible to discuss properties which hold either along one path or along all paths. Consequently it is possible to express in this system all the properties that were previously expressible in… (More)

- Amir Pnueli
- Theor. Comput. Sci.
- 1979

- David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
- LICS
- 1987

- Orna Lichtenstein, Amir Pnueli
- POPL
- 1985

We present an algorithm for checking satisfiability of a linear time temporal logic formula over a finite state concurrent program. The running time of the algorithm is exponential in the size of the formula but linear in the size of the checked program. The algorithm yields also a formal proof in case the formula is valid over the program. The algorithm… (More)