VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (Q3021957): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q129146979, #quickstatements; #temporary_batch_1724808069555
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and Completeness of an Axiom System for Program Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive, generative, and stratified models of probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic PDL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic verification / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s012905410200114x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119029543 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129146979 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:33, 28 August 2024

scientific article
Language Label Description Also known as
English
VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
scientific article

    Statements

    VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC (English)
    0 references
    0 references
    0 references
    22 June 2005
    0 references
    Hoare logic
    0 references
    probability
    0 references
    randomized algorithms
    0 references
    program verification
    0 references
    probabilistic predicates
    0 references

    Identifiers