Pages that link to "Item:Q5901912"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5901912):
Displaying 49 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method (Q394460) (← links)
- On invariant checking (Q394493) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- A new representation and associated algorithms for generalized planning (Q543617) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Reflections on termination of linear loops (Q832249) (← links)
- Decision tree learning in CEGIS-based termination analysis (Q832251) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Convergence: integrating termination and abort-freedom (Q1647960) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Complexity and resource bound analysis of imperative programs using difference constraints (Q2398171) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Efficiently solving quantified bit-vector formulas (Q2441770) (← links)
- Extended Nested Dual System Groups, Revisited (Q2798774) (← links)
- Automated Program Verification (Q2799160) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Transition Invariants and Transition Predicate Abstraction for Program Termination (Q3000631) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- A Hoare Logic for Energy Consumption Analysis (Q3460506) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- (Q5089280) (← links)
- (Q5092319) (← links)
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
- (Q5114822) (← links)
- Automatic Verification of Counter Systems With Ranking Function (Q5179052) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- Ranking Functions for Linear-Constraint Loops (Q5501930) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)
- What's decidable about discrete linear dynamical systems? (Q6113969) (← links)