[PDF] Top 20 Isabelle/UTP: Mechanised Theory Engineering for the UTP

... the Isabelle type system ensures that predicates cannot refer to variables not in the alphabet as this would be a type ...this theory we will set up operators for extending and contracting and ... See full document

... a mechanised UTP theory for hybrid systems. UTP [7] is concerned with estab- lishing formal links between languages based on heterogeneous computational paradigms, and therefore it is wholly ... See full document

... necessary theory to underpin state machines (including induc- tion theorems for iterative processes), mechanise an action language for states and transitions, and use these to formalise the ...been ... See full document

... our UTP theory hierarchy supports more advanced semantic ...a mechanised theory of timed reactive designs, based on existing work [11, 17], and use this to denote the timing constructs of ... See full document

... the UTP theories of reactive processes and designs to charac- terise reactive ...This Isabelle/UTP document mechanises the UTP theory of reactive designs, including its healthiness ... See full document

... the UTP theories of reactive processes and designs to charac- terise reactive ...This Isabelle/UTP document mechanises the UTP theory of reactive designs, including its healthiness ... See full document

... the engineering of dependable systems implies that a variety of formal methods, across differing abstractions, paradigms, and presentations, must be ...is Isabelle/UTP, an implementation of Hoare and ... See full document

... core UTP theories. In particular, Isabelle/UTP builds on our implementation of lenses [16, 14], which gives a formal semantics to state spaces and ...of Isabelle/UTP [9, 10], which ... See full document

... the UTP theory of designs in ...enrich UTP relations with explicit precondition/postcondition pairs, as present in formal notations like VDM, B, and the refinement ...the theory of designs, ... See full document

... a UTP semantics for separation logic [38], where environments are reintroduced to record variables stored on the heap and the ...a UTP theory? The answer to this is especially important for our ... See full document

... which must form a trace algebra [4], and thus provides the theory of “generalised reactive processes” [4]. The reactive process alphabet also extends the design alphabet, and thus in- cludes the ok variable. For ... See full document

... the UTP book, we add an observational variable to represent refusal sets, and healthiness conditions that ensure their ...our theory of reactive relations with operators to characterise both completed and ... See full document

... The basic idea behind law application in Saoith´ın is that the goal focus is matched against one or many laws. Those matches that succeed return a bind- ing and a replacement template, and the user can then select which ... See full document

... More generally, if we choose a specific treatment of undefined expressions, then is it possible to use verification tools that employ different treatments? For example, there are two different treatments of undefined ... See full document

... expressions are written $x and $x´ respectively. We also make use of Isabelle’s implementation of Cauchy real numbers and analysis [7,11]. Our proofs make heavy use of Isabelle’s automated proof facilities like auto and ... See full document

... the UTP community, there has been considerable work using Proof- Power-Z such as deep embedding into Z of an imperative language whose seman- tics were given using UTP [13]and re-working the mechanisation ... See full document

... of UTP: alphabets, signatures, and healthiness conditions, and in Section 3 we outline the idea of theory mech- anisation in ...of UTP by describing the organisaiton of UTP theories into ... See full document

... year engineering students from different faculties in University TinggiPetronas, (UTP) has also revealed that anxiety does occur even among the final year students due to the confidence level and limited ... See full document

... Here D and S are corresponding design (concrete) and specification (abstract) predicates respec- tively, while `(c, a) is the linking predicate connecting observations at the two worlds. Of interest to us in the main are ... See full document

... a UTP semantics, providing specifications using a “state-rich” process algebra along with a refinement calculus; recent extensions to Circus have included timed [SH03] and synchronous [GB09] ...into UTP, ... See full document