The following pages link to Jochen Hoenicke (Q286736):
Displaying 25 items.
- Proof tree preserving tree interpolation (Q286737) (← links)
- Doomed program points (Q633286) (← links)
- Model checking duration calculus: a practical approach (Q939170) (← links)
- A tree-based approach to data flow proofs (Q1629956) (← links)
- The map equality domain (Q1629967) (← links)
- Cutting the mix (Q1702886) (← links)
- Efficient interpolation for the theory of arrays (Q1799115) (← links)
- Temporal prophecy for proving temporal properties of infinite-state systems (Q2058382) (← links)
- Incremental search for conflict and unit instances of quantified formulas with E-matching (Q2234102) (← links)
- Solving and interpolating constant arrays based on weak equivalences (Q2287092) (← links)
- Automated Program Verification (Q2799160) (← links)
- Splitting via Interpolants (Q2891411) (← links)
- Weakly Equivalent Arrays (Q2964457) (← links)
- Refinement of Trace Abstraction (Q3392921) (← links)
- Fairness for Infinitary Control (Q3449624) (← links)
- Fairness for Dynamic Control (Q3557081) (← links)
- Kleene, Rabin, and Scott Are Available (Q3584949) (← links)
- (Q4654725) (← links)
- (Q4737563) (← links)
- (Q5016383) (← links)
- Linear Ranking for Linear Lasso Programs (Q5166700) (← links)
- Nested interpolants (Q5255103) (← links)
- Proof Tree Preserving Interpolation (Q5326320) (← links)
- Thread modularity at many levels: a pearl in compositional verification (Q5370882) (← links)
- FM 2005: Formal Methods (Q5716897) (← links)
