Synchronous counting and computational algorithm design
type: Item
instance of: scholarly article
title: Synchronous counting and computational algorithm design
zbMATH Open document ID: 1346.68038
author: Danny Dolev
author: Keijo Heljanko
author: Matti Järvisalo
author: Janne H. Korhonen
author: Christoph Lenzen
author: Joel Rybicki
author: Jukka Suomela
author: Siert Wieringa
published in: Journal of Computer and System Sciences
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W15
zbMATH DE Number: 6520020
zbMATH Keywords: distributed computing
zbMATH Keywords: self-stabilisation
zbMATH Keywords: Byzantine fault tolerance
zbMATH Keywords: synthesis
zbMATH Keywords: formal methods
zbMATH Keywords: SAT
describes a project that uses: MiniSat
describes a project that uses: RAReQS
describes a project that uses: Lingeling
MaRDI profile type: Publication
full work available at URL: j.jcss.2015.09.002
OpenAlex ID: W1942094667
cites work: Q4804899
cites work: Fast self-stabilizing byzantine tolerant digital clock synchronization
cites work: Q5503674
cites work: SAT-Based Synthesis Methods for Safety Specs
cites work: Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems
cites work: Optimal Sorting Networks
cites work: Q5725991
cites work: Q3336675
cites work: Counterexample-guided abstraction refinement for symbolic model checking
cites work: Q4457215
cites work: Q4809077
cites work: The Byzantine generals strike again
cites work: Q4967183
cites work: On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
cites work: Self-stabilization
cites work: Self-stabilizing clock synchronization in the presence of Byzantine faults
cites work: Complexity-sensitive decision procedures for abstract argumentation
cites work: Temporal induction by incremental SAT solving
cites work: Theory and Applications of Satisfiability Testing
cites work: Generalization of a Probability Limit Theorem of Cramer
cites work: Lazy Synthesis
cites work: Automated Technology for Verification and Analysis
cites work: Bounded Synthesis
cites work: A lower bound for the time to assure interactive consistency
cites work: Computer Aided Verification
cites work: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
cites work: Parameterized Synthesis
cites work: Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
cites work: Solving QBF with Counterexample Guided Refinement
cites work: Abstraction-Based Algorithm for 2QBF
cites work: Finding Efficient Circuits for Ensemble Computation
cites work: Towards optimal synchronous counting
cites work: Q3126969
cites work: Synthesis of Communicating Processes from Temporal Logic Specifications
cites work: Resilience of mutual exclusion algorithms to transient memory faults
cites work: What Can be Computed Locally?
cites work: Reaching Agreement in the Presence of Faults
cites work: Efficiently solving quantified bit-vector formulas
DOI: 10.1016/J.JCSS.2015.09.002
description: scientific article; zbMATH DE number 6520020