Symbolic model checking with rich assertional languages (Q5941102): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about networks with many identical finite state processes / 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: Automatic verification of finite-state concurrent systems using temporal logic specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using branching time temporal logic to synthesize synchronization skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reasoning About Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experience in proving regular networks of processes by modular model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching-time temporal logic and tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structural induction theorem for processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic verification of parameterized networks of processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolants and Symbolic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about systems with many processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank

Latest revision as of 19:20, 3 June 2024

scientific article; zbMATH DE number 1635267
Language Label Description Also known as
English
Symbolic model checking with rich assertional languages
scientific article; zbMATH DE number 1635267

    Statements

    Symbolic model checking with rich assertional languages (English)
    0 references
    20 August 2001
    0 references
    0 references
    symbolic model checking
    0 references
    parametric systems
    0 references
    tree automata
    0 references
    regular expressions
    0 references
    0 references
    0 references