Pages that link to "Item:Q5178875"
From MaRDI portal
The following pages link to The size-change principle for program termination (Q5178875):
Displaying 40 items.
- A combination framework for complexity (Q276251) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Verification and code generation for invariant diagrams in Isabelle (Q478381) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- On proving \(C_E\)-termination of rewriting by size-change termination (Q835016) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Verifying termination and reduction properties about higher-order logic programs (Q850496) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- Asynchronous unfold/fold transformation for fixpoint logic (Q2163155) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- Loop summarization using state and transition invariants (Q2248058) (← links)
- A second-order formulation of non-termination (Q2353638) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- Enhancing dependency pair method using strong computability in simply-typed term rewriting (Q2460908) (← links)
- The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
- Type-level Computation Using Narrowing in Ωmega (Q2866338) (← links)
- ACL2s: “The ACL2 Sedan” (Q2867932) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- Loop Summarization and Termination Analysis (Q3000639) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Size-Change Termination and Satisfiability for Linear-Time Temporal Logics (Q3172880) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems (Q3194732) (← links)
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees (Q3303894) (← links)
- RAMSEY’S THEOREM FOR PAIRS AND<i>K</i>COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC (Q4977228) (← links)
- (Q5079760) (← links)
- (Q5089009) (← links)
- Mechanical certification of \(\mathrm{FOL_{ID}}\) cyclic proofs (Q6059221) (← links)
- (Q6060675) (← links)
- Formal verification of termination criteria for first-order recursive functions (Q6149593) (← links)
