Add to ORKGThis paper proposes Update Plans as a specification formalism for abstract machines for parallel architectures. Update Plans are a formal specification language for abstract and concrete machines. First results in using Update Plans to specify parallel architectures are illustrated, and some suggestions for further research are made
This topic provides a forum for the presentation of the latest research results and practical experi...
Applicative languages have been proposed for defining algorithms for parallel architectures because ...
International audienceComponent-based software architectures, like any software, need to be updated....
In recent years many abstract machines have been introduced. In this paper a description language...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
We formalise, using Category Theory, modularisation techniques for parallel and distributed systems ...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
We present a datastructure for storing memory contents of imperative programs during symbolic execut...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
Parallel programming involves finding the potential parallelism in an application, choosing an algor...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1991. Simultaneously published...
We survey parallel programming models and languages using six criteria to assess their suitability ...
This topic provides a forum for the presentation of the latest research results and practical experi...
Applicative languages have been proposed for defining algorithms for parallel architectures because ...
International audienceComponent-based software architectures, like any software, need to be updated....
In recent years many abstract machines have been introduced. In this paper a description language...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
The partial update problem for parallel abstract state machines has manifested itself in the cases o...
Any parallel programming language provides a model of parallelism, which is accepted implicitly when...
We formalise, using Category Theory, modularisation techniques for parallel and distributed systems ...
reasoning, trace semantics. Parallel computers have not yet had the expected impact on mainstream co...
We present a datastructure for storing memory contents of imperative programs during symbolic execut...
A new technique for specifying and verifying concurrent programs is presented. A specification lang...
Parallel programming involves finding the potential parallelism in an application, choosing an algor...
Logic programs offer many opportunities for parallelism. We present an abstract model that exploits ...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 1991. Simultaneously published...
We survey parallel programming models and languages using six criteria to assess their suitability ...
This topic provides a forum for the presentation of the latest research results and practical experi...
Applicative languages have been proposed for defining algorithms for parallel architectures because ...
International audienceComponent-based software architectures, like any software, need to be updated....