The following pages link to Giles Reger (Q2075783):
Displayed 22 items.
- Runtime verification past experiences and future projections (Q2075784) (← links)
- A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
- A combinator-based superposition calculus for higher-order logic (Q2096452) (← links)
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Symmetry avoidance in MACE-style finite model finding (Q2180212) (← links)
- A neurally-guided, parallel theorem prover (Q2180215) (← links)
- Making theory reasoning simpler (Q2233504) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Old or heavy? Decaying gracefully with age/weight shapes (Q2305433) (← links)
- Induction in saturation-based proof search (Q2305434) (← links)
- Unification with abstraction and theory instantiation in saturation-based reasoning (Q2324203) (← links)
- Selecting the Selection (Q2817931) (← links)
- Finding Finite Models in Multi-sorted First-Order Logic (Q2818025) (← links)
- Cooperating Proof Attempts (Q3454105) (← links)
- Playing with AVATAR (Q3454110) (← links)
- Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors (Q4647831) (← links)
- A Polymorphic Vampire (Q5049013) (← links)
- Testing a Saturation-Based Theorem Prover: Experiences and Challenges (Q5086225) (← links)
- Runtime Verification Logics A Language Design Perspective (Q5217308) (← links)
- Getting saturated with induction (Q6113982) (← links)
- Lemmaless induction in trace logic (Q6160563) (← links)