Lazy Constrained Monotonic Abstraction

Ganjei, Zeinab; Rezine, Ahmed; Eles, Petru; Peng, Zebo

doi:10.1007/978-3-662-49122-5_7

Cited by 1 publication

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our framework is compatible with techniques for reachability in well-structured transition systems (WSTS) that proceed backwards [4]. We believe that techniques like [29,23,28,7,24] can be adapted to our setting. To instantiate general WSTS reachability algorithms, the ordering of configurations would be based on implication among formulas, the target set would be the upward closure of the assignment σ where σ S is the conjunction of all rejecting boxes and σ X = false for every other X ∈ N , and the initial state would be the assignment ⊥.…”

Section: Related Workmentioning

confidence: 96%

Summaries for Context-Free Games

Holík¹,

Meyer²,

Muskalla³

2016

Preprint

View full text Add to dashboard Cite

We study two-player games played on the infinite graph of sentential forms induced by a contextfree grammar (that comes with an ownership partitioning of the non-terminals). The winning condition is inclusion of the derived terminal word in the language of a finite automaton. Our contribution is a new algorithm to decide the winning player and to compute her strategy. It is based on a novel representation of all plays starting in a non-terminal. The representation uses the domain of Boolean formulas over the transition monoid of the target automaton. The elements of the monoid are essentially procedure summaries, and our approach can be seen as the first summary-based algorithm for the synthesis of recursive programs. We show that our algorithm has optimal (doubly exponential) time complexity, that it is compatible with recent antichain optimizations, and that it admits a lazy evaluation strategy. Our preliminary experiments indeed show encouraging results, indicating a speed up of three orders of magnitude over a competitor.

show abstract