BDD-Based Symbolic Model Checking (Q3176366): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Binary Decision Diagrams / 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: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804909 / 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: Q5227061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolants and Symbolic Model Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-suppressed BDDs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness is mu-ineffable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear temporal logic symbolic model checking / rank
 
Normal rank

Latest revision as of 03:55, 16 July 2024

scientific article
Language Label Description Also known as
English
BDD-Based Symbolic Model Checking
scientific article

    Statements

    Identifiers