Isabelle/DOF is an ontology framework on top of Isabelle/HOL. It allows for the formal development of ontologies and continuous conformity-checking of integrated documents, including the tracing of typed meta-data of documents. Isabelle/DOF deeply integrates into the Isabelle/HOL ecosystem, allowing to write documents containing (informal) text, executable code, (formal and semiformal) definitions, and proofs. Users of Isabelle/DOF can either use HOL or one of the many formal methods that have been embedded into Isabelle/HOL to express formal parts of their documents. In this paper, we extend Isabelle/DOF with annotations of -terms, a pervasive data-structure underlying Isabelle to syntactically represent expressions and formulas. We achieve this by using Higher-order Logic (HOL) itself for query-expressions and data-constraints (ontological invariants) executed via code-generation and reflection. Moreover, we add support for parametric ontological classes, thus exploiting HOL's polymorphic type system. The benefits are: First, the HOL representation allows for flexible and efficient run-time checking of abstract properties of formal content under evolution. Second, it is possible to prove properties over generic ontological classes. We demonstrate these new features by a number of smaller ontologies from various domains and a case study using a substantial ontology for formal system development targeting certification according to CENELEC 50128.

The Web services composition defines a process that involves various independent Web services to perform a complex function. This process is described with a standard language (BPEL) and executed by tools supporting this language. This kind of languages describes the behavior of different distributed services together, but it does not support the verification nor the validation of behavioral requirements.In our work, we are interested in the formal validation of Web services composition. Formal models are extracted from BPEL specifications and checked. Most previous work is based on Web services composition formalizations using Petri nets,process algebra or transition systems. The model checking technique is set-up to validate such descriptions.In this paper, we present a proof and refinement based approach for the formal representation, verification and validation of Web services compositions using the Event_B method.