Sequential programming for distributed algorithm verification

Writing a sequential program in an imperative programming language is much easier than writing a distributed algorithm. This paper describes an approach to representing, testing, and verifying distributed algorithms by treating them as sequential programs. This approach allows for the use of testing and verification techniques typically applied to sequential programs.

Authors

Institutions

Publication Details

Published
2024-11-13
DOI
https://doi.org/10.1109/prdc63035.2024.00042
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sequential programming for distributed algorithm verification

Tatsuhiro Tsuchiya
Formal Methods in Verification
article

Sequential programming for distributed algorithm verification

Tatsuhiro Tsuchiya
article en

Abstract

Writing a sequential program in an imperative programming language is much easier than writing a distributed algorithm. This paper describes an approach to representing, testing, and verifying distributed algorithms by treating them as sequential programs. This approach allows for the use of testing and verification techniques typically applied to sequential programs.

The University of Osaka (JP)
Openalex Percentile: Top 69%
Formal Methods in Verification
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Sequential programming for distributed algorithm verification — Tatsuhiro Tsuchiya · (2024) | TGRS Research Map | TGRS