CCSL is a specification language that combines both algebraic and coalgebraic elements. The CCSL compiler translates CCSL specifications into higher-order logic either for PVS or for for Isabelle/HOL (in new style Isar syntax). After translation the theorem prover can be used to examine the specification, built models, construct refinements, and much more

References in zbMATH (referenced in 25 articles , 1 standard article )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Mallet, Frédéric; Zholtkevych, Grygoriy: Coalgebraic semantic model for the clock constraint specification language (2015)
  2. Leivant, Daniel M.: Global semantic typing for inductive and coinductive computing (2014)
  3. Amato, Gianluca; Lipton, James; McGrail, Robert: On the algebraic structure of declarative programming languages (2009)
  4. Rodrigues, César J.; Oliveira, J. N.; Barbosa, Luis S.: A single complete relational rule for coalgebraic refinement (2009)
  5. Nagoev, Z. V.: Genomic control of agent morphogenesis in a physically correct virtual environment (2008)
  6. Schröder, Lutz: Expressivity of coalgebraic modal logic: the limits and beyond (2008)
  7. Schröder, Lutz: A finite model construction for coalgebraic modal logic (2007)
  8. Mossakowski, Till; Schröder, Lutz; Roggenbach, Markus; Reichel, Horst: Algebraic-coalgebraic specification in CoCASL (2006)
  9. Schröder, Lutz: Expressivity of coalgebraic modal logic: The limits and beyond (2005)
  10. Roşu, Grigore: Behavioral abstraction is hiding information (2004)
  11. Awodey, Steve; Hughes, Jesse: Modal operators and the formal dual of Birkhoff’s completeness theorem. (2003)
  12. Ciaffaglione, Alberto; Liquori, Luigi; Miculan, Marino: Imperative object-based calculi in co-inductive type theories (2003)
  13. Hughes, Jesse; Warnier, Martijn: The coinductive approach to verifying cryptographic protocols. (2003)
  14. Quigley, Claire L.: A programming logic for Java bytecode programs (2003) ioport
  15. Jacobs, Bart: The temporal logic of coalgebras via Galois algebras (2002)
  16. Kurz, Alexander: Logics admitting final semantics (2002)
  17. Rothe, Jan: A syntactical approach to weak (bi-)simulation for coalgebras (2002)
  18. Rothe, Jan; Mašulović, Dragan: Towards weak bisimulation for coalgebras (2002)
  19. Tews, Hendrik: Greatest bisimulations for binary methods (2002)
  20. Hughes, Jesse: Modal operators for coequations (2001)

1 2 next