Pages that link to "Item:Q2942913"
From MaRDI portal
The following pages link to A generic approach to the static analysis of concurrent programs with procedures (Q2942913):
Displayed 18 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- Bounded underapproximations (Q453533) (← links)
- Derivation tree analysis for accelerated fixed-point computation (Q549189) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Model checking dynamic pushdown networks (Q2355386) (← links)
- Reasoning about Threads with Bounded Lock Chains (Q3090848) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- Invariant Checking for Programs with Procedure Calls (Q3392933) (← links)
- Solving Multiple Dataflow Queries Using WPDSs (Q3522064) (← links)
- Language Strength Reduction (Q3522077) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous (Q5056000) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound (Q5458333) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Reachability Analysis of Pushdown Systems with an Upper Stack (Q5739017) (← links)