Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Unifying Theories of Programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In previous work, based on an original idea due to Saaltink, we proposed a unifying theory of undefined expressions in logics… Expand
Is this relevant?
2012
2012
The combination of probabilistic and nondeterministic choice in program calculi is a notoriously tricky problem, and one with a… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In previous work, based on an original idea due to Saaltink, we proposed a unifying theory of undefined expressions in logics… Expand
Is this relevant?
2010
2010
A trace of the execution of a concurrent object-oriented program can be displayed in two-dimensions as a diagram of a non-metric… Expand
Is this relevant?
2010
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we… Expand
Is this relevant?
2006
2006
This paper presents a personal account of developments leading to Unifying Theories of Programming, and some opinions about the… Expand
Is this relevant?
2005
2005
Hoare and He's unifying theories of programming (UTP) is a model of alphabetised relations expressed as predicates, which… Expand
Is this relevant?
2005
2005
Within the shape Unifying Theories of Programming framework, program initiation and termination has been modelled by introducing… Expand
Is this relevant?
2003
2003
Unifying Theories of Programming (UTP) can provide a formal semantic foundation not only for programming languages but also for… Expand
Is this relevant?
Highly Cited
1998