scientific article; zbMATH DE number 1390334
From MaRDI portal
Publication:4934623
zbMath0959.68080MaRDI QIDQ4934623
Publication date: 6 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (15)
Improving automation for higher-order proof steps ⋮ Implementing dataflow with threads ⋮ On the diversity of asynchronous communication ⋮ Information flow control in software DB units based on formal verification ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Fast Paxos ⋮ Lower bounds for asynchronous consensus ⋮ Domain science and engineering from computer science to the sciences of informatics. II: Science ⋮ Domain science and engineering from computer science to the sciences of informatics. I: Engineering ⋮ Deductive verification of alternating systems ⋮ Manifest domains: analysis and description ⋮ A modular framework for verifying versatile distributed systems ⋮ Byzantizing Paxos by Refinement ⋮ A Reduction Theorem for the Verification of Round-Based Distributed Algorithms ⋮ Combinations of Theories for Decidable Fragments of First-Order Logic
Uses Software
This page was built for publication:
