The following pages link to Martin Vechev (Q681345):
Displaying 19 items.
- Effective abstractions for verification under relaxed memory models (Q681346) (← links)
- Scalable polyhedral verification of recurrent neural networks (Q832168) (← links)
- Learning a static analyzer from data (Q2151252) (← links)
- Network-wide configuration synthesis (Q2164228) (← links)
- Finding fix locations for CFL-reachability analyses via minimum cuts (Q2164256) (← links)
- Fast and optimal sequence-to-graph alignment guided by seeds (Q2170166) (← links)
- Fine-grained semantics for probabilistic programs (Q2323972) (← links)
- Efficient data race detection for async-finish parallelism (Q2441733) (← links)
- Predicting Program Properties from "Big Code" (Q2819795) (← links)
- Learning programs from noisy data (Q2828319) (← links)
- Automatic Verification of RMA Programs via Abstraction Extrapolation (Q3296321) (← links)
- Inferring Synchronization under Limited Observability (Q3617756) (← links)
- Automatic Verification of Determinism for Structured Parallel Programs (Q4930747) (← links)
- AStarix: Fast and Optimal Sequence-to-Graph Alignment (Q5041800) (← links)
- Effective Abstractions for Verification under Relaxed Memory Models (Q5172657) (← links)
- Verifying linearizability with hindsight (Q5176190) (← links)
- Abstraction-guided synthesis of synchronization (Q5255086) (← links)
- Fast polyhedra abstract domain (Q5370845) (← links)
- Laws of order (Q5408568) (← links)
