Conference paper
Tutorials and Technical Briefings at ISEC 2025
Atul Kumar
ISEC 2025
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.
Atul Kumar
ISEC 2025
Pol G. Recasens, Yue Zhu, et al.
EuroSys 2024
Danila Seliayeu, Quinn Pham, et al.
CASCON 2024
Giuseppe Romano, Aakrati Jain, et al.
ECTC 2025