scientific article; zbMATH DE number 4119602
From MaRDI portal
Publication:4733386
Recommendations
Cited in
(29)- Partitioned PLTL model-checking for refined transition systems
- State machines and assertions: An integrated approach to modeling and verification of distributed systems
- A logical characterization of well branching event structures
- Defining conditional independence using collapses
- On undecidability of propositional temporal logics on trace systems
- Verification of distributed programs using representative interleaving sequences
- Formal verification of a programming logic for a distributed programming language
- A principle for sequential reasoning about distributed algorithms
- Verifying parallel programs with dynamic communication structures
- Going beyond dual execution: MPC for functions with efficient verification
- Verifying the correctness of distributed systems via mergeable parallelism
- Compositional verification of asynchronous concurrent systems using CADP
- A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
- Partial-Order Reduction
- scientific article; zbMATH DE number 7295368 (Why is no real title available?)
- scientific article; zbMATH DE number 6533780 (Why is no real title available?)
- A proof of the correctness of parallel addition to a shared variable in IPCL
- Proceedings of the 3rd international workshop on parallel and distributed methods in verification (PDMC 2004), London, UK, September 4, 2004
- scientific article; zbMATH DE number 177840 (Why is no real title available?)
- scientific article; zbMATH DE number 562736 (Why is no real title available?)
- Verification of distributed systems with local-global predicates
- scientific article; zbMATH DE number 1533829 (Why is no real title available?)
- Behavioural characterizations of partial order logics
- Formal Methods in Computer-Aided Design
- Verification of distributed programs of the SPMD-type on the basis of the L-programs formalism
- Parallelizing the \(\text{Mur}\varphi\) verifier
- Models and logics for true concurrency.
- Using the causal domain to specify and verify distributed programs
- Verification of distributed systems with the axiomatic system of MSVL
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733386)