The following pages link to Static Analysis (Q5897430):
Displaying 23 items.
- Proving termination of nonlinear command sequences (Q470005) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Programs with lists are counter automata (Q537953) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Proving mutual termination (Q746783) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Reliable social sensing with physical constraints: analytic bounds and performance evaluation (Q892996) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Automatically proving termination and memory safety for programs with pointer arithmetic (Q2362494) (← links)
- Program verification with interacting analysis plugins (Q2642983) (← links)
- Loop Summarization and Termination Analysis (Q3000639) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- Explicit Fair Scheduling for Dynamic Control (Q5187822) (← links)
- A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (Q5191108) (← links)
- May-Happen-in-Parallel Analysis for Actor-Based Concurrency (Q5277912) (← links)
- A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
- Hierarchical decompositions and termination analysis for generalized planning (Q6488800) (← links)
