Be lazy and don't care: faster CTL model checking for recursive state machines (Q6045062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Model Checking Procedural Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis of pushdown automata: Application to model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model checking the full modal mu-calculus for infinite sequential processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A saturation method for the modal \(\mu \)-calculus over pushdown systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interprocedural Analysis with Lazy Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted pushdown systems and their application to interprocedural dataflow analysis / rank
 
Normal rank

Latest revision as of 05:07, 1 August 2024

scientific article; zbMATH DE number 7689396
Language Label Description Also known as
English
Be lazy and don't care: faster CTL model checking for recursive state machines
scientific article; zbMATH DE number 7689396

    Statements

    Identifiers