A. Knüpfer, T. Hilbrich, J. Protze, and J. Schuchart, Dynamic analyses to support program development with the textually aligned property for openshmem collectives, Second workshop of OPENSHMEM and Related Technologies, vol.9397, pp.105-118, 2015.

A. Middeldorp and H. Zantema, Simple termination of rewrite systems, Theoretical Computer Science, vol.9, issue.4, pp.127-158, 1997.

K. and Y. A. Kamil, Concurrency analysis for parallel programs with textually aligned barriers, International Workshop on Languages and Compilers for Parallel Computing, 2005.

A. Aiken and D. Gay, Barrier inference, 25th ACM SIGPLAN Symposium on Principles of Programming (POPL), pp.342-354, 1998.

T. Aoto, N. Hirokawa, A. Middeldorp, J. Nagele, N. Nishida et al., Confluence competition 2018, 3rd International Conference on Formal Structures for Cumputation and Deduction, vol.32, pp.1-32, 2018.

J. Avenhaus and K. Madlener, Term rewriting and equational reasoning, Formal technics in Artificial Intelligence, pp.1-43, 1990.

R. H. Bisseling, Parallel Scientific Computation: A Structured Approach using BSP and MPI, 2004.

F. Dabrowski, A denotational semantics of textually aligned SPMD Programs, Journal of Logical and Algebraic Methods in Programming, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01785110

D. E. Knuth and P. Bendix, Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pp.263-297, 1970.
DOI : 10.1007/978-3-642-81955-1_23

N. Dershowitz, Orderings for term rewriting systems, Theoretical Computer Science, vol.17, issue.4, pp.279-301, 1982.
DOI : 10.1016/0304-3975(82)90026-3
URL : https://doi.org/10.1016/0304-3975(82)90026-3

N. Dershowitz, Termination of rewriting, Journal of Symbolic Computation, vol.3, issue.4, pp.69-116, 1987.
DOI : 10.1016/s0747-7171(87)80022-6
URL : https://doi.org/10.1016/s0747-7171(87)80022-6

E. Contejean, C. Marché, A. P. Tomàs, and U. X. , Mechanically proving termination using polynomial interpretations, Journal of Automated Reasoning, vol.34, issue.4, pp.325-363, 2005.
DOI : 10.1007/s10817-005-9022-x
URL : https://hal.archives-ouvertes.fr/inria-00001167

F. Baader and T. Nipkow, Term rewriting systems and all that, 1998.

M. J. Flynn, Some computer organizations and their effectiveness, In Trans. on Computers, vol.21, issue.9, pp.948-960, 1972.
DOI : 10.1109/tc.1972.5009071

F. Gava and J. Fortin, Formal Semantics of a Subset of the Paderborn's BSPlib, Parallel and Distributed Computing, Applications and Technologies (PDCAT)

, IEEE, issue.1, 2008.

I. Grudenic and N. Bogunovic, Modeling and Verification of MPI Based Distributed Software, Recent Advances in Parallel Virtual Machine and Message Passing Interface, 13th European PVM/MPI User's Group Meeting, vol.4192, pp.123-132, 2006.
DOI : 10.1007/11846802_23

M. D. Jonathan, B. Hill, D. C. Mccoll, M. W. Stefanescu, K. Goudreau et al., Torsten Suel, Thanasis Tsantilas, and Rob Bisseling, vol.24, pp.1947-1980, 1998.

G. Huet and D. Oppen, Equations and rewrite rules: A survey, Formal Languages: Perspectives and Open Problems, 1980.
DOI : 10.1016/b978-0-12-115350-2.50017-8
URL : http://rewriting.loria.fr/documents/CS-TR-80-785.pdf

A. Jackobsson, F. Dabrowski, W. Bousdira, F. Loulergue, and G. Hains, Replicated Synchronisation for Imperative BSP Programs, International Conference on Computational Science (ICCS), vol.77, 2017.

F. Loulergue, BS? p : Functional BSP Programs on Enumerated Vectors, International Symposium on High Performance Computing, number 1940 in LNCS, pp.355-363, 2000.
DOI : 10.1007/3-540-39999-2_34

F. Loulergue, F. Gava, and D. Billiet, Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction, International Conference on Computational Science (ICCS), vol.3515, pp.1046-1054, 2005.
DOI : 10.1007/11428848_132

M. Newman, On theories with a combinatorial definition of equivalence, Annals of Math, issue.5, pp.223-243, 1942.

F. Nielson, H. R. Nielson, and C. Hankin, Principles of Program Analysis, 2005.

J. Steinbach, Extensions ans comparison of simplification orderings, Conference on Rewriting Techniques and Applications, number 355 in LNCS, pp.434-448
DOI : 10.1007/3-540-51081-8_124

T. Jeremiassen and S. Eggers, Static analysis of barrier synchronization in explicitly parallel programs, Parallel Architectures and Compilation Techniques, pp.171-180, 1994.

J. Tesson and F. Loulergue, Formal Semantics for the DRMA Programming Style Subset of the BSPlib Library, Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM 2007), Workshop on Language-Based Parallel Programming Models, number 4967 in LNCS, pp.1122-1129, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00452540

G. Winskel, The Formal Semantics of Programming Languages. Foundations of Computing Series, 1993.

A. N. Yzelman, R. H. Bisseling, D. Roose, and K. Meerbergen, MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming, International Journal of Parallel Programming, issue.1, pp.1-24, 2013.

Y. Zhang and E. Duesterwaki, Barrier matching for programs with textually unaligned barriers, 12th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP), pp.194-204, 2007.
DOI : 10.1145/1229428.1229472