The following pages link to (Q3804237):
Displaying 11 items.
- OBSCURE, a specification language for abstract data types (Q1323328) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- Deriving constraints among argument sizes in logic programs (Q1360682) (← links)
- From cut-free calculi to automated deduction: the case of bounded contraction (Q1744444) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Shallow confluence of conditional term rewriting systems (Q2518609) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- Termination of algorithms over non-freely generated data types (Q4647505) (← links)
- Termination checking with types (Q4659886) (← links)
- Termination analysis for partial functions (Q5030190) (← links)
- Lazy generation of induction hypotheses (Q5210761) (← links)
