Report on the Larch shared language
Science of Computer Programming
Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Specifications in an arbitrary institution
Information and Computation - Semantics of Data Types
Computing in Horn clause theories
Computing in Horn clause theories
Algebraic specification
Unified algebras and institutions
Proceedings of the Fourth Annual Symposium on Logic in computer science
Journal of the ACM (JACM)
Abstract and concrete categories
Abstract and concrete categories
Conference proceedings on Algebraic methodology and software technology
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Larch: languages and tools for formal specification
Larch: languages and tools for formal specification
Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
Information and Computation
Logical support for modularisation
Papers presented at the second annual Workshop on Logical environments
Algebraic specification techniques and tools for software development: the ACT approach
Algebraic specification techniques and tools for software development: the ACT approach
Free objects and equational deduction for partial conditional specifications
Theoretical Computer Science
May I borrow your logic? (Transporting logical structures along maps)
Theoretical Computer Science - Special issue: algebraic development techniques
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
CASL: the common algebraic specification language
Theoretical Computer Science
Logical systems for structured specifications
Theoretical Computer Science
Static semantic analysis and theorem proving for CASL
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Combining and representing logical systems using model-theoretic parchments
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Colimits of order-sorted specifications
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Subsorted Partial Higher-Order Locig as an Extension of CASL
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Extending Casl by Late Binding
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
Specifications in an Arbitrary Institution with Symbols
WADT '99 Selected papers from the 14th International Workshop on Recent Trends in Algebraic Development Techniques
A Hierarchy of Institutions Seperated by Properties of Parameterized Abstract Data Types
Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Using Limits of Parchment to Systematically Construct Institutions of partial Algebras
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Moving Between Logical Systems
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
Pushouts of Order-Sorted Algebraic Specifications
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
Permissive Subsorted Partial Logic in CASL
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Algebraic Specifications with Generating Constraints
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Operational Semantics for Order-Sorted Algebra
Proceedings of the 12th Colloquium on Automata, Languages and Programming
CoFI: The Common Framework Initiative for Algebraic Specification and Development
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Equivalences among Various Logical Frameworks of Partial Algebras
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Pushout complements for partly total algebras
Mathematical Structures in Computer Science
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
CASL: the common algebraic specification language
Theoretical Computer Science
Semantics of Architectural Specifications in CASL
FASE '01 Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering
Institution Independent Static Analysis for CASL
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
From Specifications to Code in CASL
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
A Total Approach to Partial Algebraic Specification
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Heterogeneous Development Graphs and Heterogeneous Borrowing
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
CSP-CASL: a new integration of process algebra and algebraic specification
Theoretical Computer Science - Algebraic methods in language processing
Ultraproducts and possible worlds semantics in institutions
Theoretical Computer Science
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
CSP-CASL-Prover: A Generic Tool for Process and Data Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
An encoding of partial algebras as total algebras
Information Processing Letters
Reasoning support for CASL with automated theorem proving systems
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Untyping typed algebraic structures and colouring proof nets of cyclic linear logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Proceedings of the 2011 workshop on New security paradigms workshop
Interpolation in logics with constructors
Theoretical Computer Science
Hi-index | 5.23 |
In this work, we investigate various specification languages and their relation to CASL, the recently developed Common Algebraic Specification Language. In particular, we consider the languages Larch, OBJ3 and functional CafeOBJ, ACT ONE, ASF, and HEP-theories, as well as various sublanguages of CASL. All these languages are translated to an appropriate sublanguage of CASL.The translation mainly concerns the level of specification in-the-small: the logics underlying the languages are formalized as institutions, and representations among the institutions are developed. However, it is also considered how these translations interact with specification in-the-large.Thus, we obtain, on the one hand, translations of any of the above-mentioned specification languages to an appropriate sublanguage of CASL. This allows us to take libraries and case studies that have been developed for other languages and re-use them in CASL.On the other hand, we set up institution representations going from the CASL institution (and some of its subinstitutions) to simpler subinstitutions. Given a theorem proving tool for such a simpler subinstitution, with the help of a representation, it can also be used for a more complex institution. Thus, first-order theorem provers and conditional term rewriting tools become usable for CASL.