Dr Peter Schachte

  • Room: Level: 08 Room: 8.15
  • Building: Doug McDonell Building
  • Campus: Parkville

Research interests

  • Programming Languages (Program Verification, Program Analysis, Programming Language Design, Declarative Programming)

Personal webpage

http://people.eng.unimelb.edu.au/schachte/

Biography

Dr Peter Schachte is a Senior Lecturer in the School of Computing and Information Systems at The University of Melbourne.

Dr Schachte has been involved in programming language research and development since the 1980s. From 1985 to 1993 he worked for Quintus Corporation, where he designed and implemented many parts of the company's Prolog language runtime system, development environments, graphics interfaces, object-oriented extenstions, and applications.
 
In his research, Dr Schachte has concentrated on static and dynamic analysis of software, as well as the design and implementation of programming languages. He built an efficient groundness analyser for Prolog and concentrated on improving its performance by designing and implementing new algorithms and data structures.  He has also worked to improve programming language expressiveness, extending the Mercury compiler to allow the development of purely declarative software components with efficient imperative implementations. To Prolog, he added the ability to manipulate global state in a declarative way, and to use universal quantification as a flexible declarative looping facility. In collaboration with research students, he investigated secure network protocols, aspect-oriented programming, static checking of program binaries, the design and implementation of a purely declarative imperative programming language, automatic parallelisation of  declarative programs, and improved automatic memory management.

Recent publications

  1. De Una, D.; Gange, G.; Schachte, P.; Stuckey, PJ. Compiling CP subproblems to MDDs and d-DNNFs. Constraints. SPRINGER. 2019, Vol. 24, Issue 1, pp. 56-93. DOI: 10.1007/s10601-018-9297-2
  2. Amadini, R.; Andrlon, M.; Gange, G.; Schachte, P.; Søndergaard, H.; Stuckey, PJ. Constraint Programming for Dynamic Symbolic Execution of JavaScript. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer. 2019, Vol. 11494 LNCS, pp. 1-19. DOI: 10.1007/978-3-030-19212-9_1
  3. Kafle, B.; Gallagher, JP.; Gange, G.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. An iterative approach to precondition inference using constrained Horn clauses. Theory and Practice of Logic Programming. CAMBRIDGE UNIV PRESS. 2018, Vol. 18, Issue 3-4, pp. 553-570. DOI: 10.1017/S1471068418000091
  4. De Uña, D.; Rümmele, N.; Gange, G.; Schachte, P.; Stuckey, PJ. Machine learning and constraint programming for relational-to-ontology schema mapping. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence. 2018, Vol. 2018-July, pp. 1277-1283. DOI: 10.24963/ijcai.2018/178
  5. Amadini, R.; Gange, G.; Gauthier, F.; Jordan, A.; Schachte, P.; Sondergaard, H.; Stuckey, PJ.; Zhang, C. Reference Abstract Domains and Applications to String Analysis. Fundamenta Informaticae. IOS PRESS. 2018, Vol. 158, Issue 4, pp. 297-326. DOI: 10.3233/FI-2018-1650
  6. Kafle, B.; Gange, G.; Schachte, P.; Søndergaard, H.; Stuckey, PJ. A benders decomposition approach to deciding modular linear integer arithmetic. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer. 2017, Vol. 10491 LNCS, pp. 380-397. DOI: 10.1007/978-3-319-66263-3_24
  7. Amadini, R.; Jordan, A.; Gange, G.; Gauthier, F.; Schachte, P.; Sondergaard, H.; Stuckey, PJ.; Zhang, C. Combining String Abstract Domains for JavaScript Analysis: An Evaluation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). SPRINGER INTERNATIONAL PUBLISHING AG. 2017, Vol. 10205, pp. 41-57. DOI: 10.1007/978-3-662-54577-5_3
  8. De Una, D.; Gange, G.; Schachte, P.; Stuckey, PJ. Minimizing Landscape Resistance for Habitat Conservation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). SPRINGER INTERNATIONAL PUBLISHING AG. 2017, Vol. 10335, pp. 113-130. DOI: 10.1007/978-3-319-59776-8_10
  9. De Uña, D.; Gange, G.; Schachte, P.; Stuckey, PJ. A bounded path propagator on directed graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2016, Vol. 9892 LNCS, pp. 189-206. DOI: 10.1007/978-3-319-44953-1_13
  10. Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. A complete refinement procedure for regular separability of context-free languages. Theoretical Computer Science. ELSEVIER SCIENCE BV. 2016, Vol. 625, pp. 1-24. DOI: 10.1016/j.tcs.2016.01.026
  11. Naish, L.; Schachte, P.; Macnally, AM. Adtpp: lightweight efficient safe polymorphic algebraic data types for C. Software: Practice and Experience. Wiley: 12 months. 2016, Vol. 46, Issue 12, pp. 1685-1703. DOI: 10.1002/spe.2407
  12. Gange, G.; Navas Laserna, J.; Schachte, P.; Sondergaard, H.; Stuckey, P. An abstract domain of uninterpreted functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin Heidelberg. 2016, Vol. LNCS 9583, pp. 85-103. DOI: 10.1007/978-3-662-49122-5
  13. Gange, G.; Navas, JA.; Schachte, P.; Søndergaard, H.; Stuckey, PJ. An Abstract Domain of Uninterpreted Functions. . Springer Berlin Heidelberg. 2016, pp. 85-103. DOI: 10.1007/978-3-662-49122-5_4
  14. Gange, G.; Navas, J.; Schachte, P.; Sondergaard, H.; Stuckey, P. Exploiting Sparsity in Difference-Bound Matrices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin Heidelberg. 2016, Vol. 9837, pp. 189-211. DOI: 10.1007/978-3-662-53413-7_10
  15. De Una, D.; Gange, G.; Schachte, P.; Stuckey, P. Steiner Tree Problems with Side Constraints Using Constraint Programming. 30th AAAI Conference on Artificial Intelligence, AAAI 2016. AAAI. 2016, pp. 3383-3389.
  16. De Uña, D.; Gange, G.; Schachte, P.; Stuckey, PJ. Weighted Spanning Tree Constraint with Explanations. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2016, Vol. LNCS 9676, pp. 98-107. DOI: 10.1007/978-3-319-33954-2_8
  17. Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. A tool for intersecting context-free grammars and its applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2015, Vol. 9058, pp. 422-428. DOI: 10.1007/978-3-319-17524-9_31
  18. Cornish, JRM.; Gange, G.; Navas, JA.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. Analyzing Array Manipulating Programs by Program Transformation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer International Publishing. 2015, Vol. 8981, pp. 3-20. DOI: 10.1007/978-3-319-17822-6_1
  19. Kyprianou, R.; Schachte, P.; Moran, B. Dauphin: A signal processing language -- statistical signal processing made easy. 2015 International Conference on Digital Image Computing: Techniques and Applications (DICTA). IEEE. 2015. DOI: 10.1109/DICTA.2015.7371250
  20. Gange, G.; Navas Laserna, J.; Schachte, P.; Sondergaard, H.; Stuckey, PJ. Horn Clauses As an Intermediate Representation for Program Analysis and Transformation. Theory and Practice of Logic Programming. Cambridge University Press. 2015, Vol. 15, Issue 4-5, pp. 526-542. DOI: 10.1017/S1471068415000204

View a full list of publications on the University of Melbourne’s ‘Find An Expert’ profile