77 search results - page 9 / 16 » Building BSP Programs Using the Refinement Calculus |
JFP
2008
14 years 9 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...
CSL
2004
Springer
15 years 2 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...
85
Voted
PLILP
1993
Springer
15 years 1 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...
116
click to vote
ISADS
2003
IEEE
15 years 2 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...
RTA
2010
Springer
15 years 1 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 ...