Pages that link to "Item:Q5716758"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716758):
Displaying 12 items.
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Invariants for parameterised Boolean equation systems (Q960855) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- Detection of ranking functions of polynomial loop programs (Q3306912) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- (Q5015366) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5901912) (← links)