Higher-order quantifier elimination, counter simulations and fault-tolerant systems (Q2031422): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ETPS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeaHorn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: nuXmv / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mcmt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ByMC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-020-09578-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3081978399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Constraints in Flat Array Fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality constraints for arrays (decidability results and applications) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures for flat array properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to mathematical logic and type theory: To truth through proof. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerating corrupted communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous consensus and broadcast protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform consensus is harder than consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Heard-Of model: computing in distributed systems with benign faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based verification of parameterized cache coherence protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic-Based Framework for Verifying Consensus Algorithms / 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: Predicate abstraction for software verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3543581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: MCMT: A Model Checker Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of failure-sensitive agreement problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Property Directed Reachability / 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: What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms / 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: Interpolation and Symbol Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Boolean algebra with Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3727946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff bounds for consensus algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided quantifier instantiation for synthesis in SMT / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:18, 25 July 2024

scientific article
Language Label Description Also known as
English
Higher-order quantifier elimination, counter simulations and fault-tolerant systems
scientific article

    Statements

    Higher-order quantifier elimination, counter simulations and fault-tolerant systems (English)
    0 references
    0 references
    0 references
    9 June 2021
    0 references
    0 references
    2nd order quantifier elimination
    0 references
    satisfiability modulo theories
    0 references
    verification of parameterized distributed systems
    0 references
    counter abstractions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references