English
Related papers

Related papers: How to Handle Assumptions in Synthesis

200 papers

Reactive synthesis is a paradigm for automatically building correct-by-construction systems that interact with an unknown or adversarial environment. We study how to do reactive synthesis when part of the specification of the system is that…

Logic in Computer Science · Computer Science 2018-04-23 Daniel J. Fremont , Sanjit A. Seshia

Reactive computer systems bear inherent complexity due to continuous interactions with their environment. While this environment often proves to be uncontrollable, we still want to ensure that critical computer systems will not fail, no…

Computer Science and Game Theory · Computer Science 2012-10-19 Mickael Randour

In this article we propose a set of simple principles to guide empirical practice in synthetic control studies. The proposed principles follow from formal properties of synthetic control estimators, and pertain to the nature, implications,…

Methodology · Statistics 2022-03-15 Alberto Abadie , Jaume Vives-i-Bastida

Compositional synthesis relies on the discovery of assumptions, i.e., restrictions on the behavior of the remainder of the system that allow a component to realize its specification. In order to avoid losing valid solutions, these…

Logic in Computer Science · Computer Science 2022-07-05 Bernd Finkbeiner , Niklas Metzger , Yoram Moses

In synthesis, assumptions are constraints on the environment that rule out certain environment behaviors. A key observation here is that even if we consider systems with LTLf goals on finite traces, environment assumptions need to be…

Artificial Intelligence · Computer Science 2019-12-18 Shufang Zhu , Giuseppe De Giacomo , Geguang Pu , Moshe Vardi

The reactive synthesis problem is to find a finite-state controller that satisfies a given temporal-logic specification regardless of how its environment behaves. Developing a formal specification is a challenging and tedious task and…

Logic in Computer Science · Computer Science 2013-08-20 Rajeev Alur , Salar Moarref , Ufuk Topcu

When reasoning about the strategic capabilities of an agent, it is important to consider the nature of its adversaries. In the particular context of controller synthesis for quantitative specifications, the usual problem is to devise a…

Computer Science and Game Theory · Computer Science 2014-04-04 Véronique Bruyère , Emmanuel Filiot , Mickael Randour , Jean-François Raskin

The aim of my Ph.D. thesis concerns Reasoning in Highly Reactive Environments. As reasoning in highly reactive environments, we identify the setting in which a knowledge-based agent, with given goals, is deployed in an environment subject…

Artificial Intelligence · Computer Science 2019-09-19 Francesco Pacenza

We propose Teamwork Synthesis, a version of the distributed synthesis problem with application to teamwork multi-agent systems. We reformulate the distributed synthesis question by dropping the fixed interaction architecture among agents as…

Logic in Computer Science · Computer Science 2023-05-15 Yehia Abd Alrahman , Nir Piterman

Program synthesis is the task of constructing a program conforming to a given specification. We focus on deductive synthesis, and in particular on synthesis problems with specifications given as $\forall\exists$-formulas, expressing the…

Logic in Computer Science · Computer Science 2025-08-15 Márton Hajdu , Petra Hozzová , Laura Kovács , Andrei Voronkov , Eva Maria Wagner , Richard Steven Žilinčík

Program synthesis techniques construct or infer programs from user-provided specifications, such as input-output examples. Yet most specifications, especially those given by end-users, leave the synthesis problem radically ill-posed,…

Artificial Intelligence · Computer Science 2020-10-22 Yewen Pu , Kevin Ellis , Marta Kryven , Josh Tenenbaum , Armando Solar-Lezama

This report describes several approaches for handling synthesis conjectures within an Satisfiability Modulo Theories (SMT) solver. We describe approaches that primarily focus on determining the unsatisfiability of the negated form of…

Logic in Computer Science · Computer Science 2015-10-12 Andrew Reynolds

The reference to assumptions in how practitioners use or interact with machine learning (ML) systems is ubiquitous in HCI and responsible ML discourse. However, what remains unclear from prior works is the conceptualization of assumptions…

Human-Computer Interaction · Computer Science 2025-02-20 Ramaravind Kommiya Mothilal , Faisal M. Lalani , Syed Ishtiaque Ahmed , Shion Guha , Sharifa Sultana

Synthesizing and converting environmental sounds have the potential for many applications such as supporting movie and game production, data augmentation for sound event detection and scene classification. Conventional works on synthesizing…

We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to stimulate and guide advances in the design and application of synthesis procedures for reactive systems. The first iteration of SYNTCOMP is based on…

Reactive synthesis is a technology for the automatic construction of reactive systems from logical specifications. In these lecture notes, we study different algorithms for the reactive synthesis problem of linear-time temporal logic (LTL).…

Logic in Computer Science · Computer Science 2018-03-28 Bernd Finkbeiner , Felix Klein

At our behest or otherwise, while our software is being executed, a huge variety of design assumptions is continuously matched with the truth of the current condition. While standards and tools exist to express and verify some of these…

Software Engineering · Computer Science 2016-05-09 Vincenzo De Florio

In the synthesis problem, we are given a specification, and we automatically generate a system that satisfies the specification in all environments. We introduce and study {\em synthesis with guided environments} (SGE, for short), where the…

Logic in Computer Science · Computer Science 2025-07-29 Orna Kupferman , Ofer Leshkowitz

Reactive synthesis is a class of methods to construct a provably-correct control system, referred to as a robot, with respect to a temporal logic specification in the presence of a dynamic and uncontrollable environment. This is achieved by…

Formal Languages and Automata Theory · Computer Science 2020-04-24 Abhishek N. Kulkarni , Jie Fu

Humans constantly interact with their surrounding environments. Current human-centric generative models mainly focus on synthesizing humans plausibly interacting with static scenes and objects, while the dynamic human action-reaction…

Computer Vision and Pattern Recognition · Computer Science 2024-03-19 Liang Xu , Yizhou Zhou , Yichao Yan , Xin Jin , Wenhan Zhu , Fengyun Rao , Xiaokang Yang , Wenjun Zeng