Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
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.
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
Rei Odaira, Jose G. Castanos, et al.
IISWC 2013
Segev Shlomov, Avi Yaeli
CHI 2024