Travelled to:1 × Austria
1 × India
1 × Italy
1 × Russia
2 × USA
2 × United Kingdom
Collaborated with:M.Veanes R.Alur Q.Hu A.Albarghouthi S.Drews R.Singh M.Raghothaman G.Argyros B.Livshits D.Molnar M.Vaughn R.Samanta Kausik Subramanian A.Akella T.Ferreira M.Sammartino A.S.0001 A.V.Nori R.Pan Gaowei Xu P.Ohmann Alexander Brooks B.Liblit R.A.Cochran J.V.Deshmukh Y.Yuan J.Breck J.Cyphert T.W.Reps
Talks about:symbol (7) automata (6) program (6) transduc (5) synthesi (4) repair (4) regular (3) probabilist (2) synthes (2) quantit (2)
Person: Loris D'Antoni
DBLP: D'Antoni:Loris
Contributed to:
2015
2014
201420142013
2013
2013
2012
20172016201720182019
2017201920172017Wrote 24 papers:
- POPL-2015-AlurDR #declarative #named #string
- DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations (RA, LD, MR), pp. 125–137.
- POPL-2015-CochranDLMV #synthesis
- Program Boosting: Program Synthesis via Crowd-Sourcing (RAC, LD, BL, DM, MV), pp. 677–688.
- CAV-2014-DAntoniA #automaton
- Symbolic Visibly Pushdown Automata (LD, RA), pp. 209–225.
- PLDI-2014-DAntoniVLM #named #performance #transducer
- Fast: a transducer-based language for tree manipulation (LD, MV, BL, DM), p. 40.
- POPL-2014-DAntoniV #automaton
- Minimization of symbolic automata (LD, MV), pp. 541–554.
- CAV-2013-DAntoniV #equivalence #finite #transducer
- Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.
- LICS-2013-AlurDDRY #automaton
- Regular Functions and Cost Register Automata (RA, LD, JVD, MR, YY), pp. 13–22.
- VMCAI-2013-DAntoniV #static analysis #string
- Static Analysis of String Encoders and Decoders (LD, MV), pp. 209–228.
- ICALP-v2-2012-AlurD #streaming #transducer
- Streaming Tree Transducers (RA, LD), pp. 42–53.
- ESEC-FSE-2017-DAntoniSV #named
- NoFAQ: synthesizing command repairs from examples (LD, RS, MV), pp. 582–592.
- CAV-2016-DAntoniSS #named #program repair
- Qlose: Program Repair with Quantitative Objectives (LD, RS, RS), pp. 383–401.
- CAV-2017-AlbarghouthiDD #nondeterminism #source code
- Repairing Decision-Making Programs Under Uncertainty (AA, LD, SD), pp. 181–200.
- CAV-2017-DAntoniV #automaton #power of #transducer
- The Power of Symbolic Automata and Transducers (LD, MV), pp. 47–67.
- CAV-2018-ArgyrosD #automaton
- The Learnability of Symbolic Automata (GA, LD), pp. 427–445.
- CAV-2018-HuD #synthesis
- Syntax-Guided Synthesis with Quantitative Syntactic Objectives (QH, LD), pp. 386–403.
- CAV-2019-DAntoniFS0 #automaton
- Symbolic Register Automata (LD, TF, MS, AS0), pp. 3–21.
- CAV-2019-DrewsAD #constraints #performance #probability #synthesis
- Efficient Synthesis with Probabilistic Constraints (SD, AA, LD), pp. 278–296.
- CAV-2019-HuBCDR #proving #synthesis
- Proving Unrealizability for Syntax-Guided Synthesis (QH, JB, JC, LD, TWR), pp. 335–352.
- OOPSLA-2017-AlbarghouthiDDN #named #probability #verification
- FairSquare: probabilistic verification of program fairness (AA, LD, SD, AVN), p. 30.
- OOPSLA-2019-PanHXD #automation #regular expression
- Automatic repair of regular expressions (RP, QH, GX, LD), p. 29.
- PLDI-2017-HuD #automation #transducer #using
- Automatic program inversion using symbolic transducers (QH, LD), pp. 376–389.
- PLDI-2017-OhmannBDL #control flow
- Control-flow recovery from partial failure reports (PO, AB, LD, BL), pp. 390–405.
- POPL-2017-DAntoniV #finite #higher-order #logic #monad #sequence
- Monadic second-order logic on finite sequences (LD, MV), pp. 232–245.
- POPL-2017-SubramanianDA #multitenancy #named #network #overview
- Genesis: synthesizing forwarding tables in multi-tenant networks (KS, LD, AA), pp. 572–585.