Program schemata vs. automata for decidability of program logics (Q1392141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4501136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of program structures: Schemes, semantics, verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318101 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483264 / 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: Q3349961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complementation problem for Büchi automata with applications to temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata theoretic decision procedure for the propositional mu- calculus / rank
 
Normal rank

Latest revision as of 13:23, 28 May 2024

scientific article
Language Label Description Also known as
English
Program schemata vs. automata for decidability of program logics
scientific article

    Statements