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 127 articles , 1 standard article )
Showing results 1 to 20 of 127.
Sorted by year (- Riesco, Adrián; Ogata, Kazuhiro; Futatsugi, Kokichi: A Maude environment for CafeOBJ (2017)
- Diaconescu, Răzvan: Functorial semantics of first-order views (2016)
- Jin, Miaomiao; Short, Michael: Multiphysics modeling of two-phase film boiling within porous corrosion deposits (2016)
- Madeira, Alexandre; Barbosa, Luis S.; Hennicker, Rolf; Martins, Manuel A.: Dynamic logic with binders and its application to the development of reactive systems (2016)
- Zhang, Qinglei; Khedri, Ridha: On the weaving process of aspect-oriented product family algebra (2016)
- Knapp, Alexander; Mossakowski, Till; Roggenbach, Markus: Towards an institutional framework for heterogeneous formal development in UML. -- A position paper -- (2015)
- Diaconescu, Răzvan; Ţuţu, Ionuţ: Foundations for structuring behavioural specifications (2014)
- Găină, Daniel: Forcing, downward Löwenheim-Skolem and omitting types theorems, institutionally (2014)
- James, Phillip; Roggenbach, Markus: Encapsulating formal methods within domain specific languages: a solution for verifying railway scheme plans (2014)
- Kahl, Wolfram: Categories of coalgebras with monadic homomorphisms (2014)
- Leivant, Daniel M.: Global semantic typing for inductive and coinductive computing (2014)
- Martins, Manuel A.; Madeira, Alexandre; Barbosa, Luís S.: The role of logical interpretations in program development (2014)
- Ţuţu, Ionuţ: Parameterisation for abstract structured specifications (2014)
- Diaconescu, Răzvan: Institutional semantics for many-valued logics (2013)
- Lange, Christoph; Caminati, Marco B.; Kerber, Manfred; Mossakowski, Till; Rowat, Colin; Wenzel, Makarius; Windsteiger, Wolfgang: A qualitative comparison of the suitability of four theorem provers for basic auction theory (2013)
- Martins, M.A.; Madeira, A.; Barbosa, L.S.: A coalgebraic perspective on logical interpretations (2013)
- Rabe, Florian; Kohlhase, Michael: A scalable module system (2013)
- Schropp, Andreas; Popescu, Andrei: Nonfree datatypes in Isabelle/HOL. Animating a many-sorted metatheory (2013)
- Codescu, Mihai: Lambda expressions in Casl architectural specifications (2012)
- Codescu, Mihai; Horozal, Fulya; Kohlhase, Michael; Mossakowski, Till; Rabe, Florian: A proof theoretic interpretation of model theoretic hiding (2012)
Further publications can be found at: http://www.informatik.uni-bremen.de/cofi/wiki/index.php/Publications