The following pages link to AProVE (Q19847):
Displaying 50 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Multi-completion with termination tools (Q352956) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Proving termination of nonlinear command sequences (Q470005) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Knuth-Bendix completion of theories of commuting group endomorphisms (Q844197) (← links)
- KBO orientability (Q846165) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- Mechanizing and improving dependency pairs (Q877836) (← links)
- Deaccumulation techniques for improving provability (Q882487) (← links)
- Type-based termination of generic programs (Q923883) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Adding constants to string rewriting (Q945008) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Increasing interpretations (Q1044231) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution (Q1647969) (← links)
- Automating regression verification of pointer programs by predicate abstraction (Q1650864) (← links)
- Complexity analysis for term rewriting by integer transition systems (Q1687548) (← links)
- Conflict-driven conditional termination (Q1702895) (← links)
- Fairness modulo theory: a new approach to LTL software model checking (Q1702910) (← links)
- Relational program reasoning using compiler IR (Q1703014) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Explaining safety failures in NetKAT (Q2043810) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- Tuple interpretations for termination of term rewriting (Q2102931) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- \textsc{LTL} falsification in infinite-state systems (Q2105460) (← links)
- Pattern eliminating transformations (Q2119103) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- Transforming derivational complexity of term rewriting to runtime complexity (Q2180239) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Maintaining a library of formal mathematics (Q2219408) (← links)
