Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
Saurabh Paul, Christos Boutsidis, et al.
JMLR
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999