Verification of sequential and concurrent programs.

MaRDI QIDQ4344071zbMATH OpenFDO

Authors Krzysztof R. Apt, Ernst-Rüdiger Olderog

Publication date 9 July 1997

zbMATH Keywords

concurrent programsdistributed programsprogram transformationsprogram verificationproof systemssequential programs

Mathematics Subject Classification ID

Logic in computer science (03B70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Review text

For a review of the first edition (1991) see Zbl 0733.68053.

Cited in

(15)

• The origins of structural operational semantics
• Efficient verification of sequential and concurrent C programs
• A unified approach of program verification
• On assertion-based encapsulation for object invariants and simulations
• Verification of fine-grain concurrent programs
• Ernst-Rüdiger Olderog: A Life for Meaning
• Fairness for infinitary control
• Synthesis of large dynamic concurrent programs from dynamic specifications
• Explicit fair scheduling for dynamic control
• An invariant-based approach to the verification of asynchronous parameterized networks
• Some uses of modal semirings
• Algebras of modal operators and partial correctness
• Verification of sequential and concurrent programs
• Towards imperative modules: reasoning about invariants and sharing of mutable state
• A non-standard semantics for program slicing and dependence analysis

This page was built for publication: Verification of sequential and concurrent programs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344071)