Rei Odaira, Jose G. Castanos, et al.
IISWC 2013
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.
Rei Odaira, Jose G. Castanos, et al.
IISWC 2013
Joseph Y. Halpern
aaai 1996
Gang Liu, Michael Sun, et al.
ICLR 2025
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999