The following pages link to CONCUR 2005 – Concurrency Theory (Q5897503):
Displaying 18 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Programs with lists are counter automata (Q537953) (← links)
- Lower-bound synthesis using loop specialization and Max-SMT (Q832313) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Non-termination Sets of Simple Linear Loops (Q2915099) (← links)
- Loop Summarization and Termination Analysis (Q3000639) (← links)
- TERMINATION ANALYSIS OF LINEAR LOOPS (Q3069740) (← links)
- (Q5092319) (← links)
- Automatic Verification of Counter Systems With Ranking Function (Q5179052) (← links)
- Automated Technology for Verification and Analysis (Q5491849) (← links)
- (Q5499193) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
