Pages that link to "Item:Q2581762"
From MaRDI portal
The following pages link to Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762):
Displaying 16 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Handling infinitely branching well-structured transition systems (Q1686118) (← links)
- Data flow analysis of asynchronous systems using infinite abstract domains (Q2233447) (← links)
- Petri nets with name creation for transient secure association (Q2510386) (← links)
- Unbounded-Thread Program Verification using Thread-State Equations (Q2817949) (← links)
- Ideal Abstractions for Well-Structured Transition Systems (Q2891435) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← links)
- (Q5009453) (← links)
- (Q5136306) (← links)
- View abstraction -- a tutorial (invited paper) (Q5240148) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465861) (← links)
- Computer Aided Verification (Q5716580) (← links)