77 search results - page 7 / 16 » Building BSP Programs Using the Refinement Calculus |
POPL
2010
ACM
14 years 4 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
ICFP
2003
ACM
14 years 7 months ago
2003
ACM
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
POPL
2010
ACM
13 years 9 months ago
2010
ACM
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
ENTCS
2008
13 years 7 months ago
2008
The Event-B method is a formal approach to modelling systems, using refinement. Initial specification is a high level of abstraction; detail is added in refinement steps as the de...