The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and programâ€¦ (More)

Since the introduction of temporal logic for the specification of computer programs [5], usability has been an issue, because a difficult-to-use formalism is a barrier to the wide adoption of formalâ€¦ (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â€¦ (More)

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.â€¦ (More)

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,â€¦ (More)

The language PSL [1] is a temporal logic standardized by the Accellera standards organization and currently undergoing the process of becoming an IEEE standard. The core of PSL, denoted here LTL WR,â€¦ (More)

In recent years, it has been established that regular model checking can be successfully applied to several parameterized veriication problems. However, there are many parameterized veriicationâ€¦ (More)

Nearly all algorithms for learning an unknown regular language, in particular the popular Lâˆ— algorithm, yield deterministic finite automata. It was recently shown that the ideas of Lâˆ— can be extendedâ€¦ (More)

This document describes a proposal for the formal syntax and semantics of Accellera PSL. The clocked semantics for the ltl subset follows the paper [5], with the exception that strength is applied atâ€¦ (More)