8 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.FL2014★ 8 cited
Logics with rigidly guarded data tests
Gabriele Puppis, Thomas Colcombet, Clemens Ley
The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we…
cs.DB2012★ 1 cited
Querying Schemas With Access Restrictions
Michael Benedikt, Pierre Bourhis, Clemens Ley
We study verification of systems whose transitions consist of accesses to a Web-based data-source. An access is a lookup on a relation within a relational database, fixing values f…