Automata-based verification of programs with tree updates (Q845236): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context logic as modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata with one memory set constraints and cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Automata with Memory, Visibility and Structural Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Verification of Shape and Size Properties Via Separation Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 11:21, 2 July 2024

scientific article
Language Label Description Also known as
English
Automata-based verification of programs with tree updates
scientific article

    Statements