Preface to the UTP 2016 Symposium proceedings Interest in the fundamental problem of the combination of formal notations and theories of programming has grown consistently in recent decades. The theories define, in various different ways, many common notions, such as abstraction, refinement, choice, termination, feasibility, locality, concurrency, and communication. Despite these differences, such theories may be unified in a way that greatly facilitates their study and comparison. Moreover, such a unification offers a means of combining different languages describing various facets and artefacts of software development in a seamless and logically consistent manner
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus...
Hoare and He have proposed unifying theories of programming (UTP): a model of alphabetised relations...
In this paper, we present a formalisation of a subset of the unifying theories of programming (UTP)....
Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relationa...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
AbstractThe Unifying Theories of Programming (UTP) of Hoare and He is a general framework in which t...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
In this paper we examine how concurrency has been embodied in mainstream programming languages. In p...
AbstractIn this paper we present a semantic embedding of Hoare and He's Unifying Theories of Program...
Much of computer science research focuses on techniques to make programming easier, better, less err...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
This preprint has four parts: Unified theory of knowledge representation (presented at AIMSA 84 ...
AbstractMastering the programming is no easy job because proper science of software does not yet exi...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus...
Hoare and He have proposed unifying theories of programming (UTP): a model of alphabetised relations...
In this paper, we present a formalisation of a subset of the unifying theories of programming (UTP)....
Hoare and He's Unifying Theories of Programming (UTP) provides a rich model of programs as relationa...
Saoith?n is a theorem prover developed to support the Unifying Theories of Programming (UTP) framewo...
AbstractThe Unifying Theories of Programming (UTP) of Hoare and He is a general framework in which t...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
In this paper we examine how concurrency has been embodied in mainstream programming languages. In p...
AbstractIn this paper we present a semantic embedding of Hoare and He's Unifying Theories of Program...
Much of computer science research focuses on techniques to make programming easier, better, less err...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
This preprint has four parts: Unified theory of knowledge representation (presented at AIMSA 84 ...
AbstractMastering the programming is no easy job because proper science of software does not yet exi...
Isabelle/UTP is a mechanised theory engineering toolkit based on Hoare and He’s Unifying Theories of...
In their Unifying Theories of Programming (UTP), Hoare & He use the alphabetised relational calculus...
Hoare and He have proposed unifying theories of programming (UTP): a model of alphabetised relations...