swMATH7831MaRDI QIDQ19847FDOQ19847
Author name not available (Why is that?)
Official website: http://aprove.informatik.rwth-aachen.de/
Cited In (only showing first 100 items - show all)
- Twenty years of rewriting logic
- Explaining safety failures in NetKAT
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Maintaining a library of formal mathematics
- Proving termination of context-sensitive rewriting with MU-TERM
- Certification of Termination Proofs Using CeTA
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- Justification logic and history based computation
- COSTA
- TALP
- CLEAN
- BABEL
- Haskell
- CEGAR
- Yices
- OBJ3
- CafeOBJ
- Maude
- CeTA
- Timbuk
- GiNaCRA
- TERMINATOR
- Cseq
- SMTInterpol
- Ultimate Automizer
- SPIKE
- ACL2s
- Tyrolean
- PMaude
- LLBMC
- ABC
- MathSAT5
- CSI
- CoLoR
- ITP
- DPPD
- MTT
- CiME
- HERMIT
- CARIBOO
- SCC
- mkbTT
- Jambox
- MU-TERM
- InvX
- IsaFoR
- Matchbox
- Slothrop
- Saigawa
- Sugar
- Tom
- VMTL
- TPDB
- TPA
- TORPA
- Tsukuba
- CoCasl
- CArL
- C-SHORe
- Conditional Confluence
- SMT-RAT
- SymDiff
- Lazy-CSeq
- KITTeL
- PolyLib
- monabs
- Jimple
- A3PAT
- ConCon
- SACO
- CAMPY
- Nagoya Termination Tool
- RAML
- TCAS
- SparrowBerry
- VeriFun
- FuncTion
- LoAT
- LTLAutomizer
- Ultimate
- Ultimate Kojak
- CPAlien
- FrankenBit
- Jakstab
- MU-CSeq
- EasyInterface
- FlowDroid
- CoCoWeb
- Cops
- FORT
- Perron Frobenius
- Coccinelle
- REVE
- GenMul
- multgen
- KoAT
- SDN-SafeCheck
- TcT
- Termination of Isabelle functions via termination of rewriting
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
This page was built for software: AProVE