Romeo A. Dumitrescu

Learn More
The support offered by the Specification-Consistent Coordination Model (SCCM) for building reliable and efficient matrix processing programs is analyzed by comparing functional , imperative, and SCCM implementations of Floyd's all-pairs shortest-path algorithm for dense graphs. 1 INTRODUCTION We propose a new solution for developing both reliable and(More)
A new coordination model for computations is presented. It offers increased confidence in the correctness of imperative program~ and considerable simplification of imperative programming and debugging. In this model, programs consist of formal specifications of computations by recursive function definitions and explicit map-pings (coordinations) of these(More)
Received (received date) Revised (revised date) Communicated by Editor's name ABSTRACT Two-Stage Programming (2sp) is an experimental programming language, the rst implementation of the Speciication-Consistent Coordination Model (SCCM). The SCCM proposes a new, mixed-paradigm (functional/imperative) approach to developing reliable programs based on complete(More)
This paper presents the application of Two-Stage Programming (2sp) for developing error-free paral-lel/distributed applications through automatic verii-cation of computed results with respect to a given speciication. The presentation focuses the case study of the parallel block-striped partitioning variant of Prim's algorithm for nding a minimum spanning(More)
  • 1