WG211/M23Reichenbach

Reference attribute grammars (RAGs) are one mechanism for specifying the (static) semantics of programming languages. Circular attributes extend RAGs with the ability to compute fixpoints. In recent work on using circular attributes for program analysis, we have observed a number of performance limitations of the published analysis algorithms; in this talk, I will describe the state of our current work on improving these algorithms. This presentation is based on our paper Efficient Demand Evaluation of Fixed-Point Attributes using Static Analysis but will attempt to make a more structured argument for the correctness of the algorithm described there.