Pages that link to "Item:Q5897782"
From MaRDI portal
The following pages link to FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science (Q5897782):
Displaying 16 items.
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- A calculus of branching processes (Q2286743) (← links)
- Faster Algorithms for Weighted Recursive State Machines (Q2988644) (← links)
- Reasoning about Threads with Bounded Lock Chains (Q3090848) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- When Is Reachability Intrinsically Decidable? (Q3533013) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (Q3617755) (← 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)
- Context-Bounded Analysis of Concurrent Queue Systems (Q5458334) (← links)
- Round- and context-bounded control of dynamic pushdown systems (Q6564172) (← links)
