Pages that link to "Item:Q5348921"
From MaRDI portal
The following pages link to A fixpoint calculus for local and global program flows (Q5348921):
Displayed 12 items.
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- A structural/temporal query language for business processes (Q414923) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Colored nested words (Q2149962) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Nested Sibling Tree Automata (Q3625699) (← links)
- A Branching Time Variant of CaRet (Q5883579) (← links)
- Interval Temporal Logic for Visibly Pushdown Systems (Q6116361) (← links)
- Temporal logics with language parameters (Q6186316) (← links)