CASL
The specification language developed by CoFI is called Casl: the Common Algebraic Specification Language. Its main features are as follows: Casl is based on a critical selection of known constructs. It is an expressive, simple, pragmatic language. It is suitable for specifying requirements and design for conventional software packages It has restrictions to various sublanguages. It has extensions to higher-order, state-based, concurrent, and other languages. Use of Casl is supported by tools.
Keywords for this software
References in zbMATH (referenced in 175 articles , 1 standard article )
Showing results 1 to 20 of 175.
Sorted by year (- Haveraaen, Magne; Järvi, Jaakko: Semantics of multiway dataflow constraint systems (2021)
- Rosenberger, Tobias; Bensalem, Saddek; Knapp, Alexander; Roggenbach, Markus: Institution-based encoding and verification of simple UML state machines in CASL/SPASS (2021)
- Confalonieri, Roberto; Kutz, Oliver: Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention (2020)
- Diaconescu, Răzvan: Introducing (H), an institution-based formal specification and verification language (2020)
- Haveraaen, Magne; Roggenbach, Markus: Specifying with syntactic theory functors (2020)
- Rabe, Florian; Sharoda, Yasmine: Diagram combinators in MMT (2019)
- Eppe, Manfred; Maclean, Ewen; Confalonieri, Roberto; Kutz, Oliver; Schorlemmer, Marco; Plaza, Enric; Kühnberger, Kai-Uwe: A computational framework for conceptual blending (2018)
- Madeira, Alexandre; Barbosa, Luís S.; Hennicker, Rolf; Martins, Manuel A.: A logic for the stepwise development of reactive systems (2018)
- Mossakowski, Till; Krieg-Brückner, Bernd: Partial pushout semantics of generics in DOL (2018)
- Orejas, Fernando; Pino, Elvira; Navarro, Marisa; Lambers, Leen: Institutions for navigational logics for graphical structures (2018)
- Zhang, Min; Ogata, Kazuhiro: From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (2018)
- Găină, Daniel: Foundations of logic programming in hybrid logics with user-defined sharing (2017)
- Găină, Daniel: Birkhoff style calculi for hybrid logics (2017)
- Maletzky, Alexander; Windsteiger, Wolfgang: The formalization of Vickrey auctions: a comparison of two approaches in Isabelle and Theorema (2017)
- Meseguer, José: Strict coherence of conditional rewriting modulo axioms (2017)
- Rabe, Florian: Morphism axioms (2017)
- Riesco, Adrián; Ogata, Kazuhiro; Futatsugi, Kokichi: A Maude environment for CafeOBJ (2017)
- Roşu, Grigore: Matching logic (2017)
- Zeidler, Clemens; Weber, Gerald; Gavryushkin, Alex; Lutteroth, Christof: Tiling algebra for constraint-based layout editing (2017)
- Diaconescu, Răzvan: Functorial semantics of first-order views (2016)
Further publications can be found at: http://www.informatik.uni-bremen.de/cofi/wiki/index.php/Publications