An automata-theoretic approach to the verification of distributed algorithms (Q1706162): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5357714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming transducers for algorithmic verification of single-pass list-processing programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of array-accessing programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Model Checking of Token-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Parameterised Multi-token Systems via the Composition Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: XPath satisfiability in the presence of DTDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Languages of Data Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Theorem for the Verification of Round-Based Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reasoning About Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Verifying Fault Tolerance of Distributed Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2865941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5015276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PDL with intersection and converse: satisfiability and infinite-state model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking propositional dynamic logic with all extras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameterised compositional verification of safety properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending two-variable logic on data trees with order on data values and its automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank

Revision as of 08:03, 15 July 2024

scientific article
Language Label Description Also known as
English
An automata-theoretic approach to the verification of distributed algorithms
scientific article

    Statements

    An automata-theoretic approach to the verification of distributed algorithms (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references