## HETS User Guide – Version 0.73 – (2008)

### BibTeX

@MISC{Mossakowski08hetsuser,

author = {Till Mossakowski and Christian Maeder and Klaus Lüttich},

title = {HETS User Guide – Version 0.73 –},

year = {2008}

}

### OpenURL

### Abstract

(the latter needs subscription to the mailing list)

### Citations

475 |
Institutions: Abstract Model Theory for Specification and Programming
- Goguen, Burstall
- 1992
(Show Context)
Citation Context ... and architectural specifications and libraries. The latter of course needs to call the logic-specific tools whenever a basic specification is encountered. HETS is based on the theory of institutions =-=[11]-=-, which formalize the notion of a logic. The theory behind HETS is laid out in [20]. A short overview of HETS is given in [25, 26]. 1sSPEC ::= BASIC-SPEC | SPEC then SPEC | SPEC then %implies SPEC | S... |

123 |
Maarten de Rijke, and Yde Venema, Modal logic, Cambridge Tracts
- Blackburn
- 2001
(Show Context)
Citation Context ... [12] Haskell2IsabelleHOL coding of Haskell to Isabelle/HOL [41] Haskell2IsabelleHOLCF coding of Haskell to Isabelle/HOLCF [41] Modal2CASL the standard translation of modal logic to first-order logic =-=[7]-=- PCoClTyConsHOL2IsabelleHOL coding of HASCASL to Isabelle/HOL SuleCFOL2SoftFOL coding of CASL to SoftFOL [17], mapping types to soft types SuleCFOL2SoftFOLIndcuction dto., but with instances of induct... |

114 | OMDoc: An Open Markup Format for Mathematical Documents (Version
- Kohlhase
(Show Context)
Citation Context ...n also directly read in the prf format (both from the command line, by calling HETS on the prf file, and from the GUI, using the File-Open menu. The env format is currently not used. The omdoc format =-=[14]-=- is an XML-based markup format and data model for Open Mathematical Documents. It serves as semantics-oriented representation format and ontology language for mathematical knowledge. Currently, CASL s... |

99 | Efficient annotated terms
- Brand, Jong, et al.
(Show Context)
Citation Context ...scribed in Sect. 7. For local proof goals, logic-specific provers are invoked, see Sect. 10. HETS can store development graphs, including their proofs. Therefore, HETS uses the so-called ATerm format =-=[8]-=-, which is used as interchange format for interfacing with other tools. More details can be found in [20, 26] and in the overview of modules provided in the developers section of the HETS home page at... |

75 | Proof General: A generic tool for proof development. Tools and Algorithms for the Construction and Analysis of Systems
- Aspinall
- 2000
(Show Context)
Citation Context ...e syntax of the original input logic. They may even use features of ISABELLE/HOL such as higher-order functions that are not present in an input logic like CASL. ISABELLE is started with ProofGeneral =-=[2, 1]-=- in a separate Emacs [9, 40]. The ISABELLE theory file conforms to the Isabelle/Isar syntax [29]. It starts with the theory (encoded along the selected comorphism), followed by a list of theorems. Ini... |

72 | Parsec: Direct style monadic parser combinators for the real world
- LEIJEN, MEIJER
- 2001
(Show Context)
Citation Context ...oughly one third of HETS’ 100.000 lines of Haskell code. The heterogeneous parser transforms a string conforming to the syntax in Fig. 1 to an abstract syntax tree, using the Parsec combinator parser =-=[15]-=-. Logic and translation names are looked up in the logic graph — this is necessary to be able to choose the correct parser for basic specifications. Indeed, the parser has a state that carries the cur... |

34 | Relating Casl with other specification languages: the institution level
- Mossakowski
(Show Context)
Citation Context ...L2Modal inclusion CASL2PCFOL coding of subsorting by injections, see Chap. III:3.1 of the CASL Reference Manual [28] CASL2SubCFOL coding of partial functions by error elements (translation (4a ′ ) of =-=[23]-=-, but extended to subsorting) CASL2TopSort coding of subsorting by a top sort and unary predicates for the subsorts CFOL2IsabelleHOL coding of CASL to Isabelle (translation (7) of [23]) CoCASL2CoPCFOL... |

31 |
Institution morphisms. Formal Aspects of Computing 13:274–307
- Goguen, Rosu
- 2002
(Show Context)
Citation Context ...ure 4: Graph of most important sublogics currently supported by HETS, together with their comorphisms. 3 Logic translations supported by Hets Logic translations (formalized as institution comorphisms =-=[10]-=-) translate from a given source logic to a given target logic. More precisely, one and the same logic translation may have several source and target sublogics: for each source sublogic, the correspond... |

30 | The Heterogeneous Tool Set
- Mossakowski, Maeder, et al.
- 2007
(Show Context)
Citation Context ...specification is encountered. HETS is based on the theory of institutions [11], which formalize the notion of a logic. The theory behind HETS is laid out in [20]. A short overview of HETS is given in =-=[25, 26]-=-. 1sSPEC ::= BASIC-SPEC | SPEC then SPEC | SPEC then %implies SPEC | SPEC with SYMBOL-MAP | SPEC with logic ID DEFINITION ::= logic ID | spec ID = SPEC end | view ID : SPEC to SPEC = SYMBOL-MAP end | ... |

29 |
Heterogeneous Specification and the Heterogeneous Tool Set, Habilitation thesis
- Mossakowski
- 2005
(Show Context)
Citation Context ... the logic-specific tools whenever a basic specification is encountered. HETS is based on the theory of institutions [11], which formalize the notion of a logic. The theory behind HETS is laid out in =-=[20]-=-. A short overview of HETS is given in [25, 26]. 1sSPEC ::= BASIC-SPEC | SPEC then SPEC | SPEC then %implies SPEC | SPEC with SYMBOL-MAP | SPEC with logic ID DEFINITION ::= logic ID | spec ID = SPEC e... |

25 | Development graphs – proof management for structured specifications - Mossakowski, Autexier, et al. - 2006 |

22 | Static semantic analysis and theorem proving for Casl
- Mossakowski, Kolyang, et al.
- 1997
(Show Context)
Citation Context ...kus Roggenbach, Pascal Schmidt, Paolo Torrini, René Wagner, Jian Chun Wang and Thiemo Wiedemeyer. HETS has been built based on experiences with its precursors, CATS and MAYA. The CASL Tool Set (CATS) =-=[22, 24]-=- provides parsing and static analysis for CASL. It has been developed by the first author with help of Mark van den Brand, Kolyang, Bartek Klin, Pascal Schmidt and Frederic Voisin. MAYA [4, 3] is a pr... |

18 | Integrating Hol-Casl into the development graph manager Maya
- Autexier, Mossakowski
- 2002
(Show Context)
Citation Context ...CATS) [22, 24] provides parsing and static analysis for CASL. It has been developed by the first author with help of Mark van den Brand, Kolyang, Bartek Klin, Pascal Schmidt and Frederic Voisin. MAYA =-=[4, 3]-=- is a proof management tool based on development graphs. MAYA only supports development graphs without hiding and without logic translations. MAYA has been developed by Serge Autexier and Dieter Hutte... |

16 |
The development graph manager maya (system description
- Autexier, Hutter, et al.
- 2002
(Show Context)
Citation Context ...CATS) [22, 24] provides parsing and static analysis for CASL. It has been developed by the first author with help of Mark van den Brand, Kolyang, Bartek Klin, Pascal Schmidt and Frederic Voisin. MAYA =-=[4, 3]-=- is a proof management tool based on development graphs. MAYA only supports development graphs without hiding and without logic translations. MAYA has been developed by Serge Autexier and Dieter Hutte... |

16 | Casl: From semantics to tools
- Mossakowski
- 2000
(Show Context)
Citation Context ...kus Roggenbach, Pascal Schmidt, Paolo Torrini, René Wagner, Jian Chun Wang and Thiemo Wiedemeyer. HETS has been built based on experiences with its precursors, CATS and MAYA. The CASL Tool Set (CATS) =-=[22, 24]-=- provides parsing and static analysis for CASL. It has been developed by the first author with help of Mark van den Brand, Kolyang, Bartek Klin, Pascal Schmidt and Frederic Voisin. MAYA [4, 3] is a pr... |

14 |
Algebraic-coalgebraic specification
- Mossakowski, Reichel, et al.
- 2003
(Show Context)
Citation Context ...olymorphic variables) in the types for signatures, morphisms, abstract syntax etc. This eases integration of CASL extensions and keeps the effort of integrating CASL extensions quite moderate. CoCASL =-=[27]-=- is a coalgebraic extension of CASL, suited for the specification of process types and reactive systems. The central proof method is coinduction. ModalCASL [19] is an extension of CASL with multi-moda... |

10 |
CASL User Manual, volume 2900 of LNCS
- Bidoit, Mosses
- 2004
(Show Context)
Citation Context ...ion March 27, 2008 The Heterogeneous Tool Set (HETS) is the main analysis tool for the specification language heterogeneous CASL. Heterogeneous CASL (HETCASL) combines the specification language CASL =-=[6, 28]-=- with CASL extensions and sublanguages, as well as completely different logics and even programming languages such as Haskell. HETCASL (see Fig. 1 for a simple subset) extends the structuring mechanis... |

9 | Ontologies for the semantic web in CASL
- Lüttich, Mossakowski, et al.
- 2004
(Show Context)
Citation Context ... ontology into the sublanguages OWL Full, OWL DL and OWL Lite. Hets only supports the last two, more restricted variants. The structuring of the OWL imports is displayed as Development Graph. CASL-DL =-=[16]-=- is an extension of a restriction of CASL, realizing a strongly typed variant of OWL DL in CASL syntax. It extends CASL with cardinality restrictions for the description of sorts and unary predicates.... |

9 | Reasoning Support for CASL with Automated Theorem Proving Systems
- Lüttich, Mossakowski
- 2007
(Show Context)
Citation Context ...bsorts of the topsort Thing) are allowed. It is used to bring OWL DL and CASL closer together. Propositional is classical propositional logic, with the zChaff SAT solver [13] connected to it. SoftFOL =-=[17]-=- offers three automated theorem proving (ATP) systems for firstorder logic with equality: (1) SPASS [43]; (2) Vampire [32]; and (3) MathServe Broker 1 [44]. These together comprise some of the most ad... |

8 | zChaff: Modifications and extensions
- Herbstritt
(Show Context)
Citation Context ...ned datatypes and concepts (subsorts of the topsort Thing) are allowed. It is used to bring OWL DL and CASL closer together. Propositional is classical propositional logic, with the zChaff SAT solver =-=[13]-=- connected to it. SoftFOL [17] offers three automated theorem proving (ATP) systems for firstorder logic with equality: (1) SPASS [43]; (2) Vampire [32]; and (3) MathServe Broker 1 [44]. These togethe... |

8 |
HetCASL – heterogeneous specification. Language summary
- Mossakowski
- 2004
(Show Context)
Citation Context ...ucts for structured and architectural specifications. The corresponding document explaining the HETCASL language constructs for heterogeneous structured specifications is the HETCASL language summary =-=[18]-=-; a formal semantics as well as a user manual with more examples are in preparation. Some of HETCASL’s heterogeneous constructs will be illustrated in Sect. 6 below. 1 which chooses an appropriate ATP... |

6 |
Emacs Proof General. Available at http://proofgeneral.inf.ed.ac.uk
- Aspinal, Berghofer, et al.
(Show Context)
Citation Context ...e syntax of the original input logic. They may even use features of ISABELLE/HOL such as higher-order functions that are not present in an input logic like CASL. ISABELLE is started with ProofGeneral =-=[2, 1]-=- in a separate Emacs [9, 40]. The ISABELLE theory file conforms to the Isabelle/Isar syntax [29]. It starts with the theory (encoded along the selected comorphism), followed by a list of theorems. Ini... |

6 |
Software Foundation. Emacs. Available at http://www.gnu.org/software/emacs/ emacs.html
- Free
(Show Context)
Citation Context ...put logic. They may even use features of ISABELLE/HOL such as higher-order functions that are not present in an input logic like CASL. ISABELLE is started with ProofGeneral [2, 1] in a separate Emacs =-=[9, 40]-=-. The ISABELLE theory file conforms to the Isabelle/Isar syntax [29]. It starts with the theory (encoded along the selected comorphism), followed by a list of theorems. Initially, all the theorems hav... |

6 |
ModalCASL — Specification with Multi-Modal Logics. Language Summary
- Mossakowski
- 2004
(Show Context)
Citation Context ... CASL extensions quite moderate. CoCASL [27] is a coalgebraic extension of CASL, suited for the specification of process types and reactive systems. The central proof method is coinduction. ModalCASL =-=[19]-=- is an extension of CASL with multi-modalities and term modalities. It allows the specification of modal systems with Kripke’s possible worlds semantics. It is also possible to express certain forms o... |

4 |
Beweisunterstützung für HasCASL in Isabelle /HOL
- Gröning
- 2005
(Show Context)
Citation Context ...ic recursive definitions as HASCASL recursive program definitions HasCASL2Haskell translation of HASCASL recursive program definitions to Haskell HasCASL2IsabelleHOL coding of HasCASL to Isabelle/HOL =-=[12]-=- Haskell2IsabelleHOL coding of Haskell to Isabelle/HOL [41] Haskell2IsabelleHOLCF coding of Haskell to Isabelle/HOLCF [41] Modal2CASL the standard translation of modal logic to first-order logic [7] P... |