Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallélisme (Informatique) --- Parallel processing (Electronic computers) --- Programmation parallèle (Informatique) --- Parallel programming (Computer science) --- Algorithmes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallel processing (Electronic computers) --- Supercomputers --- Parallélisme (Informatique) --- Superordinateurs --- Supercomputers. --- Electronic digital computers --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Parallel processing (Electronic computers). --- Parallélisme (Informatique) --- Analyse numérique. --- Numerical analysis --- Langages de programmation --- Ordinateurs

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Parallel processing (Electronic computers) --- Parallélisme (Informatique) --- #KVIV:BB --- 681.3 *C2 --- 681.3*F12 --- 681.3*G1 --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Computer communication networks: data communications; OSI; security and protection --- Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- Numerical analysis --- Parallel processing (Electronic computers). --- 681.3*G1 Numerical analysis --- 681.3*F12 Modes of computation: alternation and nondeterminism; parallelism; probabilistic computation; relations among modes; relativized computation --- 681.3 *C2 Computer communication networks: data communications; OSI; security and protection --- Parallélisme (Informatique)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The hierarchical decomposition of programs into smaller ones is generally considered imperative to master the complexity of large programs. The impact of this principle of program decomposition on the specification and verification of parallel executed programs is the subject of this monograph. Two important yardsticks for verification methods, those of compositionality and modularity, are made precise. The problem of reusing software is addressed by the introduction of the notion of specification adaptation. Within this context, different methods for specifying the observable behavior with respect to partial correctness of communicating processes are considered, and in particular the contrast between the "programs are predicates" and the "programs are predicate transformers" paradigms is shown. The associated formal proof systems are proven sound and complete in various senses with respect to the denotational semantics of the programming language, and they are related to each other to give an in-depth comparison between the different styles of program verification. The programming language TNP used here is near to actual languages like Occam. It combines CCS/CSP style communication based programming with state based programming, and allows dynamically expanding and shrinking networks of processes.

Programming --- Automatic theorem proving --- Parallel processing (Electronic computers) --- 681.3*D21 --- 681.3*D24 --- 681.3*D31 --- 681.3*F31 --- Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D31 Formal definitions and theory: semantics; syntax (Programming languages)--See also {681.3*D21}; {681.3*F31}; {681.3*F32}; {681.3*F42}; {681.3*F43} --- 681.3*D24 Program verification: assertion checkers; correctness proofs; reliability; validation (Software engineering)--See also {681.3*F31} --- 681.3*D21 Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- Théorèmes --- Parallélisme (Informatique) --- Démonstration automatique --- Théorèmes --- Parallélisme (Informatique) --- Démonstration automatique --- Logic design. --- Software engineering. --- Computer science. --- Logics and Meanings of Programs. --- Software Engineering. --- Programming Languages, Compilers, Interpreters. --- Computer software engineering --- Engineering --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Lncs --- Concurrency