Pages that link to "Item:Q5711486"
From MaRDI portal
The following pages link to Verification, Model Checking, and Abstract Interpretation (Q5711486):
Displaying 30 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)
- Global optimization of polynomials restricted to a smooth variety using sums of squares (Q412217) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Constraint solving for interpolation (Q604394) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Property-directed incremental invariant generation (Q939166) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Refutation-based synthesis in SMT (Q2280222) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Witness to non-termination of linear programs (Q2357364) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- Static analysis by abstract interpretation: a mathematical programming approach (Q2814107) (← links)
- Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (Q2842646) (← links)
- Mathematical programming based debugging (Q2861570) (← links)
- Certificate size reduction in abstraction-carrying code (Q2909518) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- All-Termination(T) (Q3617771) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5089280) (← links)
- Invariant Synthesis for Combined Theories (Q5452621) (← links)
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation (Q5505618) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Inductive termination proofs with transition invariants and their relationship to the size-change abstraction (Q6045024) (← links)
