Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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.
Joseph Y. Halpern
aaai 1996
A. Manzalini, R. Minerva, et al.
ICIN 2013
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Yi Zhou, Parikshit Ram, et al.
ICLR 2023