H. Andreka & I. Nemeti (1994):
General Algebraic Logic: A Perspective on ``What is logic?''.
In: What is a Logical System? - Studies in Logic and Computation, Vol. 4.
Oxford University Press.
M. Bidoit, R. Hennicker & A. Kurz (2003):
Observational logic, constructor-based logic, and their duality..
Theor. Comput. Sci. 298(3),
pp. 471–510,
doi:10.1016/S0304-3975(02)00865-4..
T. Borzyszkowski (2002):
Logical Systems for Stuctured Specifications.
Theor. Comp. Science 286,
pp. 197–245,
doi:10.1016/S0304-3975(01)00317-6.
W. Blok & D. Pigozzi (1989):
Algebraizable Logics.
Memoirs of the American Mathmatical Society 396.
AMS - American Math. Soc., Providence.
W. Blok & D. Pigozzi (2001):
Abstract Algebraic Logic and the Deduction Theorem.
Preprint available from www.math.iastate.edu/dpigozzi/papers/aaldedth.pdf.
W. Blok & J. Rebagliato (2003):
Algebraic Semantics for Deductive Systems.
Studia Logica 74(1-2),
pp. 153–180,
doi:10.1023/A:1024626023417.
D. Batory, J. N. Sarvela & A. Rauschmayer (2004):
Scaling step-wise refinement.
IEEE Trans. in Sofware Engineering 30(6),
pp. 355–371,
doi:10.1109/TSE.2004.23.
J. Czelakowski (2001):
Protoalgebraic Logics.
Trends in logic, Studia Logica Library, Kluwer Academic Publishers.
R. Diaconescu & K. Futatsugi (2002):
Logical foundations of CafeOBJ..
Theor. Comput. Sci. 285(2),
pp. 289–318,
doi:10.1016/S0304-3975(01)00361-9.
R. Diaconescu (2008):
Institution-independent Model Theory.
Birkhäuser Basel,
doi:10.1007/978-3-7643-8708-2_2.
H. A. Feitosa & I. M. L. D'Ottaviano (2001):
Conservative translations.
Ann. Pure Appl. Logic 108(1-3),
pp. 205–227,
doi:10.1016/S0168-0072(00)00046-4.
J. Fiadeiro & T. S. E. Maibaum (1993):
Generalising Interpretations between Theories in the context of (pi-) Institutions.
In: Proceedings of the First Imperial College Department of Computing Workshop on Theory and Formal Methods.
Springer-Verlag,
London, UK,
pp. 126–147.
Available at http://portal.acm.org/citation.cfm?id=647322.721361.
J. Fiadeiro & A. Sernadas (1988):
Structuring Theories on Consequence.
In: D. Sanella & A. Tarlecki: Recent Trends in Data Type Specification. Specification of Abstract Data Types (Papers from the Fifth Workshop on Specification of Abstract Datac Types, Gullane, 1987),
Lecture Notes in Computer Science 332.
Springer-Verlag, Berlin.
J. Goguen & R. Burstall (1992):
Institutions: abstract model theory for specification and programming.
J. ACM 39(1),
pp. 95–146,
doi:10.1145/147508.147524.
R. Hennicker (1997):
Structural specifications with behavioural operators: semantics, proof methods and applications.
Habilitationsschrift.
J. Meseguer (1989):
General Logics.
In: J. Bairwise & H.J. Keisler et all: Logic Colloquium'87 87.
Elsevier,
pp. 275–330.
T. Mossakowski, A. Haxthausen, D. Sannella & A. Tarlecki (2003):
CASL: The Common Algebraic Specification Language: Semantics and Proof Theory.
Computing and Informatics 22,
pp. 285–321,
doi:10.1.1.10.2965.
M.A. Martins, A. Madeira & L.S. Barbosa (2009):
Refinement by Interpretation in a General Setting.
In: E. Boiten J. Derrick & S. Reeves: Proc. Refinement Workshop 2009.
ENTCS, Elsevier,
pp. 105–121,
doi:10.1016/j.entcs.2009.12.020.
M.A. Martins, A. Madeira & L.S. Barbosa (2009):
Refinement via Interpretation.
In: 7th IEEE International Conf. on Software Engineeering and Formal Methods, Hanoi, Vietnam.
IEEE Computer Society Press,
doi:10.1109\/SEFM.2009.35.
T. Mossakowski, C. Maeder & K. Lüttich (2007):
The heterogeneous tool set, HETS.
In: 13th Int. Conf. Tools and algorithms for the construction and analysis of systems,
TACAS'07.
Springer-Verlag,
Berlin, Heidelberg,
pp. 519–522,
doi:10.1.1.67.5472.
Available at http://portal.acm.org/citation.cfm/id=1763507.1763559.
M. A. Martins & D. Pigozzi (2007):
Behavioural reasoning for conditional equations.
Mathematical Structures in Computer Science 17(5),
pp. 1075–1113,
doi:10.1017/S0960129507006305.
T. S. E. Maibaum, M. R. Sadler & Paulo A. S. Veloso (1984):
Logical Specification and Implementation.
In: Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science.
Springer-Verlag,
London, UK,
pp. 13–30,
doi:10.1007/3-540-13883-8-62.
T. S. E. Maibaum, P. A. S. Veloso & M. R. Sadler (1985):
A theory of abstract data types for program development: bridging the gap?.
In: Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT) on Formal Methods and Software.
Springer-Verlag,
New York, NY, USA,
pp. 214–230,
doi:10.1007/3-540-15199-0_14.
Available at http://portal.acm.org/citation.cfm/id=22263.22277.
G. Rosu (2000):
Hidden Logic.
Ph.D. thesis.
University of California, San Diego.
D. Sannella & A. Tarlecki (1988):
Specifications in an arbitrary institution.
Inform. and Comput. 76,
pp. 165–210,
doi:10.1.1.144.2669.
D. Sannella & A. Tarlecki (1988):
Towards Formal Development of Programs from Algebraic Specifications: Implementations Revisited.
Acta Informatica 25,
pp. 233–281,
doi:10.1.1.17.6346.
A. Tarlecki (1995):
Moving Between Logical Systems.
In: M. Haveraaen, O.J. Dahl & O. Owe: 11th Workshop on Specification of Abstract Data Types, ADT?95.
Springer Lecture Notes in Computer Science (1130),
pp. 478–502,
doi:10.1.1.49.9260.
G. Voutsadakis (2002):
Categorical Abstract Algebraic Logic: Algebraizable Institutions.
Applied Categorical Structures 10,
pp. 531–568,
doi:10.1023/A:1020990419514.
G. Voutsadakis (2003):
Categorical Abstract Algebraic Logic: Equivalent Institutions.
Studia Logica 74,
pp. 275–311,
doi:10.1023/A:1024682108396.
G. Voutsadakis (2005):
Categorical Abstract Algebraic Logic: Models of π-Institutions.
Notre Dame Journal of Formal Logic 46(4),
pp. 439–460,
doi:10.1023/A:1020990419514.
R. Wójcicki (1988):
Theory of logical calculi. Basic theory of consequence operations..
Synthese Library, 199. Dordrecht etc.: Kluwer Academic Publishers..
eptcs@eptcs.org