Daniel Karl I. Weidele, Priyanshu Rai, et al.
AAAI 2026
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.
Daniel Karl I. Weidele, Priyanshu Rai, et al.
AAAI 2026
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
Pol G. Recasens, Yue Zhu, et al.
EuroSys 2024
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025