Latticed \(k\)-induction with an application to probabilistic programs (Q832288): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 2105.14100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensuring the reliability of your model checker: interval iteration for Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixpoint theory -- upside down / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing Probabilistic Invariants via Doob’s Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsf{PrIC3}: property directed reachability for MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latticed \(k\)-induction with an application to probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Model Checking without Unrolling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample-guided abstraction-refinement framework for markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive versions of Tarski's fixed point theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic analysis of DMA races using model checking and \(k\)-induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Polynomial Loop Invariants for Probabilistic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimistic value iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking for probabilistic programs / 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: On the hardness of analyzing probabilistic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Invariant Generation for Probabilistic Programs: / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolating strong induction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized mutual exclusion algorithms revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point theorems and semantics: A folk tale / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction, Refinement and Proof for Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interpolating theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring expected runtimes of probabilistic integer programs using expected sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Lattices and Up-To Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancements of the bisimulation proof method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sound value iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking of infinite state systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking / rank
 
Normal rank

Latest revision as of 10:49, 28 July 2024

scientific article
Language Label Description Also known as
English
Latticed \(k\)-induction with an application to probabilistic programs
scientific article

    Statements

    Latticed \(k\)-induction with an application to probabilistic programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2022
    0 references
    \(k\)-induction
    0 references
    bounded model checking
    0 references
    fixed-point theory
    0 references
    probabilistic programs
    0 references
    quantitative verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers