Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2018
Automated clustering and program repair for introductory programming assignments
PLDI 2018: Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2018, Pages 465–480https://doi.org/10.1145/3192366.3192387Providing feedback on programming assignments is a tedious task for the instructor, and even impossible in large Massive Open Online Courses with thousands of students. Previous research has suggested that program repair techniques can be used to ...
Also Published in:
ACM SIGPLAN Notices: Volume 53 Issue 4, April 2018 - research-articleJune 2015
FlashRelate: extracting relational data from semi-structured spreadsheets using examples
PLDI '15: Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2015, Pages 218–228https://doi.org/10.1145/2737924.2737952With hundreds of millions of users, spreadsheets are one of the most important end-user applications. Spreadsheets are easy to use and allow users great flexibility in storing data. This flexibility comes at a price: users often treat spreadsheets as a ...
Also Published in:
ACM SIGPLAN Notices: Volume 50 Issue 6, June 2015 - research-articleJune 2014
FlashExtract: a framework for data extraction by examples
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2014, Pages 542–553https://doi.org/10.1145/2594291.2594333Various document types that combine model and view (e.g., text files, webpages, spreadsheets) make it easy to organize (possibly hierarchical) data, but make it difficult to extract raw data for any further manipulation or querying. We present a general ...
Also Published in:
ACM SIGPLAN Notices: Volume 49 Issue 6, June 2014 - research-articleJune 2014
Test-driven synthesis
PLDI '14: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2014, Pages 408–418https://doi.org/10.1145/2594291.2594297Programming-by-example technologies empower end-users to create simple programs merely by providing input/output examples. Existing systems are designed around solvers specialized for a specific set of data types or domain-specific language (DSL). We ...
Also Published in:
ACM SIGPLAN Notices: Volume 49 Issue 6, June 2014 - research-articleJune 2013
Automated feedback generation for introductory programming assignments
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2013, Pages 15–26https://doi.org/10.1145/2491956.2462195We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that ...
Also Published in:
ACM SIGPLAN Notices: Volume 48 Issue 6, June 2013 - research-articleJune 2013
Static analysis for probabilistic programs: inferring whole program properties from finitely many paths
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2013, Pages 447–458https://doi.org/10.1145/2491956.2462179We propose an approach for the static analysis of probabilistic programs that sense, manipulate, and control based on uncertain data. Examples include programs used in risk analysis, medical decision making and cyber-physical systems. Correctness ...
Also Published in:
ACM SIGPLAN Notices: Volume 48 Issue 6, June 2013 - research-articleJune 2012
Type-directed completion of partial expressions
PLDI '12: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2012, Pages 275–286https://doi.org/10.1145/2254064.2254098Modern programming frameworks provide enormous libraries arranged in complex structures, so much so that a large part of modern programming is searching for APIs that surely exist" somewhere in an unfamiliar part of the framework. We present a novel way ...
Also Published in:
ACM SIGPLAN Notices: Volume 47 Issue 6, June 2012 - research-articleJune 2011
Path-based inductive synthesis for program inversion
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 492–503https://doi.org/10.1145/1993498.1993557In this paper, we investigate the problem of semi-automated inversion of imperative programs, which has the potential to make it much easier and less error prone to write programs that naturally pair as inverses, such as insert/delete operations, ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2011
Spreadsheet table transformations from examples
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 317–328https://doi.org/10.1145/1993498.1993536Every day, millions of computer end-users need to perform tasks over large, tabular data, yet lack the programming knowledge to do such tasks automatically. In this work, we present an automatic technique that takes from a user an example of how the ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2011
Synthesis of loop-free programs
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 62–73https://doi.org/10.1145/1993498.1993506We consider the problem of synthesizing loop-free programs that implement a desired functionality using components from a given library. Specifications of the desired functionality and the library components are provided as logical relations between ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2011
Synthesizing geometry constructions
PLDI '11: Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2011, Pages 50–61https://doi.org/10.1145/1993498.1993505In this paper, we study the problem of automatically solving ruler/compass based geometry construction problems. We first introduce a logic and a programming language for describing such constructions and then phrase the automation problem as a program ...
Also Published in:
ACM SIGPLAN Notices: Volume 46 Issue 6, June 2011 - research-articleJune 2010
The reachability-bound problem
PLDI '10: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2010, Pages 292–304https://doi.org/10.1145/1806596.1806630We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in terms of the inputs to that procedure. This has applications in bounding ...
Also Published in:
ACM SIGPLAN Notices: Volume 45 Issue 6, June 2010 - research-articleJune 2009
Control-flow refinement and progress invariants for bound analysis
PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2009, Pages 375–385https://doi.org/10.1145/1542476.1542518Symbolic complexity bounds help programmers understand the performance characteristics of their implementations. Existing work provides techniques for statically determining bounds of procedures with simple control-flow. However, procedures with nested ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 6, June 2009 - research-articleJune 2009
Program verification using templates over predicate abstraction
PLDI '09: Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2009, Pages 223–234https://doi.org/10.1145/1542476.1542501We address the problem of automatically generating invariants with quantified and boolean structure for proving the validity of given assertions or generating pre-conditions under which the assertions are valid. We present three novel algorithms, having ...
Also Published in:
ACM SIGPLAN Notices: Volume 44 Issue 6, June 2009 - research-articleJune 2008
Inferring locks for atomic sections
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 304–315https://doi.org/10.1145/1375581.1375619Atomic sections are a recent and popular idiom to support the development of concurrent programs. Updates performed within an atomic section should not be visible to other threads until the atomic section has been executed entirely. Traditionally, ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - research-articleJune 2008
Program analysis as constraint solving
PLDI '08: Proceedings of the 29th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2008, Pages 281–292https://doi.org/10.1145/1375581.1375616A constraint-based approach to invariant generation in programs translates a program into constraints that are solved using off-the-shelf constraint solvers to yield desired program invariants.
In this paper we show how the constraint-based approach can ...
Also Published in:
ACM SIGPLAN Notices: Volume 43 Issue 6, June 2008 - ArticleJune 2006
Combining abstract interpreters
PLDI '06: Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and ImplementationJune 2006, Pages 376–386https://doi.org/10.1145/1133981.1134026We present a methodology for automatically combining abstract interpreters over given lattices to construct an abstract interpreter for the combination of those lattices. This lends modularity to the process of design and implementation of abstract ...
Also Published in:
ACM SIGPLAN Notices: Volume 41 Issue 6, June 2006