Pages that link to "Item:Q746774"
From MaRDI portal
The following pages link to Under-approximating loops in C programs for fast counterexample detection (Q746774):
Displaying 7 items.
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- On the complexity of the quantified bit-vector arithmetic with binary encoding (Q1708270) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Lower Runtime Bounds for Integer Programs (Q2817952) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
- Proving Safety with Trace Automata and Bounded Model Checking (Q5206955) (← links)
- Transition power abstractions for deep counterexample detection (Q6535576) (← links)