StarExec
From MaRDI portal
Cited in
(only showing first 100 items - show all)- HaifaSat
- PyRes
- PReLearn
- iRankFinder
- Open-WBO-Inc
- SLIME
- cake_lpr
- SMT-LIB
- FLATA
- TPTP
- Machine learning-based restart policy for CDCL SAT solvers
- SPASS+T
- An empirical study of branching heuristics through the lens of global learning rate
- Incremental bounded model checking for embedded software
- Deciding local theory extensions via E-matching
- Counterexample-guided quantifier instantiation for synthesis in SMT
- PURRS
- Superposition for -free higher-order logic
- A FOOLish encoding of the next state relations of imperative programs
- Datatypes with shared selectors
- PoCaB
- Satallax
- NiVER
- Zeno
- On solving quantified bit-vector constraints using invertibility conditions
- Multi-dimensional interpretations for termination of term rewriting
- Superposition with first-class booleans and inprocessing clausification
- SAT competition 2020
- RunLim
- Runsolver
- Asparagus
- A combinator-based superposition calculus for higher-order logic
- Subsumption demodulation in first-order theorem proving
- Layered clause selection for theory reasoning (short paper)
- Term orderings for non-reachability of (conditional) rewriting
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- CVC4
- Bloqqer
- Eldarica
- Aligators
- CoLoR
- Symmetry avoidance in MACE-style finite model finding
- MU-TERM
- TPDB
- Automated reasoning. 7th international joint conference, IJCAR 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 19--22, 2014. Proceedings
- Refutation-based synthesis in SMT
- Restricted combinatory unification
- Old or heavy? Decaying gracefully with age/weight shapes
- Induction in saturation-based proof search
- Faster, higher, stronger: E 2.3
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- A decision procedure for (co)datatypes in SMT solvers
- MetTeL
- GQML
- Kaluza
- Splitting proofs for interpolation
- Scavenger 0.1: a theorem prover based on conflict resolution
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems
- Easychair
- Beagle
- Saucy
- Ctrl
- Polyhedral approximation of multivariate polynomials using Handelman's theorem
- Selecting the selection
- Performance of clause selection heuristics for saturation-based theorem proving
- Learning rate based branching heuristic for SAT solvers
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Finding Finite Models in Multi-sorted First-Order Logic
- The 2013 evaluation of SMT-COMP and SMT-LIB
- Leo-III
- OpenSMT2
- HordeQBF
- MPIDepQBF
- EFSMT
- JST
- DISCOUNT
- RADA
- Proving termination through conditional termination
- Scaling enumerative program synthesis via divide and conquer
- FAST
- FMLtoHOL
- nanoCoP
- Nagoya Termination Tool
- ConCon
- SAT race 2015
- Confluence Competition 2015
- A decision procedure for (co)datatypes in SMT solvers
- QBFEVAL
- LoAT
- H-PILoT
- Scavenger
- RAHFT
- abcdSAT
- MapleSAT
- CAQE
- AIGSolve
- CoCoWeb
- Cops
- CO3
- ZRes
This page was built for software: StarExec
