Partially interpreted schemas for CSP programming
Partially interpreted program schemas are suggested as a tool for formally specifying and defining the range of applicability of patterns of communication. The body of a schema syntactically resembles a program, but contains free variables which represent uninterpreted program sections, domains, functions, or other aspects of the program. The specification of the schema includes both applicability requirements and result assertions, as well as specifications for the free variables. A schema may be instantiated to obtain a correct program for a problem statement by matching a problem's assumptions and requirements to a schema specification, and appropriately substituting entities from the problem statement for the free variables in both the specification and the body of the schema. Examples are given of the types of schemas and specifications needed for distributed computing, and of the potential variety of instantiations.
- Schema-Guided Synthesis of Imperative Programs by Constraint Solving
- Denotational semantics of CSP
- On schematological equivalence of partially interpreted dataflow networks
- Communicating Sequential Processes. The First 25 Years
- An abstract formalization of correct schemas for program synthesis
- A logic for schema-based program development
- Combining partial evaluation and staged interpretation in the implementation of domain-specific languages
- scientific article; zbMATH DE number 1098496
This page was built for publication: Partially interpreted schemas for CSP programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095639)
