Pages that link to "Item:Q5308427"
From MaRDI portal
The following pages link to Tools and Algorithms for the Construction and Analysis of Systems (Q5308427):
Displayed 43 items.
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Model checking probabilistic systems against pushdown specifications (Q436316) (← links)
- Temporal logics for concurrent recursive programs: satisfiability and model checking (Q472794) (← links)
- Visibly pushdown modular games (Q515657) (← links)
- Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
- Visibly linear temporal logic (Q682377) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Model checking dynamic memory allocation in operating systems (Q835783) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Verification of scope-dependent hierarchical state machines (Q948087) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Visibly linear dynamic logic (Q1786616) (← links)
- Context-free timed formalisms: robust automata and linear temporal logics (Q2113377) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Reachability of scope-bounded multistack pushdown systems (Q2216111) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Temporal logics with language parameters (Q2232279) (← links)
- The complexity of model checking multi-stack systems (Q2398213) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Visibly rational expressions (Q2453980) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Hybrid and First-Order Complete Extensions of CaRet (Q3010360) (← links)
- CVPP: A Tool Set for Compositional Verification of Control–Flow Safety Properties (Q3067539) (← links)
- ProMoVer: Modular Verification of Temporal Safety Properties (Q3095249) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- (Q3384894) (← links)
- Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic (Q3498457) (← links)
- Model Checking Recursive Programs with Exact Predicate Abstraction (Q3540067) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts (Q4686650) (← links)
- CaRet With Forgettable Past (Q4982130) (← links)
- (Q5020942) (← links)
- (Q5101344) (← links)
- A Branching Time Variant of CaRet (Q5883579) (← links)
- Verification of programs with exceptions through operator precedence automata (Q6045058) (← links)
- Interval Temporal Logic for Visibly Pushdown Systems (Q6116361) (← links)
- Model Checking Temporal Properties of Recursive Probabilistic Programs (Q6137848) (← links)
- Branching Temporal Logic of Calls and Returns for Pushdown Systems (Q6162219) (← links)
- Temporal logics with language parameters (Q6186316) (← links)