189,060 Hits in 5.7 sec

Parallel program correctness through refinement

Thomas W. Doeppner
1977 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77  
doi:10.1145/512950.512965 dblp:conf/popl/Doeppner77 fatcat:gi55nnhajbaf3kawhwl7p55nci

An Event-B Approach to the Development of Fork/Join Parallel Programs

Jie Peng, Tangliu Wen, Yiguo Yang, Guoming Huang
2022 EAI Endorsed Transactions on AI and Robotics  
In this paper we show how to develop Fork/Join parallel programs through refinement and decomposition. We take Fork/Join style task decomposition as a refinement which we call Fork/Join refinement.  ...  Our approach provides a good framework for modeling Fork/Join parallel programs and showing proof obligations of correctness for such programs.  ...  In this paper we focus on developing Fork/Join parallel programs through refinement and decomposition. We take Fork/Join style task decomposition as a refinement(we call it Fork/Join refinement).  ... 
doi:10.4108/airo.v1i.16 fatcat:slwembyc5nfyfdzgbynil764qq

A refinement methodology for developing data-parallel applications [chapter]

Lars Nyland, Jan Prins, Allen Goldberg, Peter Mills, John Reif, Robert Wagner
1996 Lecture Notes in Computer Science  
Development of a data-parallel multitarget tracking application is used as a case study, showing the progression from high to low-level refinements.  ...  We describe a process of software development for data-parallel applications starting from high-level specifications, generating repeated refinements of designs to match different architectural models  ...  The application is represented by the tree of refined programs, not one particular refined version in the tree.  ... 
doi:10.1007/3-540-61626-8_18 fatcat:5xlosngmibgcllzypdwezo6oru

Uncorrelated Observations Processing at Naval Space Command

Shannon L. Coffey, Harold L. Neal, Mathew M. Berry
2002 Journal of Guidance Control and Dynamics  
of the differential correction decreases from the tolerance used on the last iteration of the differential correction of the earlier orbit refinement. 3) After the third orbit refinement there are at  ...  Orbit Refinement Loop The orbit refinement loop begins with a simple least-squares dif- ferential correction of the candidate element set using the PPT3 analytic propagator.  ... 
doi:10.2514/2.4962 fatcat:ewkppjbbbfdvnojlwxgi6njrfe

Page 2869 of Mathematical Reviews Vol. , Issue 2003d [page]

2003 Mathematical Reviews  
Associated with the refinement of the specification, there need to be methods of refining the correspond- ing test sets, that is, of constructing the test sets in parallel with the specification and distributing  ...  a process of refinement.  ... 


Gamal A. El-Hiti, Keith Smith, Asim A. Balakit, Amany S. Hegazy, Benson M. Kariuki
2014 Acta Crystallographica Section E  
Hydrogen bonding (N—H...O) between amide groups forms chains parallel to thebaxis. Pairs of methylpyridine groups from molecules in adjacent chains are parallel but there is minimal π–π interaction.  ...  The authors extend their appreciation to the Deanship of Scientific Research at King Saud University for its funding of this research through the research group project RGP-VPP-239.  ...  Data collection: CrysAlis PRO (Agilent, 2014) ; cell refinement: CrysAlis PRO; data reduction: CrysAlis PRO; program(s) used to solve structure: SHELXS2013 (Sheldrick, 2008) ; program(s) used to refine  ... 
doi:10.1107/s1600536814003729 pmid:24765040 pmcid:PMC3998503 fatcat:ljngsqpmbrdz5fttgrzclnakte

Parallel Algorithms Development for Programmable Devices with Application from Cryptography

Issam W. Damaj
2007 International journal of parallel programming  
The specifications are realized through the use of a combination of function decomposition strategies, data refinement techniques, and off-the-shelf refinements based upon higher-order functions.  ...  The refinements are inspired by the operators of Communicating Sequential Processes (CSP) and map easily to programs in Handel-C (a hardware description language).  ...  The idea for deriving implementations from the specification through correct well defined refinement steps has been motivated by many technical facts.  ... 
doi:10.1007/s10766-007-0046-1 fatcat:2xpaoudqsrcz7af4zvrxxcrcb4


Rafael Mendoza-Meroño, Santiago García-Granda
2012 Acta Crystallographica Section E  
In the crystal structure of the title compound, C9H10ClN3S, the molecules form chains parallel to [001] through N—H...S hydrogen bonds.  ...  In addition, weak intermolecular N—H...Cl hydrogen bonds connect the chains, forming a two-dimensional network parallel to (001).  ...  In the crystal structure of the title compound, C 9 H 10 ClN 3 S, the molecules form chains parallel to [001] through N-HÁ Á ÁS hydrogen bonds.  ... 
doi:10.1107/s1600536812029133 pmid:22904786 pmcid:PMC3414179 fatcat:l356i2qttvegbpf5cytkdvu5rm

Abstract Commands:

Steve Dunne
2001 Electronical Notes in Theoretical Computer Science  
To this end we present a new abstract programming language, our abstract command language, defined with a full general-correctness semantics, and an appropriate notion of refinement which preserves general  ...  Total correctness and general correctness are examined, and the latter is promoted as the more appropriate semantic basis for the programs which comprise the basic sequential interacting components of  ...  General-correctness programs form a complete lattice under this refinement relation.  ... 
doi:10.1016/s1571-0661(04)80881-8 fatcat:ltkk7z7c2zgohgn3zwtzyeuz3q

The abstract state machines method for modular design and analysis of programming languages

Egon Börger
2014 Journal of Logic and Computation  
In particular those concepts support the scalability of ASM models for the major programming paradigms, providing justified-to-be-correct, reusable hierarchies of stepwise refined, structured dynamic semantics  ...  We illustrate how theorems about such properties can be integrated into a modular development of programming languages and programs, using as example a Java/JVM compilation correctness theorem about defining  ...  a low-priority queue of Occam processes-which we mapped in [36] through a hierarchy of furthermore refined ASMs to an ASM at the Transputer code level.  ... 
doi:10.1093/logcom/exu077 fatcat:7quppauog5eyvaahlbvlrk7w3u

Treatment of non-merohedral twins

R. Herbst-Irmer
2004 Acta Crystallographica Section A Foundations of Crystallography  
This procedure is possible with newer versions of the SAINT program [4] and with EvalCCD [5]. Normal scaling and absorption correction programs are not able to handle such data sets.  ...  Therefore the program TWINABS was developed [6]. Refinements with data sets generated by different integration processes will be compared.  ...  This procedure is possible with newer versions of the SAINT program [4] and with EvalCCD [5]. Normal scaling and absorption correction programs are not able to handle such data sets.  ... 
doi:10.1107/s0108767304095182 fatcat:zg5pk3jherb5znlmqpefnj555e

Towards provably correct code generation for a hard real-time programming language [chapter]

Martin Fränzle, Markus Müller-Olm
1994 Lecture Notes in Computer Science  
verification of a provably correct code generator for that language.  ...  This paper sketches a hard real-time programming language featuring operators for expressing timeliness requirements in an abstract, implementation-independent way and presents parts of the design and  ...  One of them is to base correctness of code on the notion of source language refinement consistently extending the chain of refinement steps that led to the source program down to the level of the machine  ... 
doi:10.1007/3-540-57877-3_20 fatcat:oz4hbcyngrgdbnrh2hziw7wgfm

Abstract State Machines 1988-1998: Commented ASM Bibliography [article]

Egon Boerger, James K. Huggins
1998 arXiv   pre-print
Sharpens the refinement method of [49] to cope also with parallelism and non determinism for an imperative programming language.  ...  Araujo A formal model of the whole system is reached through stepwise refinements of ASMs, and is used as a basis both to discover the minimum assumptions to guarantee the correctness of the system, and  ... 
arXiv:cs/9811014v1 fatcat:w3vj5i7mzbccbcibroi7dkmhtq

FPGAs in critical hardware/software systems

Adrian J. Hilton J. Adrian J. Hilton, Gemma Townson, Jon G. Hall
2003 Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arrays - FPGA '03  
Established safety standards require rigorous justification of safety and correctness of the conventional software in such systems.  ...  In this paper we examine the current state-of-the-art in programming FP-GAs, and their use in conventional (low-criticality) hardware/software systems.  ...  Correct Refinement The formal refinement of a state-based specification into a parallel process model is, in the general case, hard to manage correctly. One promising unified theory is Circus [?]  ... 
doi:10.1145/611817.611871 dblp:conf/fpga/HiltonTH03 fatcat:nmkyo47eszfh3gf63xdkthvv2m

Stepwise refinement of parallel algorithms

R.J.R. Back, K. Sere
1990 Science of Computer Programming  
The refinement calculus and the action system formalism are combined to provide a uniform method for constructing parallel and distributed algorithms by stepwise refinement.  ...  It is shown that the sequential refinement calculus can be used as such for most of the derivation steps. Parallelism is introduced during the derivation by refinement of atomicity.  ...  Total correctness is, however, the appropriate correctness notion for parallel algorithms.  ... 
doi:10.1016/0167-6423(90)90069-p fatcat:ilq2hdte7zehxke2mjtop3wimy
« Previous Showing results 1 — 15 out of 189,060 results