Travelled to:
2 × Austria
Collaborated with:
F.Bacchus L.Ryzhyk A.Legg A.Ignatiev F.Pereira J.M.0001 A.Walker Elazar Gershuni N.Amit A.Gurfinkel J.A.Navas N.Rinetzky M.Sagiv
Talks about:
base (3) sat (3) analysi (2) core (2) counterexampl (1) predecessor (1) algorithm (1) synthesi (1) approach (1) without (1)
Person: Nina Narodytska
DBLP: Narodytska:Nina
Contributed to:
Wrote 5 papers:
- CAV-2014-NarodytskaLBRW #game studies
- Solving Games without Controllable Predecessor (NN, AL, FB, LR, AW), pp. 533–540.
- SAT-2014-BacchusN #algorithm #analysis #satisfiability
- Cores in Core Based MaxSat Algorithms: An Analysis (FB, NN), pp. 7–15.
- CAV-2016-LeggNR #bound #satisfiability #synthesis
- A SAT-Based Counterexample Guided Method for Unbounded Synthesis (AL, NN, LR), pp. 364–382.
- IJCAR-2018-IgnatievPNM #approach #satisfiability #set
- A SAT-Based Approach to Learn Explainable Decision Sets (AI, FP, NN, JMS0), pp. 627–645.
- PLDI-2019-GershuniAGNNRRS #kernel #linux #precise #static analysis
- Simple and precise static analysis of untrusted Linux kernel extensions (EG, NA, AG, NN, JAN, NR, LR, MS), pp. 1069–1084.