@article {MMB09,
	title = {Refinement by Interpretation in a General Setting},
	journal = {Electronic Notes in Theoretical Computer Science},
	volume = {259},
	year = {2009},
	pages = {105-121},
	publisher = {Elsevier},
	abstract = {<p>Refinement by interpretation replaces signature morphisms by logic interpretations as a means to translate specifications and witness refinements. The approach was recently introduced by the authors [13] in the context of equational specifications, in order to capture a number of relevant transformations in software design, reuse and adaptation. This paper goes a step forward and discusses the generalization of this idea to deductive systems of arbitrary dimension. This makes possible, for example, to refine sentential into equational specifications and the latter into modal ones. Moreover, the restriction to logics with finitary consequence relations is dropped which results in increased flexibility along the software development process.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/lsb/files/refine09-mmb.pdf},
	author = {M. Martins and Alexandre Madeira and Luis Soares Barbosa},
	editor = {Derrick Boiten and Steve Reeves}
}