77 search results - page 9 / 16 » Building BSP Programs Using the Refinement Calculus |
155
click to vote
JFP
2008
15 years 5 months ago
2008
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...
137
Voted
CSL
2004
Springer
15 years 11 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
156
click to vote
PLILP
1993
Springer
15 years 10 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
196
click to vote
ISADS
2003
IEEE
15 years 11 months ago
2003
IEEE
An advanced high-level approach for programming of real-time distributed computing applications, the TMO (Time-triggered Message-triggered Object) programming and specification sc...
186
click to vote
RTA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...