Pages that link to "Item:Q5191507"
From MaRDI portal
The following pages link to FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191507):
Displaying 13 items.
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Tree regular model checking: a simulation-based approach (Q2500700) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- On Symbolic Verification of Weakly Extended PAD (Q2866343) (← links)
- On the Reachability Analysis of Acyclic Networks of Pushdown Systems (Q3541030) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism (Q5179049) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5892174) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)
