Loris D'Antoni
Loris D'Antoni

homepage
lorisatcs.wisc.edu

  Affiliation history
Bibliometrics: publication history
Average citations per article6.63
Citation Count199
Publication count30
Publication years2008-2017
Available for download20
Average downloads per article186.90
Downloads (cumulative)3,738
Downloads (12 Months)1,762
Downloads (6 Weeks)176
Professional ACM Member
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


30 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 30
Result page: 1 2

Sort by:

1 published by ACM
October 2017 Proceedings of the ACM on Programming Languages: Volume 1 Issue OOPSLA, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 17,   Downloads (12 Months): 52,   Downloads (Overall): 52

Full text available: PDFPDF
With the range and sensitivity of algorithmic decisions expanding at a break-neck speed, it is imperative that we aggressively investigate fairness and bias in decision-making programs. First, we show that a number of recently proposed formal definitions of fairness can be encoded as probabilistic program properties. Second, with the goal ...
Keywords: Probabilistic Inference, Probabilistic Programming, Algorithmic Fairness

2 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 5, October 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 107,   Downloads (Overall): 107

Full text available: PDFPDF
The theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically structured data such as XML documents. We introduce streaming tree transducers as an analyzable, executable, and expressive model for transforming unranked ordered trees (and forests) in a single ...
Keywords: Nested words, tree transducers

3 published by ACM
August 2017 ESEC/FSE 2017: Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 18,   Downloads (12 Months): 75,   Downloads (Overall): 75

Full text available: PDFPDF
Command-line tools are confusing and hard to use due to their cryptic error messages and lack of documentation. Novice users often resort to online help-forums for finding corrections to their buggy commands, but have a hard time in searching precisely for posts that are relevant to their problem and then ...
Keywords: Domain Specific Languages, Program Synthesis, Command Line Interface, Programming by Example, Program Repair

4
August 2017 IJCAI'17: Proceedings of the 26th International Joint Conference on Artificial Intelligence
Publisher: AAAI Press
Bibliometrics:
Citation Count: 0

Weighted model counting and integration (WMC/WMI) are natural problems to which we can reduce many probabilistic inference tasks, e.g., in Bayesian networks, Markov networks, and probabilistic programs. Typically, we are given a first-order formula, where each satisfying assignment is associated with a weight--e.g., a probability of occurrence--and our goal is ...

5 published by ACM
June 2017 PLDI 2017: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 133,   Downloads (Overall): 133

Full text available: PDFPDF
Debugging is difficult. When software fails in production, debugging is even harder, as failure reports usually provide only an incomplete picture of the failing execution. We present a system that answers control-flow queries posed by developers as formal languages, indicating whether the query expresses control flow that is possible or ...
Keywords: failure reporting, Deployed software
Also published in:
September 2017  ACM SIGPLAN Notices - PLDI '17: Volume 52 Issue 6, June 2017

6 published by ACM
June 2017 PLDI 2017: Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 7,   Downloads (12 Months): 91,   Downloads (Overall): 91

Full text available: PDFPDF
We propose a fully-automated technique for inverting functional programs that operate over lists such as string encoders and decoders. We consider programs that can be modeled using symbolic extended finite transducers (), an expressive model that can describe complex list-manipulating programs while retaining several decidable properties. Concretely, given a program ...
Keywords: Extended Symbolic Transducers, Program Inversion, Genic
Also published in:
September 2017  ACM SIGPLAN Notices - PLDI '17: Volume 52 Issue 6, June 2017

7
May 2017 ICSE '17: Proceedings of the 39th International Conference on Software Engineering
Publisher: IEEE Press
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 39,   Downloads (12 Months): 327,   Downloads (Overall): 327

Full text available: PDFPDF
Automatic program transformation tools can be valuable for programmers to help them with refactoring tasks, and for Computer Science students in the form of tutoring systems that suggest repairs to programming assignments. However, manually creating catalogs of transformations is complex and time-consuming. In this paper, we present R efazer , ...
Keywords: refactoring, program synthesis, program transformation, tutoring systems

8 published by ACM
May 2017 CHI EA '17: Proceedings of the 2017 CHI Conference Extended Abstracts on Human Factors in Computing Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 10,   Downloads (12 Months): 86,   Downloads (Overall): 86

Full text available: PDFPDF
For massive programming classrooms, recent advances in program synthesis offer means to automatically grade and debug student submissions, and generate feedback at scale. A key challenge for synthesis-based autograders is how to design personalized feedback for students that is as effective as manual feedback given by teachers today. To understand ...
Keywords: automated feedback, program synthesis, programming education

9 published by ACM
April 2017 [email protected] '17: Proceedings of the Fourth (2017) ACM Conference on Learning @ Scale
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 20,   Downloads (12 Months): 223,   Downloads (Overall): 223

Full text available: PDFPDF
In large introductory programming classes, teacher feedback on individual incorrect student submissions is often infeasible. Program synthesis techniques are capable of fixing student bugs and generating hints automatically, but they lack the deep domain knowledge of a teacher and can generate functionally correct but stylistically poor fixes. We introduce a ...
Keywords: program synthesis, programming education

10 published by ACM
January 2017 POPL 2017: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 3,   Downloads (12 Months): 99,   Downloads (Overall): 99

Full text available: PDFPDF
Operators in multi-tenant cloud datacenters require support for diverse and complex end-to-end policies, such as, reachability, middlebox traversals, isolation, traffic engineering, and network resource management. We present Genesis, a datacenter network management system which allows policies to be specified in a declarative manner without explicitly programming the network data plane. ...
Keywords: Software-defined networks, SMT, Network management
Also published in:
May 2017  ACM SIGPLAN Notices - POPL '17: Volume 52 Issue 1, January 2017

11 published by ACM
January 2017 POPL 2017: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 6,   Downloads (12 Months): 151,   Downloads (Overall): 151

Full text available: PDFPDF
We extend the weak monadic second-order logic of one successor on finite strings (M2L-STR) to symbolic alphabets by allowing character predicates to range over decidable quantifier free theories instead of finite alphabets. We call this logic, which is able to describe sequences over complex and potentially infinite domains, symbolic M2L-STR ...
Keywords: MSO logic, SWS1S, Symbolic automata
Also published in:
May 2017  ACM SIGPLAN Notices - POPL '17: Volume 52 Issue 1, January 2017

12 published by ACM
July 2016 LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 27,   Downloads (Overall): 38

Full text available: PDFPDF
Symbolic tree automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend finite tree automata to operate over infinite alphabets, such as the set of rational numbers. Existing tree automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic ...

13 published by ACM
October 2015 ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 38 Issue 1, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 4,   Downloads (12 Months): 64,   Downloads (Overall): 274

Full text available: PDFPDF
Tree automata and transducers are used in a wide range of applications in software engineering. While these formalisms are of immense practical use, they can only model finite alphabets. To overcome this problem we augment tree automata and transducers with symbolic alphabets represented as parametric theories. Admitting infinite alphabets makes ...
Keywords: FAST, Symbolic tree transducers

14
August 2015 Formal Methods in System Design: Volume 47 Issue 1, August 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 3

Symbolic finite automata and transducers augment classic automata and transducers with symbolic alphabets represented as parametric theories. This extension enables to succinctly represent large and potentially infinite alphabets while preserving closure and decidability properties. Extended symbolic finite automata and transducers further extend these objects by allowing transitions to read consecutive ...
Keywords: Symbolic automata, String encoders, Equivalence, Symbolic transducers

15 published by ACM
March 2015 ACM Transactions on Computer-Human Interaction (TOCHI) - Special Issue on Online Learning at Scale: Volume 22 Issue 2, April 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 14,   Downloads (12 Months): 95,   Downloads (Overall): 417

Full text available: PDFPDF
In computer-aided education, the goal of automatic feedback is to provide a meaningful explanation of students' mistakes. We focus on providing feedback for constructing a deterministic finite automaton that accepts strings that match a described pattern. Natural choices for feedback are binary feedback (correct/wrong) and a counterexample of a string ...
Keywords: automata, feedback, A/B study, Autograding

16 published by ACM
January 2015 POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 5,   Downloads (12 Months): 39,   Downloads (Overall): 224

Full text available: PDFPDF
We present DReX, a declarative language that can express all regular string-to string transformations, and can still be efficiently evaluated. The class of regular string transformations has a robust theoretical foundation including multiple characterizations, closure properties, and decidable analysis questions, and admits a number of string operations such as insertion, ...
Keywords: declarative languages, drex, string transformations
Also published in:
May 2015  ACM SIGPLAN Notices - POPL '15: Volume 50 Issue 1, January 2015

17 published by ACM
January 2015 POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Downloads (Overall): 254

Full text available: PDFPDF
In this paper, we investigate an approach to program synthesis that is based on crowd-sourcing. With the help of crowd-sourcing, we aim to capture the "wisdom of the crowds" to find good if not perfect solutions to inherently tricky programming tasks, which elude even expert developers and lack an easy-to-formalize ...
Keywords: crowd-sourcing, program synthesis, symbolic automata, regular expressions
Also published in:
May 2015  ACM SIGPLAN Notices - POPL '15: Volume 50 Issue 1, January 2015

18
July 2014 Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is a sequence of positions together with a matching relation that connects open tags (calls) with the corresponding close tags (returns). Visibly Pushdown Automata are a restricted class of pushdown ...
Keywords: symbolic automata, XML, visibly pushdown automata

19 published by ACM
June 2014 PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 33,   Downloads (Overall): 182

Full text available: PDFPDF
Tree automata and tree transducers are used in a wide range of applications in software engineering, from XML processing to language type-checking. While these formalisms are of immense practical use, they can only model finite alphabets, and since many real-world applications operate over infinite domains such as integers, this is ...
Keywords: FAST, symbolic tree transducers
Also published in:
June 2014  ACM SIGPLAN Notices - PLDI '14: Volume 49 Issue 6, June 2014

20 published by ACM
January 2014 POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 3,   Downloads (12 Months): 48,   Downloads (Overall): 333

Full text available: PDFPDF
Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic automata. We formally ...
Keywords: minimization, symbolic automata
Also published in:
January 2014  ACM SIGPLAN Notices - POPL '14: Volume 49 Issue 1, January 2014



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us