Very abstract specifications: a formalism independent approach

Authors:
Maura Cerioli;Gianna Reggio
Affiliations:
Dipartimento di Informatica e Scienze dell'Informazione, Via Dodecaneso 35, 16146 Genova (Italy). Email: {cerioli, reggio}@disi.unige.it;Dipartimento di Informatica e Scienze dell'Informazione, Via Dodecaneso 35, 16146 Genova (Italy). Email: {cerioli, reggio}@disi.unige.it
Venue:
Mathematical Structures in Computer Science
Year:
1998

Citing 13
Cited 1

Quasi-varieties in abstract algebraic institutions

Journal of Computer and System Sciences
Specifications in an arbitrary institution

Information and Computation - Semantics of Data Types
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Institutions: abstract model theory for specification and programming

Journal of the ACM (JACM)
Institutions for very abstract specifications

Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
Event Logic for Specifying Abstract Dynamic Data Types

Selected papers from the 8th Workshop on Specification of Abstract Data Types Joint with the 3rd COMPASS Workshop on Recent Trends in Data Type Specification
Algebraic-Oriented Institutions

AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
The Semantics of CLEAR, A Specification Language

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
A Metalanguage for the Formal Requirement Specification of Reactive Systems

FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Entities: An Institution for Dynamic Systems

Proceedings of the 7th Workshop on Abstract Data Types: Recent Trends in Data Type Specification
Introducing Institutions

Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Viewing Implementations as an Institution

Category Theory and Computer Science
Specifying reactive systems by abstract events

IWSSD '93 Proceedings of the 7th international workshop on Software specification and design

Type class polymorphism in an institutional framework

WADT'04 Proceedings of the 17th international conference on Recent Trends in Algebraic Development Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper provides an algorithm that, given two finite algebras A and B each of arbitrary finite similarity type, determines whether or not A and B are categorically equivalent. Although the algorithm is not practical in ...