Symbolic Repairs for GR(1) Specifications

Shahar Maoz, Jan Oliver Ringert, Rafi Shalom

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Unrealizability is a major challenge for GR(1), an expressive assume-guarantee fragment of LTL that enables efficient synthesis. Some works attempt to help engineers deal with unrealizability by generating counter-strategies or computing an unrealizable core. Other works propose to repair the unrealizable specification by suggesting repairs in the form of automatically generated assumptions. In this work we present two novel symbolic algorithms for repairing unrealizable GR(1) specifications. The first algorithm infers new assumptions based on the recently introduced JVTS. The second algorithm infers new assumptions directly from the specification. Both algorithms are sound. The first is incomplete but can be used to suggest many different repairs. The second is complete but suggests a single repair. Both are symbolic and therefore efficient. We implemented our work, validated its correctness, and evaluated it on benchmarks from the literature. The evaluation shows the strength of our algorithms, in their ability to suggest repairs and in their performance and scalability compared to previous solutions.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE/ACM 41st International Conference on Software Engineering, ICSE 2019
PublisherIEEE Computer Society
Number of pages11
ISBN (Electronic)9781728108698
StatePublished - May 2019
Event41st IEEE/ACM International Conference on Software Engineering, ICSE 2019 - Montreal, Canada
Duration: 25 May 201931 May 2019

Publication series

NameProceedings - International Conference on Software Engineering
ISSN (Print)0270-5257


Conference41st IEEE/ACM International Conference on Software Engineering, ICSE 2019


  • GR(1)
  • reactive synthesis
  • repair


Dive into the research topics of 'Symbolic Repairs for GR(1) Specifications'. Together they form a unique fingerprint.

Cite this