A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Formal validation of data-parallel programs: a two-component assertional proof system for a simple language

1997
*
Theoretical Computer Science
*

We present

doi:10.1016/s0304-3975(97)00041-8
fatcat:vt3ydpg5zrfrzisj5qjvkpympy
*a**proof**system**for**a**simple**data*-*parallel*kernel*language*called Y. This*proof**system*is based on*a*two-component assertion*language*. ... We also present*a*two-phase*proof*methodology, yielding*proofs*similar to those*for*scalar*languages*. We finally discuss other approaches. ... Acknowledgements We wish to thank Joaquim Gabarro, Alan Stewart, Bjram Lisper and Guy-Rene Perrin*for*their useful comments on this work. ...##
###
Page 263 of Mathematical Reviews Vol. , Issue 85a
[page]

1985
*
Mathematical Reviews
*

*A*

*simple*

*programming*

*language*, REPNOD, that embodies exactly the features that are discussed theoretically is defined, and several

*simple*REPNOD

*programs*, as well as

*a*sam- ple correctness

*proof*, are given ... Author’s summary: “We propose

*a*method

*for*proving the partial correctness of linear algebra

*programs*, including

*a*specification

*language*,

*a*standard axiomatic

*system*

*for*correctness condition derivations ...

##
###
Page 581 of Mathematical Reviews Vol. 56, Issue 2
[page]

1978
*
Mathematical Reviews
*

The purpose of the reviewed paper is to give the

*proofs*of soundness and relative completeness of*a*deductive*system**for**a**parallel**programming**language*[the author, “Axiomatic*proof*techniques*for**parallel*... Cook, the only complete- ——a_-™ ness result we can hope*for*is*a*completeness relative to*a*complete | deductive*system**for*the properties of the*data*structures manipu- | lated by the*programming**language*...##
###
Page 7057 of Mathematical Reviews Vol. , Issue 2003i
[page]

2003
*
Mathematical Reviews
*

of

*data*2003i:68017 between logical*proof**systems*and (idealized)*programming*lan- guages. ...*For*this purpose we define*simple*reversible*language*(SRL),*a*very*simple*reversible*language*, and analyse its properties. ...##
###
Page 1275 of Mathematical Reviews Vol. 58, Issue 2
[page]

1979
*
Mathematical Reviews
*

Authors’ summary: “We propose

*a**programming**language**for*uniform computing*systems*and methods of automatic*program**parallelization*. ... The proposed*system*of rules*for*constructing*parallel*algorithms can be used*for*expanding algorithmic*languages*of procedural type (ALGOL-60,*FOR*- TRAN, etc.)*for*the purpose of representing*parallel*...##
###
A Formal Programming Model of Orléans Skeleton Library
[chapter]

2011
*
Lecture Notes in Computer Science
*

Orléans Skeleton Library (OSL) is

doi:10.1007/978-3-642-23178-0_4
fatcat:7ymh75jbkvhknlbdgoysteiuke
*a*library of*parallel*algorithmic skeletons in C++ on top of MPI. It provides*a*structured approach towards*parallel**programming*. ... Skeletons in OSL are based on the bulk synchronous*parallelism*model. In this paper we present formal semantics of OSL:*a**programming*model and its properties proved with the Coq assistant. ... The*language*of the Coq*proof*assistant can be seen as*a*pure functional*programming**language*plus ways to express logical properties. ...##
###
Page 1658 of Mathematical Reviews Vol. , Issue 82d
[page]

1982
*
Mathematical Reviews
*

*For*

*a*

*simple*example

*program*

*a*rather extended correctness

*proof*within the

*proof*

*system*is given. As mentioned by the author, his temporal

*system*is similar to

*a*

*system*of F. ... Then, using

*a*graphical representation,

*parallel*

*programs*are defined together with some axioms

*for*the execution of these

*programs*. ...

##
###
CSimpl: A Rely-Guarantee-Based Framework for Verifying Concurrent Programs
[chapter]

2017
*
Lecture Notes in Computer Science
*

Schirmer et al. have solved

doi:10.1007/978-3-662-54577-5_28
fatcat:iq55dex5czbg5iq73ovq6f23wq
*a*similar problem*for*sequential*programs*by developing*a*verification framework in the Isabelle/HOL theorem prover called*Simpl*, which provides*a*rich sequential*language*that ... We prove the compositionality of the CSimpl semantics and we provide inference rules*for*the*language*constructors to reason about CSimpl*programs*using rely-guarantee, showing that the inference rules ... Acknowledgement This research is supported (in part) by the National Research Foundation, Prime Ministers Office, Singapore under its National Cybersecurity R&D*Program*(Award No. ...##
###
Page 3371 of Mathematical Reviews Vol. , Issue 92f
[page]

1992
*
Mathematical Reviews
*

Summary: “This paper describes the semantics of an elementary

*language**for**data**parallel*computation that is based on an abstract*parallel*machine. ... Aiello (Naples) 92£:68046 68Q10 68Q55 Rice, Michael D. (1-WESL) Semantics*for**data**parallel*computation. Internat. J.*Parallel**Programming*19 (1990), no. 6, 477-509 (1991). ...##
###
Page 5104 of Mathematical Reviews Vol. , Issue 83m
[page]

1983
*
Mathematical Reviews
*

We shall then have

*a*very powerful*system*which might perform*program*synthesis and*proofs*of*program*properties simultaneously (in*a*way*parallel*to that followed by Z. Manna and R. Waldinger). ... The author considers the process of*program*construction as*a*search*for**a**proof*in*a*corresponding formal theory. {*For*the entire collection see MR 83k:03004.} ...##
###
Page 5214 of Mathematical Reviews Vol. , Issue 89I
[page]

1989
*
Mathematical Reviews
*

Inevitability and invariance

*for*event structures are defined, expressed in the ESL*language*, and specified*for**a**simple*producer-consumer example. ... Summary: “*A*Petri net is*a**system*in which*a*meaning of*simple*interpretation is assigned to*a*set of signals. Petri nets can provide*a*particularly effective means of modeling*a**parallel*operation. ...##
###
Page 4272 of Mathematical Reviews Vol. , Issue 86i
[page]

1986
*
Mathematical Reviews
*

*A*. (NL-LEID-C); Klop, J. W. (NL-MATH) Formal

*proof*

*systems*

*for*

*program*equivalence. ... Kott, “

*A*formal

*proof*

*system*

*for*infinitary rational

*languages*” , INRIA Rep. ...

##
###
Page 443 of Mathematical Reviews Vol. , Issue 92a
[page]

1992
*
Mathematical Reviews
*

Summary: “We give

*a*relatively*simple*and direct*proof**for*L. ...*A**simple**programming**language*of while-*programs*is given*a*Dijkstra WP-semantics and is used to illustrate the idea. ...##
###
Functional programming with combinators

1987
*
Journal of symbolic computation
*

The reduction

doi:10.1016/s0747-7171(87)80009-3
fatcat:7igabr75cbhatgi7bbzx5m2luy
*language*of the*system*aims at exposing efficient flows of*data*and fine-grain*parallelism*, and*a*computer architecture, which is proposed to run the*system*, utilizes both sequential and ... An algebraic model is constructed to provide rigorous semantics*for*the*system*. ... PFO's allow him to construct*a**simple*tool*for*verification of FP*programs*: the FP Algebra of*Programs*. ...##
###
Page 2065 of Mathematical Reviews Vol. , Issue 99c
[page]

1991
*
Mathematical Reviews
*

; Lyon); Cachera, David (F-ENSLY-IP; Lyon); Le Guyadec, Yann; Utard, Gil (F-ENSLY-IP; Lyon); Virot, Bernard Formal validation of

*data*-*parallel**programs*:*a*two-component assertional*proof**system**for**a**simple*...*A*(Comput. Sci. Tech.)*A*-44 (1994), 63-72] were defined*for*the*language*Y, which constitutes*a*common core*for**parallel**data**languages*such as C*, HyperC, MPL, and HPF. ...
« Previous

*Showing results 1 — 15 out of 79,264 results*