Loris D'Antoni

Orcid: 0000-0001-9625-4037

Affiliations:
  • University of Wisconsin-Madison, USA


According to our database1, Loris D'Antoni authored at least 82 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Verified Training for Counterfactual Explanation Robustness under Data Shift.
CoRR, 2024

Automating Unrealizability Logic: Hoare-style Proof Synthesis for Infinite Sets of Programs.
CoRR, 2024

2023
Synthesizing Specifications.
Proc. ACM Program. Lang., October, 2023

Proving Data-Poisoning Robustness in Decision Trees.
Commun. ACM, February, 2023

Unrealizability Logic.
Proc. ACM Program. Lang., January, 2023

PECAN: A Deterministic Certified Defense Against Backdoor Attacks.
CoRR, 2023

Verifying Infinitely Many Programs at Once.
Proceedings of the Static Analysis - 30th International Symposium, 2023

Learned Load Balancing.
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

Modular System Synthesis.
Proceedings of the Formal Methods in Computer-Aided Design, 2023

The Dataset Multiplicity Problem: How Unreliable Data Impacts Predictions.
Proceedings of the 2023 ACM Conference on Fairness, Accountability, and Transparency, 2023

2022
Solving Program Sketches with Large Integer Values.
ACM Trans. Program. Lang. Syst., 2022

Synthesizing abstract transformers.
Proc. ACM Program. Lang., 2022

Certifying Data-Bias Robustness in Linear Regression.
CoRR, 2022

P4BID: information flow control in p4.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

BagFlip: A Certified Defense Against Data Poisoning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Synthesizing Transducers from Complex Specifications.
Proceedings of the 22nd Formal Methods in Computer-Aided Design, 2022

2021
Semantics-guided synthesis.
Proc. ACM Program. Lang., 2021

Automata modulo theories.
Commun. ACM, 2021

D2R: Policy-Compliant Fast Reroute.
Proceedings of the SOSR '21: The ACM SIGCOMM Symposium on SDN Research, Virtual Event, USA, October 11, 2021

Prognosis: closed-box analysis of network protocol implementations.
Proceedings of the ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021., 2021

Learning Quick Fixes from Code Repositories.
Proceedings of the 35th Brazilian Symposium on Software Engineering, 2021

Certifying Robustness to Programmable Data Bias in Decision Trees.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Certified Robustness to Programmable Transformations in LSTMs.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

Synthesis with Asymptotic Resource Bounds.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Programmable Program Synthesis.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Detecting network load violations for distributed control planes.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Exact and approximate methods for proving unrealizability of syntax-guided synthesis problems.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Robustness to Programmable String Transformations via Augmented Abstract Training.
Proceedings of the 37th International Conference on Machine Learning, 2020

Solving Program Sketches with Large Integer Values.
Proceedings of the Programming Languages and Systems, 2020

Automata Tutor v3.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2019
Automatic repair of regular expressions.
Proc. ACM Program. Lang., 2019

D2R: Dataplane-Only Policy-Compliant Routing Under Failures.
CoRR, 2019

Direct Manipulation for Imperative Programs.
Proceedings of the Static Analysis - 26th International Symposium, 2019

Proving Unrealizability for Syntax-Guided Synthesis.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Efficient Synthesis with Probabilistic Constraints.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

Symbolic Register Automata.
Proceedings of the Computer Aided Verification - 31st International Conference, 2019

2018
Synthesis of Fault-Tolerant Distributed Router Configurations.
Proc. ACM Meas. Anal. Comput. Syst., 2018

A Symbolic Decision Procedure for Symbolic Alternating Finite Automata.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Program Repair via Direct State Manipulation.
CoRR, 2018

Learning Quick Fixes from Code Repositories.
CoRR, 2018

Syntax-Guided Synthesis with Quantitative Syntactic Objectives.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

The Learnability of Symbolic Automata.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
FairSquare: probabilistic verification of program fairness.
Proc. ACM Program. Lang., 2017

Streaming Tree Transducers.
J. ACM, 2017

Quantifying Program Bias.
CoRR, 2017

TraceDiff: Debugging unexpected code behavior using trace divergences.
Proceedings of the 2017 IEEE Symposium on Visual Languages and Human-Centric Computing, 2017

Learning Symbolic Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Forward Bisimulations for Nondeterministic Symbolic Finite Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

NoFAQ: synthesizing command repairs from examples.
Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, 2017

Genesis: synthesizing forwarding tables in multi-tenant networks.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Monadic second-order logic on finite sequences.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Control-flow recovery from partial failure reports.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Automatic program inversion using symbolic transducers.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Writing Reusable Code Feedback at Scale with Mixed-Initiative Program Synthesis.
Proceedings of the Fourth ACM Conference on Learning @ Scale, 2017

Weighted Model Integration with Orthogonal Transformations.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Learning syntactic program transformations from examples.
Proceedings of the 39th International Conference on Software Engineering, 2017

Exploring the Design Space of Automatically Synthesized Hints for Introductory Programming Assignments.
Proceedings of the 2017 CHI Conference on Human Factors in Computing Systems, 2017

The Power of Symbolic Automata and Transducers.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

Repairing Decision-Making Programs Under Uncertainty.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Fairness as a Program Property.
CoRR, 2016

HARE: Hardware accelerator for regular expressions.
Proceedings of the 49th Annual IEEE/ACM International Symposium on Microarchitecture, 2016

Minimization of Symbolic Tree Automata.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Qlose: Program Repair with Quantitative Objectives.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2015
Fast: A Transducer-Based Language for Tree Manipulation.
ACM Trans. Program. Lang. Syst., 2015

How Can Automatic Feedback Help Students Construct Automata?
ACM Trans. Comput. Hum. Interact., 2015

Extended symbolic finite automata and transducers.
Formal Methods Syst. Des., 2015

Automata Tutor and what we learned from building an online teaching tool.
Bull. EATCS, 2015

Program Boosting: Program Synthesis via Crowd-Sourcing.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

DReX: A Declarative Language for Efficiently Evaluating Regular String Transformations.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Symbolic WS1S.
Proceedings of the 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, 2015

2014
Minimization of symbolic automata.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Symbolic Visibly Pushdown Automata.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

2013
High-performance complex event processing over hierarchical data.
ACM Trans. Database Syst., 2013

Static Analysis of String Encoders and Decoders.
Proceedings of the Verification, 2013

Regular Functions and Cost Register Automata.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Automated Grading of DFA Constructions.
Proceedings of the IJCAI 2013, 2013

Sensitivity analysis using type-based constraints.
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages, 2013

Operating System Support for Augmented Reality Applications.
Proceedings of the 14th Workshop on Hot Topics in Operating Systems, 2013

Equivalence of Extended Symbolic Finite Transducers.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
In the Maze of Data Languages
CoRR, 2012

2011
Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems
CoRR, 2011

2008
Global Progress in Dynamically Interleaved Multiparty Sessions.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008


  Loading...