Choose an application

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

The stepwise refinement method postulates a system construction route that starts with a high-level specification, goes through a number of provably correct development steps, and ends with an executable program. The contributions to this volume survey the state of the art in this extremely active research area. The world's leading specialists in concurrent program specification, verification, and the theory of their refinement present latest research results and surveys of the fields. State-based, algebraic, temporal logic oriented and category theory oriented approaches are presented. Special attention is paid to the relationship between compositionality and refinement for distributed programs. Surveys are given of results on refinement in partial-order based approaches to concurrency. A unified treatment is given of the assumption/commitment paradigm in compositional concurrent program specification and verification, and the extension of these to liveness properties. Latest results are presented on specifying and proving concurrent data bases correct, and deriving network protocols from their specifications.

Electronic data processing --- Traitement réparti --- Distributed processing --- Congresses --- Congrès --- -681.3*D13 --- 681.3*F3 --- ADP (Data processing) --- Automatic data processing --- Data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Concurrent programming --- Logics and meanings of programs (Theory of computation) --- Automation --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 681.3*D13 Concurrent programming --- Traitement réparti --- Congrès --- 681.3*D13 --- Distributed processing&delete& --- Computer network architectures. --- Logic design. --- Computer science. --- Computer Communication Networks. --- Computer System Implementation. --- Logics and Meanings of Programs. --- Programming Techniques. --- Informatics --- Science --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Architectures, Computer network --- Network architectures, Computer --- Computer architecture

Choose an application

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

Computer science --- Informatique --- Computer Science --- 681.3*F2 --- 681.3*F32 --- 681.3*F32 Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- Semantics of programming languages: algebraic approaches to semantics; denotational semantics; operational semantics (Logics and meanings of programs)--See also {681.3*D31} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 519.72 --- Computer science. --- Informatics --- Science --- Computer Science. --- Algorithmes --- Sémantique --- graph Algorithms --- Cryptography --- Pattern Matching --- Vlsi --- Complexity --- kolmogorov --- Turing Machines --- Specification --- Temporal Logic --- algebraic --- Database Theory --- Modal Logic --- Formal Models --- Semantics --- Type Systems --- Rewriting

Choose an application

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

681.3*D21 --- 681.3*D24 --- 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} --- 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*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}

Choose an application

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

512 --- Set theory --- Computer programming --- 681.3*F3 --- 681.3*F41 --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Aggregates --- Classes (Mathematics) --- Ensembles (Mathematics) --- Mathematical sets --- Sets (Mathematics) --- Theory of sets --- Logic, Symbolic and mathematical --- Mathematics --- Algebra --- Logics and meanings of programs (Theory of computation) --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Programming --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F3 Logics and meanings of programs (Theory of computation) --- 512 Algebra --- Type Theory --- Parameterized --- Abstract data types (Computer science)

Choose an application

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

ANNA (Computer program language) --- Ada (Computer program language) --- 681.3*D21 --- 681.3*F31 --- Programming languages (Electronic computers) --- Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31} --- 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*D21 Requirements/specifications: languages; methodologies; tools (Software engineering)--See also {681.3*D31}