@conference {FradeMJ:biddat,
	title = {Bidirectional data-flow analyses, type-systematically},
	booktitle = {PEPM},
	year = {2009},
	month = {January},
	pages = {141-150},
	address = {Savannah, Georgia, USA},
	abstract = {<p>We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feature is a clear separation between what constitutes a valid analysis and how the strongest one can be computed (via the type checking versus principal type inference distinction). The approach also facilitates elegant relational semantic soundness definitions and proofs for analyses and optimizations, with an application to mechanical transformation of program proofs, useful in proof-carrying code. Unidirectional forward and backward analyses are covered as special cases; the technicalities in the general bidirectional case arise from more subtle notions of valid and principal types. To demonstrate the viability of the approach we consider two examples that are inherently bidirectional: type inference (seen as a data-flow problem) for a structured language where the type of a variable may change over a program{\textquoteright}s run and the analysis underlying a stack usage optimization for a stack-based low-level language.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/mjf/files/pepm09-revised.pdf},
	author = {Maria Jo{\~a}o Frade and Ando Saabas and Tarmo Uustalu}
}