Search

• < Previous
• 1
• Next >

---

The Complexity of Flat Freeze LTL

Benedikt Bollig ; Karin Quaas ; Arnaud Sangnier.

We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter values of a run in registers so that they can be compared with one another. As the model-checking problem is undecidable&nbsp;[&hellip;]

---

On the Satisfiability of Local First-Order Logics with Data

Benedikt Bollig ; Arnaud Sangnier ; Olivier Stietel.

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the satisfiability problem for this logic is undecidable in general, we introduce a family of local fragments. They&nbsp;[&hellip;]

---