#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2002

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning… (More)

- Yoad Lustig, Moshe Y. Vardi
- International Journal on Software Tools for…
- 2009

Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is “constructed from scratch” rather than “composed” from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial system, either in hardware… (More)

- Dana Fisman, Orna Kupferman, Yoad Lustig
- TACAS
- 2008

Distributed systems are composed of processes connected in some network. Distributed systems may suffer from faults: processes may stop, may be interrupted, and may be maliciously attacked. Fault-tolerant protocols are designed to be resistant to faults. Proving the resistance of protocols to faults is a very challenging problem, as it combines the… (More)

- Dana Fisman, Orna Kupferman, Yoad Lustig
- TACAS
- 2010

Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems often interact with other systems, or agents. Many times these agents have objectives of their own, other than to fail the system. Thus, it makes sense to model system environments not as… (More)

- Orna Kupferman, Yoad Lustig
- Int. J. Found. Comput. Sci.
- 2007

Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed Kripke structures, in which the elements in the set are partially ordered, are useful in abstraction, query checking, and reasoning about multiple view-points. The challenges… (More)

- Oded Goldreich, Yoad Lustig, Moni Naor
- IACR Cryptology ePrint Archive
- 2002

We consider the security of multiple and possibly related plaintexts in the context of a chosen ciphertext attack. That is the attacker in addition and concurrently to obtaining encryptions of multiple plaintexts under the same key, may issue encryption and decryption queries and partial information queries. Loosely speaking, an encryption scheme is… (More)

- Orna Kupferman, Yoad Lustig
- VMCAI
- 2007

Several verification methods involve reasoning about multi-valued systems, in which an atomic proposition is interpreted at a state as a lattice element, rather than a Boolean value. The automata-theoretic approach for reasoning about Boolean-valued systems has proven to be very useful and powerful. We develop an automata-theoretic framework for reasoning… (More)

- Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, Mihalis Yannakakis
- STACS
- 2011

Temporal synthesis is the automated construction of a system from its temporal specification. It is by now realized that requiring the synthesized system to satisfy the specifications against all possible environments may be too demanding, and, dually, allowing all systems may be not demanding enough; systems and environments that are too large may not be… (More)

- Dana Fisman, Yoad Lustig
- CONCUR
- 2015

The problem of Büchi determinization is a fundamental problem with important applications in reactive synthesis, multi-agent systems and probabilistic verification. The first asymptotically optimal Büchi determinization (a.k.a the Safra construction), was published in 1988. While asymptotically optimal, the Safra construction is notorious for its technical… (More)

- Yoad Lustig, Moshe Y. Vardi
- GandALF
- 2011

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms it is always assumed that the system is ”constructed from scratch” rather than composed from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial software system relies heavily on using… (More)