Tactical theorem proving in program verification (Q6488526): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Proving program inclusion using Hoare's logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatising the logic of computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3826528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:56, 3 December 2024

scientific article; zbMATH DE number 7680802
Language Label Description Also known as
English
Tactical theorem proving in program verification
scientific article; zbMATH DE number 7680802

    Statements

    Tactical theorem proving in program verification (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers