var bibbase_data = {"data":"<img src=\"//bibbase.org/img/ajax-loader.gif\" id=\"spinner\"\n  style=\"display: none;\" alt=\"Loading..\" />\n\n<div id=\"bibbase\">\n\n  <script type=\"text/javascript\">\n    var bibbase = {\n      params: {\"bib\":\"people.eng.unimelb.edu.au/harald/bibbase.bib\",\"jsonp\":\"1\",\"theme\":\"dividers\",\"host\":\"bibbase.org\",\"ssl\":false},\n      data: [{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Eman\"],\"propositions\":[],\"lastnames\":[\"Alatawi\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Using Metamorphic Testing to Improve Dynamic Symbolic Execution\",\"booktitle\":\"Proceedings of the 24th Australasian Software Engineering Conference (ASWEC 2015)\",\"pages\":\"38–47\",\"publisher\":\"IEEE Computing Society\",\"year\":\"2015\",\"doi\":\"10.1109/ASWEC.2015.16\",\"abstract\":\"Dynamic symbolic execution (DSE) is an approach for automatically generating test inputs from source code using constraint information. It is used in \\\\emphfuzzing: the execution of tests while monitoring for generic properties such as buffer overflows and other security violations. Limitations of DSE for fuzzing are two-fold: (1) only generic properties are checked: many deviations from specified behaviour are not found; and (2) many programs are not entirely amenable to DSE because they give rise to hard constraints, so that some parts of a program remain uncovered. In this paper, we discuss how to mitigate these problems using \\\\emphmetamorphic testing (MT). Metamorphic testing uses domain-specific properties about program behaviour, relating pairs of inputs to pairs of outputs. From a given test suite, \\\\emphfollow-up tests inputs are generated, and their outputs are compared to outputs from the original tests, using \\\\emphmetamorphic relations. Our hypothesis is that using metamorphic testing increases the ability of a DSE test suite to find faults, and that the follow-up tests execute some previously-uncovered segments. We have experimented with seven small but non-trivial libraries, comparing DSE test suites with DSE+MT test suites, demonstrating that DSE+MT test suites improve coverage marginally, but find more faults.\",\"keywords\":\"Symbolic execution, Testing\",\"bibtex\":\"@inproceedings{Ala-Mil-Son_ASWEC15,\\n  author    = {Eman Alatawi and \\n\\t\\tTim Miller and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Using Metamorphic Testing to Improve Dynamic Symbolic Execution},\\n  booktitle = {Proceedings of the 24th Australasian Software Engineering\\n                Conference (ASWEC 2015)},\\n  pages     = {38--47},\\n  publisher = {IEEE Computing Society},\\n  year      = {2015},\\n  doi       = {10.1109/ASWEC.2015.16},\\n  abstract  = {Dynamic symbolic execution (DSE) is an approach for automatically\\n\\t\\tgenerating test inputs from source code using constraint \\n\\t\\tinformation. It is used in \\\\emph{fuzzing}: the execution of \\n\\t\\ttests while monitoring for generic properties such as buffer \\n\\t\\toverflows and other security violations. Limitations of DSE for\\n\\t\\tfuzzing are two-fold: (1) only generic properties are checked: \\n\\t\\tmany deviations from specified behaviour are not found; and \\n\\t\\t(2) many programs are not entirely amenable to DSE because they\\n\\t\\tgive rise to hard constraints, so that some parts of a program \\n\\t\\tremain uncovered. In this paper, we discuss how to mitigate \\n\\t\\tthese problems using \\\\emph{metamorphic testing} (MT). \\n\\t\\tMetamorphic testing uses domain-specific properties about \\n\\t\\tprogram behaviour, relating pairs of inputs to pairs of outputs.\\n\\t\\tFrom a given test suite, \\\\emph{follow-up tests inputs} are \\n\\t\\tgenerated, and their outputs are compared to outputs from the \\n\\t\\toriginal tests, using \\\\emph{metamorphic relations}. Our \\n\\t\\thypothesis is that using metamorphic testing increases the \\n\\t\\tability of a DSE test suite to find faults, and that the \\n\\t\\tfollow-up tests execute some previously-uncovered segments. \\n\\t\\tWe have experimented with seven small but non-trivial libraries,\\n\\t\\tcomparing DSE test suites with DSE+MT test suites, demonstrating\\n\\t\\tthat DSE+MT test suites improve coverage marginally, but find \\n\\t\\tmore faults.},\\n  keywords  = {Symbolic execution, Testing},\\n}\\n\\n\",\"author_short\":[\"Alatawi, E.\",\"Miller, T.\",\"Søndergaard, H.\"],\"key\":\"Ala-Mil-Son_ASWEC15\",\"id\":\"Ala-Mil-Son_ASWEC15\",\"bibbaseid\":\"alatawi-miller-sndergaard-usingmetamorphictestingtoimprovedynamicsymbolicexecution-2015\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Symbolic execution\",\"Testing\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Eman\"],\"propositions\":[],\"lastnames\":[\"Alatawi\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Symbolic Execution with Invariant Inlay: Evaluating the Potential\",\"booktitle\":\"Proceedings of the 25th Australasian Software Engineering Conference (ASWEC 2018)\",\"pages\":\"26–30\",\"publisher\":\"IEEE Computing Society\",\"year\":\"2018\",\"doi\":\"10.1109/ASWEC.2018.00012\",\"url_paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve\",\"abstract\":\"Dynamic symbolic execution (DSE) is a non-standard execution mechanism which, loosely, executes a program symbolically and, simultaneously, on concrete input. DSE is attractive because of several uses in software engineering, including the generation of test data suites with large coverage relative to test suite size. However, DSE struggles in the face of execution path explosion, and is often unable to cover certain kinds of difficult-to-reach program points. Invariant inlay is a technique that aims to improve a DSE tool by interspersing code with invariants, generated automatically using off-the-shelf tools for static program analysis. To capitalise fully on a static analyzer, invariant inlay first applies certain testability transformations to the program source. In this paper we account for how we have evaluated the idea experimentally, in order to determine its usefulness for programs with complex control flow.\",\"keywords\":\"Symbolic execution, Static analysis\",\"bibtex\":\"@inproceedings{Ala-Mil-Son_ASWEC18,\\n  author    = {Eman Alatawi and \\n\\t\\tTim Miller and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Symbolic Execution with Invariant Inlay:\\n                Evaluating the Potential},\\n  booktitle = {Proceedings of the 25th Australasian Software Engineering\\n                Conference (ASWEC 2018)},\\n  pages     = {26--30},\\n  publisher = {IEEE Computing Society},\\n  year      = {2018},\\n  doi       = {10.1109/ASWEC.2018.00012},\\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve},\\n  abstract  = {Dynamic symbolic execution (DSE) is a non-standard execution \\n\\t\\tmechanism which, loosely, executes a program symbolically and, \\n\\t\\tsimultaneously, on concrete input. DSE is attractive because of\\n\\t\\tseveral uses in software engineering, including the generation\\n\\t\\tof test data suites with large coverage relative to test suite\\n\\t\\tsize. However, DSE struggles in the face of execution path \\n\\t\\texplosion, and is often unable to cover certain kinds of \\n\\t\\tdifficult-to-reach program points. Invariant inlay is a \\n\\t\\ttechnique that aims to improve a DSE tool by interspersing code\\n\\t\\twith invariants, generated automatically using off-the-shelf \\n\\t\\ttools for static program analysis. To capitalise fully on a \\n\\t\\tstatic analyzer, invariant inlay first applies certain \\n\\t\\ttestability transformations to the program source. In this \\n\\t\\tpaper we account for how we have evaluated the idea \\n\\t\\texperimentally, in order to determine its usefulness for\\n\\t\\tprograms with complex control flow.},\\n  keywords  = {Symbolic execution, Static analysis},\\n}\\n\\n\",\"author_short\":[\"Alatawi, E.\",\"Miller, T.\",\"Søndergaard, H.\"],\"key\":\"Ala-Mil-Son_ASWEC18\",\"id\":\"Ala-Mil-Son_ASWEC18\",\"bibbaseid\":\"alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve\"},\"keyword\":[\"Symbolic execution\",\"Static analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Eman\"],\"propositions\":[],\"lastnames\":[\"Alatawi\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Generating Source Inputs for Metamorphic Testing Using Dynamic Symbolic Execution\",\"booktitle\":\"MET'16: Proceedings of the First International Workshop on Metamorphic Testing\",\"pages\":\"19–25\",\"publisher\":\"ACM\",\"year\":\"2016\",\"doi\":\"10.1145/2896971.2896980\",\"isbn\":\"978-1-4503-4163-9\",\"abstract\":\"Metamorphic testing uses domain-specific properties about a program's intended behaviour to alleviate the oracle problem. From a given set of source test inputs, a set of follow-up test inputs are generated which have some relation to the source inputs, and their outputs are compared to outputs from the source tests, using metamorphic relations. We evaluate the use of an automated test input generation technique called dynamic symbolic execution (DSE) to generate the source test inputs for metamorphic testing. We investigate whether DSE increases source-code coverage and fault finding effectiveness of metamorphic testing compared to the use of random testing, and whether the use of metamorphic relations as a supportive technique improves the test inputs generated by DSE. Our results show that DSE improves the coverage and fault detection rate of metamorphic testing compared to random testing using significantly smaller test suites, and the use of metamorphic relations increases code coverage of both DSE and random tests considerably, but the improvement in the fault detection rate may be marginal and depends on the used metamorphic relations.\",\"keywords\":\"Symbolic execution, Testing\",\"bibtex\":\"@inproceedings{Ala-Mil-Son_MET16,\\n  author    = {Eman Alatawi and \\n\\t\\tTim Miller and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Generating Source Inputs for Metamorphic Testing\\n                Using Dynamic Symbolic Execution},\\n  booktitle = {MET'16: Proceedings of the First International Workshop on\\n                Metamorphic Testing},\\n  pages     = {19--25},\\n  publisher = {ACM},\\n  year      = {2016},\\n  doi       = {10.1145/2896971.2896980},\\n  isbn      = {978-1-4503-4163-9},\\n  abstract  = {Metamorphic testing uses domain-specific properties about\\n                a program's intended behaviour to alleviate the oracle\\n                problem. From a given set of source test inputs, a set of\\n                follow-up test inputs are generated which have some\\n                relation to the source inputs, and their outputs are\\n                compared to outputs from the source tests, using\\n                metamorphic relations.  We evaluate the use of an\\n                automated test input generation technique called dynamic\\n                symbolic execution (DSE) to generate the source test\\n                inputs for metamorphic testing. We investigate whether\\n                DSE increases source-code coverage and fault finding\\n                effectiveness of metamorphic testing compared to the use\\n                of random testing, and whether the use of metamorphic\\n                relations as a supportive technique improves the test\\n                inputs generated by DSE. Our results show that DSE\\n                improves the coverage and fault detection rate of\\n                metamorphic testing compared to random testing using\\n                significantly smaller test suites, and the use of\\n                metamorphic relations increases code coverage of both\\n                DSE and random tests considerably, but the improvement\\n                in the fault detection rate may be marginal and depends\\n                on the used metamorphic relations.},\\n  keywords  = {Symbolic execution, Testing},\\n}\\n\\n\",\"author_short\":[\"Alatawi, E.\",\"Miller, T.\",\"Søndergaard, H.\"],\"key\":\"Ala-Mil-Son_MET16\",\"id\":\"Ala-Mil-Son_MET16\",\"bibbaseid\":\"alatawi-miller-sndergaard-generatingsourceinputsformetamorphictestingusingdynamicsymbolicexecution-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Symbolic execution\",\"Testing\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Eman\"],\"propositions\":[],\"lastnames\":[\"Alatawi\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]}],\"title\":\"Leveraging Abstract Interpretation for Efficient Dynamic Symbolic Execution\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Rosu\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Di Penta\"],\"suffixes\":[]},{\"firstnames\":[\"T.\",\"N.\"],\"propositions\":[],\"lastnames\":[\"Nguyen\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 32nd ACM/IEEE International Conference on Automated Software Engineering\",\"pages\":\"619–624\",\"publisher\":\"IEEE Computing Society\",\"year\":\"2017\",\"doi\":\"10.1109/ASE.2017.8115672\",\"url_paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve\",\"abstract\":\"Dynamic Symbolic Execution (DSE) is a technique to automatically generate test inputs by executing the program simultaneously with concrete and symbolic values. A key challenge in DSE is scalability, as executing all feasible program paths is not possible, owing to the possibly exponential or infinite number of program paths. Loops, in particular those where the number of iterations depends on an input of the program, are a source of path explosion. They cause problems because DSE maintains symbolic values that capture only the data dependencies on symbolic inputs. This ignores control dependencies, including loop dependencies that depend indirectly on the inputs. We propose a method to increase the coverage achieved by DSE in the presence of input-data dependent loops and loop dependent branches. We combine DSE with abstract interpretation to find indirect control dependencies, including loop and branch indirect dependencies. Preliminary results show that this results in better coverage, within considerably less time compared to standard DSE.\",\"keywords\":\"Symbolic execution, Static analysis, Abstract interpretation\",\"bibtex\":\"@inproceedings{Ala-Son-Mil_ASE17,\\n  author    = {Eman Alatawi and \\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tTim Miller},\\n  title     = {Leveraging Abstract Interpretation for Efficient Dynamic \\n\\t\\tSymbolic Execution},\\n  editor    = {G. Rosu and  M. {Di Penta} and T. N. Nguyen},\\n  booktitle = {Proceedings of the 32nd ACM/IEEE International Conference on \\n\\t\\tAutomated Software Engineering},\\n  pages     = {619--624},\\n  publisher = {IEEE Computing Society},\\n  year      = {2017},\\n  doi       = {10.1109/ASE.2017.8115672},\\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve},\\n  abstract  = {Dynamic Symbolic Execution (DSE) is a technique to automatically\\n\\t\\tgenerate test inputs by executing the program simultaneously \\n\\t\\twith concrete and symbolic values. A key challenge in DSE is \\n\\t\\tscalability, as executing all feasible program paths is not \\n\\t\\tpossible, owing to the possibly exponential or infinite number \\n\\t\\tof program paths. Loops, in particular those where the number \\n\\t\\tof iterations depends on an input of the program, are a source \\n\\t\\tof path explosion. They cause problems because DSE maintains \\n\\t\\tsymbolic values that capture only the data dependencies on\\n\\t\\tsymbolic inputs. This ignores control dependencies, including \\n\\t\\tloop dependencies that depend indirectly on the inputs. We \\n\\t\\tpropose a method to increase the coverage achieved by DSE in \\n\\t\\tthe presence of input-data dependent loops and loop dependent \\n\\t\\tbranches. We combine DSE with abstract interpretation to find \\n\\t\\tindirect control dependencies, including loop and branch \\n\\t\\tindirect dependencies. Preliminary results show that this \\n\\t\\tresults in better coverage, within considerably less time \\n\\t\\tcompared to standard DSE.},\\n  keywords  = {Symbolic execution, Static analysis, Abstract interpretation},\\n}\\n\\n\",\"author_short\":[\"Alatawi, E.\",\"Søndergaard, H.\",\"Miller, T.\"],\"editor_short\":[\"Rosu, G.\",\"Di Penta, M.\",\"Nguyen, T. N.\"],\"key\":\"Ala-Son-Mil_ASE17\",\"id\":\"Ala-Son-Mil_ASE17\",\"bibbaseid\":\"alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017\",\"role\":\"author\",\"urls\":{\" paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve\"},\"keyword\":[\"Symbolic execution\",\"Static analysis\",\"Abstract interpretation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Mak\"],\"propositions\":[],\"lastnames\":[\"Andrlon\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Constraint Programming for Dynamic Symbolic Execution of JavaScript\",\"editor\":[{\"firstnames\":[\"L.-M.\"],\"propositions\":[],\"lastnames\":[\"Rousseau\"],\"suffixes\":[]},{\"firstnames\":[\"K.\"],\"propositions\":[],\"lastnames\":[\"Stergiou\"],\"suffixes\":[]}],\"booktitle\":\"Integration of Constraint Programming, Artificial Intelligence, and Operations Research: Proceedings of the 16th International Conference (CPAIOR 2019)\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"11494\",\"pages\":\"1–19\",\"year\":\"2019\",\"doi\":\"10.1007/978-3-030-19212-9_1\",\"url_paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve\",\"abstract\":\"Dynamic Symbolic Execution (DSE) combines concrete and symbolic execution, usually for the purpose of generating good test suites automatically. It relies on constraint solvers to solve path conditions and to generate new inputs to explore. DSE tools usually make use of SMT solvers for constraint solving. In this paper, we show that constraint programming (CP) is a powerful alternative or complementary technique for DSE. Specifically, we apply CP techniques for DSE of JavaScript, the de facto standard for web programming. We capture the JavaScript semantics with MiniZinc and integrate this approach into a tool we call \\\\textscAratha. We use \\\\textscG-Strings, a CP solver equipped with string variables, for solving path conditions, and we compare the performance of this approach against state-of-the-art SMT solvers. Experimental results, in terms of both speed and coverage, show the benefits of our approach, thus opening new research vistas for using CP techniques in the service of program analysis.\",\"keywords\":\"Symbolic execution, Constraint programming, String solvers, JavaScript\",\"bibtex\":\"@inproceedings{Ama-And-Gan-Sch-Son-Stu_CPAIOR19,\\n  author    = {Roberto Amadini and \\n\\t\\tMak Andrlon and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Constraint Programming for Dynamic Symbolic Execution of\\n                {JavaScript}},\\n  editor    = {L.-M. Rousseau and K. Stergiou},\\n  booktitle = {Integration of Constraint Programming, Artificial Intelligence,\\n\\t\\tand Operations Research: Proceedings of the 16th International\\n\\t\\tConference (CPAIOR 2019)},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {11494}, \\n  pages     = {1--19},\\n  year      = {2019},\\n  doi       = {10.1007/978-3-030-19212-9_1},\\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve},\\n  abstract  = {Dynamic Symbolic Execution (DSE) combines concrete and symbolic \\n\\t\\texecution, usually for the purpose of generating good test \\n\\t\\tsuites automatically.  It relies on constraint solvers to solve\\n\\t\\tpath conditions and to generate new inputs to explore. DSE \\n\\t\\ttools usually make use of SMT solvers for constraint solving.\\n\\t\\tIn this paper, we show that constraint programming (CP) is a\\n\\t\\tpowerful alternative or complementary technique for DSE.\\n\\t\\tSpecifically, we apply CP techniques for DSE of JavaScript, the\\n\\t\\tde facto standard for web programming. We capture the JavaScript\\n\\t\\tsemantics with MiniZinc and integrate this approach into a tool\\n\\t\\twe call \\\\textsc{Aratha}. We use \\\\textsc{G-Strings}, a CP solver\\n\\t\\tequipped with string variables, for solving path conditions, \\n\\t\\tand we compare the performance of this approach against \\n\\t\\tstate-of-the-art SMT solvers. Experimental results, in terms of\\n\\t\\tboth speed and coverage, show the benefits of our approach,\\n\\t\\tthus opening new research vistas for using CP techniques in \\n\\t\\tthe service of program analysis.},\\n  keywords  = {Symbolic execution, Constraint programming, String solvers, JavaScript},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Andrlon, M.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Rousseau, L.\",\"Stergiou, K.\"],\"key\":\"Ama-And-Gan-Sch-Son-Stu_CPAIOR19\",\"id\":\"Ama-And-Gan-Sch-Son-Stu_CPAIOR19\",\"bibbaseid\":\"amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019\",\"role\":\"author\",\"urls\":{\" paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve\"},\"keyword\":[\"Symbolic execution\",\"Constraint programming\",\"String solvers\",\"JavaScript\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"François\"],\"propositions\":[],\"lastnames\":[\"Gauthier\"],\"suffixes\":[]},{\"firstnames\":[\"Alexander\"],\"propositions\":[],\"lastnames\":[\"Jordan\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Chenyi\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"title\":\"Reference Abstract Domains and Applications to String Analysis\",\"journal\":\"Fundamenta Informaticae\",\"volume\":\"158\",\"number\":\"4\",\"pages\":\"297–326\",\"year\":\"2018\",\"doi\":\"10.3233/FI-2018-1650\",\"url_paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve\",\"abstract\":\"Abstract interpretation is a well established theory that supports reasoning about the run-time behaviour of programs. It achieves tractable reasoning by considering abstractions of run-time states, rather than the states themselves. The chosen set of abstractions is referred to as the abstract domain. We develop a novel framework for combining (a possibly large number of) abstract domains. It achieves the effect of the so-called reduced product without requiring a quadratic number of functions to translate information among abstract domains. A central notion is a reference domain, a medium for information exchange. Our approach suggests a novel and simpler way to manage the integration of large numbers of abstract domains. We instantiate our framework in the context of string analysis. Browser-embedded dynamic programming languages such as JavaScript and PHP encourage the use of strings as a universal data type for both code and data values. The ensuing vulnerabilities have made string analysis a focus of much recent research. String analysis tends to combine many elementary string abstract domains, each designed to capture a specific aspect of strings. For this instance the set of regular languages, while too expensive to use directly for analysis, provides an attractive reference domain, enabling the efficient simulation of reduced products of multiple string abstract domains.\",\"keywords\":\"String analysis, Abstract interpretation\",\"bibtex\":\"@Article{Ama-Gan-Gau-Jor-Sch-Son-Stu-Zha_FI18,\\n  author    = {Roberto Amadini and \\n\\t\\tGraeme Gange and \\n\\t\\tFran{\\\\c{c}}ois Gauthier and\\n\\t\\tAlexander Jordan and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey and\\n\\t\\tChenyi Zhang},\\n  title     = {Reference Abstract Domains and Applications to String Analysis},\\n  journal   = {Fundamenta Informaticae},\\n  volume    = {158},\\n  number    = {4},\\n  pages     = {297--326},\\n  year      = {2018},\\n  doi       = {10.3233/FI-2018-1650},\\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve},\\n  abstract  = {Abstract interpretation is a well established theory that \\n\\t\\tsupports reasoning about the run-time behaviour of programs.\\n\\t\\tIt achieves tractable reasoning by considering abstractions of\\n\\t\\trun-time states, rather than the states themselves. The chosen\\n\\t\\tset of abstractions is referred to as the abstract domain.\\n\\t\\tWe develop a novel framework for combining (a possibly large \\n\\t\\tnumber of) abstract domains. It achieves the effect of the \\n\\t\\tso-called reduced product without requiring a quadratic number\\n\\t\\tof functions to translate information among abstract domains. A\\n\\t\\tcentral notion is a reference domain, a medium for information\\n\\t\\texchange. Our approach suggests a novel and simpler way to \\n\\t\\tmanage the integration of large numbers of abstract domains.\\n\\t\\tWe instantiate our framework in the context of string analysis.\\n\\t\\tBrowser-embedded dynamic programming languages such as \\n\\t\\tJavaScript and PHP encourage the use of strings as a universal\\n\\t\\tdata type for both code and data values. The ensuing \\n\\t\\tvulnerabilities have made string analysis a focus of much\\n\\t\\trecent research. String analysis tends to combine many \\n\\t\\telementary string abstract domains, each designed to capture \\n\\t\\ta specific aspect of strings. For this instance the set of \\n\\t\\tregular languages, while too expensive to use directly for \\n\\t\\tanalysis, provides an attractive reference domain, enabling \\n\\t\\tthe efficient simulation of reduced products of multiple\\n\\t\\tstring abstract domains.},\\n  keywords  = {String analysis, Abstract interpretation},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Gange, G.\",\"Gauthier, F.\",\"Jordan, A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\",\"Zhang, C.\"],\"key\":\"Ama-Gan-Gau-Jor-Sch-Son-Stu-Zha_FI18\",\"id\":\"Ama-Gan-Gau-Jor-Sch-Son-Stu-Zha_FI18\",\"bibbaseid\":\"amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018\",\"role\":\"author\",\"urls\":{\" paper\":\"https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve\"},\"keyword\":[\"String analysis\",\"Abstract interpretation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Abstract Interpretation, Symbolic Execution and Constraints\",\"editor\":[{\"firstnames\":[\"F.\",\"S.\"],\"propositions\":[\"de Boer\"],\"lastnames\":[],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Mauro\"],\"suffixes\":[]}],\"booktitle\":\"Recent Developments in the Design and Implementation of Programming Languages\",\"series\":\"OpenAccess Series in Informatics\",\"volume\":\"86\",\"pages\":\"7:1–7:19\",\"publisher\":\"Schloss Dagstuhl-Leibniz-Zentrum für Informatik\",\"year\":\"2020\",\"doi\":\"10.4230/OASIcs.Gabbrielli.2020.7\",\"url_paper\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf\",\"abstract\":\"Abstract interpretation is a static analysis framework for sound over-approximation of all possible runtime states of a program. Symbolic execution is a framework for reachability analysis which tries to explore all possible execution paths of a program. A shared feature between abstract interpretation and symbolic execution is that each—implicitly or explicitly—maintains constraints during execution, in the form of invariants or path conditions. We investigate the relations between the worlds of abstract interpretation, symbolic execution and constraint solving, to expose potential synergies.\",\"keywords\":\"Constraint programming, Symbolic execution, Abstract interpretation\",\"bibtex\":\"@inproceedings{Ama-Gan-Sch-Son-Stu_DIPL20,\\n  author    = {Roberto Amadini and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey}, \\n  title     = {Abstract Interpretation, Symbolic Execution and Constraints},\\n  editor    = {F. S. {de Boer} and J. Mauro},\\n  booktitle = {Recent Developments in the Design and Implementation of \\n\\t\\tProgramming Languages},\\n  series    = {OpenAccess Series in Informatics},\\n  volume    = {86}, \\n  pages     = {7:1--7:19},\\n  publisher = {Schloss Dagstuhl-Leibniz-Zentrum f{\\\\\\\"u}r Informatik},\\n  year      = {2020},\\n  doi       = {10.4230/OASIcs.Gabbrielli.2020.7},\\n  url_Paper = {https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf},\\n  abstract  = {Abstract interpretation is a static analysis framework for \\n\\t\\tsound over-approximation of all possible runtime states of \\n\\t\\ta program. Symbolic execution is a framework for reachability\\n\\t\\tanalysis which tries to explore all possible execution paths \\n\\t\\tof a program. A shared feature between abstract interpretation\\n\\t\\tand symbolic execution is that each---implicitly or \\n\\t\\texplicitly---maintains constraints during execution, \\n\\t\\tin the form of invariants or path conditions.\\n\\t\\tWe investigate the relations between the worlds of abstract \\n\\t\\tinterpretation, symbolic execution and constraint solving, \\n\\t\\tto expose potential synergies.},\\n  keywords  = {Constraint programming, Symbolic execution, Abstract interpretation},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"de Boer , F. S.\",\"Mauro, J.\"],\"key\":\"Ama-Gan-Sch-Son-Stu_DIPL20\",\"id\":\"Ama-Gan-Sch-Son-Stu_DIPL20\",\"bibbaseid\":\"amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf\"},\"keyword\":[\"Constraint programming\",\"Symbolic execution\",\"Abstract interpretation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"String Constraint Solving: Past, Present and Future\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"De Giacomo\"],\"suffixes\":[]},{\"firstnames\":[],\"propositions\":[],\"lastnames\":[\"others\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 24th European Conference on Artificial Intelligence\",\"pages\":\"2875–2876\",\"publisher\":\"IOS Press\",\"year\":\"2020\",\"doi\":\"10.3233/FAIA200431\",\"url_paper\":\"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431\",\"abstract\":\"String constraint solving is an important emerging field, given the ubiquity of strings over different fields such as formal analysis, automated testing, database query processing, and cybersecurity. This paper highlights the current state-of-the-art for string constraint solving, and identifies future challenges in this field.\",\"keywords\":\"String solvers\",\"bibtex\":\"@inproceedings{Ama-Gan-Sch-Son-Stu_ECAI20,\\n  author    = {Roberto Amadini and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey}, \\n  title     = {String Constraint Solving: Past, Present and Future},\\n  editor    = {G. {De Giacomo} and others},\\n  booktitle = {Proceedings of the 24th European Conference on \\n\\t\\tArtificial Intelligence},\\n  pages     = {2875--2876},\\n  publisher = {IOS Press},\\n  year      = {2020},\\n  doi       = {10.3233/FAIA200431},\\n  url_Paper = {https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431},\\n  abstract  = {String constraint solving is an important emerging field, \\n\\t\\tgiven the ubiquity of strings over different fields such as\\n\\t\\tformal analysis, automated testing, database query processing,\\n\\t\\tand cybersecurity. This paper highlights the current \\n\\t\\tstate-of-the-art for string constraint solving, and \\n\\t\\tidentifies future challenges in this field.},\\n  keywords  = {String solvers},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"De Giacomo, G.\",\"others\"],\"key\":\"Ama-Gan-Sch-Son-Stu_ECAI20\",\"id\":\"Ama-Gan-Sch-Son-Stu_ECAI20\",\"bibbaseid\":\"amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020\",\"role\":\"author\",\"urls\":{\" paper\":\"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431\"},\"keyword\":[\"String solvers\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study\",\"editor\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Fernández\"],\"suffixes\":[]}],\"booktitle\":\"Logic-Based Program Synthesis and Transformation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"12561\",\"pages\":\"192–209\",\"year\":\"2020\",\"doi\":\"10.1007/978-3-030-68446-4_10\",\"abstract\":\"Given a portfolio of algorithms, the goal of Algorithm Selection (\\\\textsfAS) is to select the best algorithm(s) for a new, unseen problem instance. Dynamic Symbolic Execution (\\\\textsfDSE) brings together concrete and symbolic execution to maximise the program coverage. \\\\textsfDSE uses a constraint solver to solve the path conditions and generate new inputs to explore. In this paper we join these lines of research by introducing a model that combines \\\\textsfDSE and \\\\textsfAS approaches. The proposed \\\\textsfAS/DSE model is a generic and flexible framework enabling the \\\\dse engine to solve the path conditions it collects with a portfolio of different solvers, by exploiting and extending the well-known \\\\textsfAS techniques that have been developed over the last decade. In this way, one can increase the coverage and sometimes even outperform the aggregate coverage achievable by running simultaneously all the solvers of the portfolio.\",\"keywords\":\"Symbolic execution\",\"bibtex\":\"@inproceedings{Ama-Gan-Sch-Son-Stu_LOPSTR20,\\n  author    = {Roberto Amadini and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey}, \\n  title     = {Algorithm Selection for Dynamic Symbolic Execution: \\n\\t\\tA Preliminary Study},\\n  editor    = {M. Fern{\\\\'a}ndez},\\n  booktitle = {Logic-Based Program Synthesis and Transformation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {12561}, \\n  pages     = {192--209},\\n  year      = {2020},\\n  doi       = {10.1007/978-3-030-68446-4_10},\\n  abstract  = {Given a portfolio of algorithms, the goal of Algorithm Selection\\n\\t\\t(\\\\textsf{AS}) is to select the best algorithm(s) for a new, \\n\\t\\tunseen problem instance. Dynamic Symbolic Execution \\n\\t\\t(\\\\textsf{DSE}) brings together concrete and symbolic execution \\n\\t\\tto maximise the program coverage. \\\\textsf{DSE} uses a \\n\\t\\tconstraint solver to solve the path conditions and generate \\n\\t\\tnew inputs to explore. In this paper we join these lines of \\n\\t\\tresearch by introducing a model that combines \\\\textsf{DSE} and\\n\\t\\t\\\\textsf{AS} approaches. The proposed \\\\textsf{AS/DSE} model is \\n\\t\\ta generic and flexible framework enabling the \\\\dse engine to \\n\\t\\tsolve the path conditions it collects with a portfolio of \\n\\t\\tdifferent solvers, by exploiting and extending the well-known\\n\\t\\t\\\\textsf{AS} techniques that have been developed over the last \\n\\t\\tdecade. In this way, one can increase the coverage and \\n\\t\\tsometimes even outperform the aggregate coverage achievable \\n\\t\\tby running simultaneously all the solvers of the portfolio.},\\n  keywords  = {Symbolic execution},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Fernández, M.\"],\"key\":\"Ama-Gan-Sch-Son-Stu_LOPSTR20\",\"id\":\"Ama-Gan-Sch-Son-Stu_LOPSTR20\",\"bibbaseid\":\"amadini-gange-schachte-sndergaard-stuckey-algorithmselectionfordynamicsymbolicexecutionapreliminarystudy-2020\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Symbolic execution\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Amadini\"],\"suffixes\":[]},{\"firstnames\":[\"Alexander\"],\"propositions\":[],\"lastnames\":[\"Jordan\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"François\"],\"propositions\":[],\"lastnames\":[\"Gauthier\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Chenyi\"],\"propositions\":[],\"lastnames\":[\"Zhang\"],\"suffixes\":[]}],\"title\":\"Combining String Abstract Domains for JavaScript Analysis: An Evaluation\",\"editor\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Legay\"],\"suffixes\":[]},{\"firstnames\":[\"T.\"],\"propositions\":[],\"lastnames\":[\"Margaria\"],\"suffixes\":[]}],\"booktitle\":\"TACAS 2017: Proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"10205\",\"pages\":\"41–57\",\"publisher\":\"Springer\",\"year\":\"2017\",\"doi\":\"10.1007/978-3-662-54577-5_3\",\"abstract\":\"Strings play a central role in JavaScript and similar scripting languages. Owing to dynamic features such as the eval function and dynamic property access, precise string analysis is a prerequisite for automated reasoning about practically any kind of runtime property. Although the literature presents a considerable number of abstract domains for capturing and representing specific aspect of strings, we are not aware of tools that allow flexible combination of string abstract domains. Indeed, support for string analysis is often confined to a single, dedicated string domain. In this paper we describe a framework that allows us to combine multiple string abstract domains for the analysis of JavaScript programs. It is implemented as an extension of SAFE, an open-source static analysis tool. We investigate different combinations of abstract domains that capture various aspects of strings. Our evaluation suggests that a combination of few, simple abstract domains suffice to outperform the precision of state-of-the-art static analysis tools for JavaScript.\",\"keywords\":\"String solvers, Abstract domains, Abstract interpretation, JavaScript\",\"bibtex\":\"@InProceedings{Ama-Jor-Gan-Gau-Sch-Son-Stu-Zha_TACAS17,\\n  author    = {Roberto Amadini and \\n\\t\\tAlexander Jordan and \\n\\t\\tGraeme Gange and \\n\\t\\tFran{\\\\c{c}}ois Gauthier and\\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey and\\n\\t\\tChenyi Zhang},\\n  title     = {Combining String Abstract Domains for {JavaScript} Analysis: \\n\\t\\tAn Evaluation},\\n  editor    = {A. Legay and T. Margaria},\\n  booktitle = {TACAS 2017: Proceedings of the 23rd International\\n\\t\\tConference on Tools and Algorithms for the Construction \\n\\t\\tand Analysis of Systems},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {10205},\\n  pages     = {41--57},\\n  publisher = {Springer},\\n  year      = {2017},\\n  doi       = {10.1007/978-3-662-54577-5_3},\\n  abstract  = {Strings play a central role in JavaScript and similar scripting\\n\\t\\tlanguages. Owing to dynamic features such as the eval function\\n\\t\\tand dynamic property access, precise string analysis is a \\n\\t\\tprerequisite for automated reasoning about practically any \\n\\t\\tkind of runtime property. Although the literature presents \\n\\t\\ta considerable number of abstract domains for capturing and \\n\\t\\trepresenting specific aspect of strings, we are not aware of \\n\\t\\ttools that allow flexible combination of string abstract \\n\\t\\tdomains. Indeed, support for string analysis is often confined\\n\\t\\tto a single, dedicated string domain. In this paper we \\n\\t\\tdescribe a framework that allows us to combine multiple string\\n\\t\\tabstract domains for the analysis of JavaScript programs. \\n\\t\\tIt is implemented as an extension of SAFE, an open-source \\n\\t\\tstatic analysis tool. We investigate different combinations \\n\\t\\tof abstract domains that capture various aspects of strings.\\n\\t\\tOur evaluation suggests that a combination of few, simple \\n\\t\\tabstract domains suffice to outperform the precision of \\n\\t\\tstate-of-the-art static analysis tools for JavaScript.},\\n  keywords  = {String solvers, Abstract domains, Abstract interpretation, JavaScript},\\n}\\n\\n\",\"author_short\":[\"Amadini, R.\",\"Jordan, A.\",\"Gange, G.\",\"Gauthier, F.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\",\"Zhang, C.\"],\"editor_short\":[\"Legay, A.\",\"Margaria, T.\"],\"key\":\"Ama-Jor-Gan-Gau-Sch-Son-Stu-Zha_TACAS17\",\"id\":\"Ama-Jor-Gan-Gau-Sch-Son-Stu-Zha_TACAS17\",\"bibbaseid\":\"amadini-jordan-gange-gauthier-schachte-sndergaard-stuckey-zhang-combiningstringabstractdomainsforjavascriptanalysisanevaluation-2017\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"String solvers\",\"Abstract domains\",\"Abstract interpretation\",\"JavaScript\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Mak\"],\"propositions\":[],\"lastnames\":[\"Andrlon\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Optimal Bounds for Floating-Point Addition in Constant Time\",\"editor\":[{\"firstnames\":[\"N.\"],\"propositions\":[],\"lastnames\":[\"Takagi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Boldo\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Langhammer\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 26th IEEE Symposium on Computer Arithmetic (ARITH 2019)\",\"pages\":\"159–166\",\"publisher\":\"IEEE Conf. Publ.\",\"year\":\"2019\",\"doi\":\"10.1109/arith.2019.00038\",\"abstract\":\"Reasoning about floating-point numbers is notoriously difficult, owing to the lack of convenient algebraic properties such as associativity. This poses a substantial challenge for program analysis and verification tools which rely on precise floating-point constraint solving. Currently, interval methods in this domain often exhibit slow convergence even on simple examples. We present a new theorem supporting efficient computation of exact bounds of the intersection of a rectangle with the preimage of an interval under floating-point addition, in any radix or rounding mode. We thus give an efficient method of deducing optimal bounds on the components of an addition, solving the convergence problem.\",\"keywords\":\"Constraint solving, Machine arithmetic\",\"bibtex\":\"@Inproceedings{And-Sch-Son-Stu_ARITH19,\\n  author    = {Mak Andrlon and\\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tPeter J. Stuckey},\\n  title     = {Optimal Bounds for Floating-Point Addition in Constant Time},\\n  editor    = {N. Takagi and S. Boldo and M. Langhammer},\\n  booktitle = {Proceedings of the 26th IEEE Symposium on Computer Arithmetic \\n\\t\\t(ARITH 2019)},\\n  pages     = {159--166},\\n  publisher = {IEEE Conf. Publ.},\\n  year      = {2019},\\n  doi       = {10.1109/arith.2019.00038},\\n  abstract  = {Reasoning about floating-point numbers is notoriously difficult,\\n\\t\\towing to the lack of convenient algebraic properties such as \\n\\t\\tassociativity. This poses a substantial challenge for program \\n\\t\\tanalysis and verification tools which rely on precise \\n\\t\\tfloating-point constraint solving. Currently, interval methods \\n\\t\\tin this domain often exhibit slow convergence even on simple \\n\\t\\texamples. We present a new theorem supporting efficient \\n\\t\\tcomputation of exact bounds of the intersection of a rectangle \\n\\t\\twith the preimage of an interval under floating-point addition,\\n\\t\\tin any radix or rounding mode. We thus give an efficient method\\n\\t\\tof deducing optimal bounds on the components of an addition, \\n\\t\\tsolving the convergence problem.},\\n  keywords  = {Constraint solving, Machine arithmetic},\\n}\\n\\n\",\"author_short\":[\"Andrlon, M.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Takagi, N.\",\"Boldo, S.\",\"Langhammer, M.\"],\"key\":\"And-Sch-Son-Stu_ARITH19\",\"id\":\"And-Sch-Son-Stu_ARITH19\",\"bibbaseid\":\"andrlon-schachte-sndergaard-stuckey-optimalboundsforfloatingpointadditioninconstanttime-2019\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint solving\",\"Machine arithmetic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Tania\"],\"propositions\":[],\"lastnames\":[\"Armstrong\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation\",\"editor\":[{\"firstnames\":[\"B.\"],\"propositions\":[],\"lastnames\":[\"Le Charlier\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis: Proceedings of the First International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"864\",\"pages\":\"266–280\",\"publisher\":\"Springer-Verlag\",\"year\":\"1994\",\"doi\":\"10.1007/3-540-58485-4_46\",\"abstract\":\"Many analyses for logic programming languages use Boolean functions to express dependencies between variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis. We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. We provide syntactic characterizations and study their algebraic properties. In particular, we show that both classes are closed under existential quantification. We investigate representations for these classes based on: reduced ordered binary decision diagrams (ROBDDs), disjunctive normal form, conjunctive normal form, Blake canonical form, dual Blake canonical form, and a form specific to definite functions. We give an empirical comparison of these different representations for groundness analysis.\",\"keywords\":\"Boolean logic, Abstract domains, Abstract interpretation, Logic programming\",\"bibtex\":\"@Inproceedings{Arm-Mar-Sch-Son_SAS94,\\n  author    = {Tania Armstrong and \\n\\t\\tKim Marriott and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {{Boolean} Functions for Dependency Analysis:\\n\\t\\tAlgebraic Properties and Efficient Representation},\\n  editor    = {B. {Le Charlier}},\\n  booktitle = {Static Analysis: Proceedings of the First International \\n\\t\\tSymposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {864},\\n  pages     = {266--280},\\n  publisher = {Springer-Verlag},\\n  year      = {1994},\\n  doi       = {10.1007/3-540-58485-4_46},\\n  abstract  = {Many analyses for logic programming languages use Boolean \\n\\t\\tfunctions to express dependencies between variables or argument\\n\\t\\tpositions. Examples include groundness analysis, arguably the \\n\\t\\tmost important analysis for logic programs, finiteness analysis \\n\\t      \\tand functional dependency analysis. We identify two classes of \\n\\t\\tBoolean functions that have been used: positive and definite \\n\\t\\tfunctions, and we systematically investigate these classes and \\n\\t\\ttheir efficient implementation for dependency analyses. We \\n\\t\\tprovide syntactic characterizations and study their algebraic \\n\\t\\tproperties. In particular, we show that both classes are closed\\n\\t\\tunder existential quantification. We investigate representations\\n\\t\\tfor these classes based on: reduced ordered binary decision \\n\\t\\tdiagrams (ROBDDs), disjunctive normal form, conjunctive normal \\n\\t\\tform, Blake canonical form, dual Blake canonical form, and a \\n\\t\\tform specific to definite functions. We give an  empirical \\n\\t\\tcomparison of these different representations for groundness \\n\\t\\tanalysis.},\\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Armstrong, T.\",\"Marriott, K.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Le Charlier, B.\"],\"key\":\"Arm-Mar-Sch-Son_SAS94\",\"id\":\"Arm-Mar-Sch-Son_SAS94\",\"bibbaseid\":\"armstrong-marriott-schachte-sndergaard-booleanfunctionsfordependencyanalysisalgebraicpropertiesandefficientrepresentation-1994\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Abstract domains\",\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Tania\"],\"propositions\":[],\"lastnames\":[\"Armstrong\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Two Classes of Boolean Functions for Dependency Analysis\",\"journal\":\"Science of Computer Programming\",\"volume\":\"31\",\"number\":\"1\",\"pages\":\"3–45\",\"year\":\"1998\",\"doi\":\"10.1016/S0167-6423(96)00039-1\",\"abstract\":\"Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis for databases. We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. On the theoretical side we provide syntactic characterizations and study the expressiveness and algebraic properties of the classes. In particular, we show that both are closed under existential quantification. On the practical side we investigate various representations for the classes based on reduced ordered binary decision diagrams (ROBDDs), disjunctive normal form, conjunctive normal form, Blake canonical form, dual Blake canonical form, and a form specific to definite functions. We compare the resulting implementations of groundness analyzers based on the representations for precision and efficiency.\",\"keywords\":\"Boolean logic, Abstract domains, Abstract interpretation, Logic programming\",\"bibtex\":\"@Article{Arm-Mar-Sch-Son_SCP98,\\n  author   = {Tania Armstrong and \\n\\t\\tKim Marriott and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t   = {Two Classes of {Boolean} Functions for Dependency Analysis},\\n  journal  = {Science of Computer Programming},\\n  volume   = {31},\\n  number   = {1},\\n  pages    = {3--45},\\n  year\\t   = {1998},\\n  doi       = {10.1016/S0167-6423(96)00039-1},\\n  abstract = {Many static analyses for declarative programming/database \\n\\t\\tlanguages use Boolean functions to express dependencies \\n\\t\\tamong variables or argument positions. Examples include \\n\\t\\tgroundness analysis, arguably the most important analysis for \\n\\t\\tlogic programs, finiteness analysis and functional dependency \\n\\t\\tanalysis for databases. We identify two classes of Boolean \\n\\t\\tfunctions that have been used: positive and definite functions,\\n\\t\\tand we systematically investigate these classes and their \\n\\t\\tefficient implementation for dependency analyses. On the \\n\\t\\ttheoretical side we provide syntactic characterizations and\\n\\t\\tstudy the expressiveness and algebraic properties of the \\n\\t\\tclasses. In particular, we show that both are closed under \\n\\t\\texistential quantification. On the practical side we \\n\\t\\tinvestigate various representations for the classes based on \\n\\t\\treduced ordered binary decision diagrams (ROBDDs), disjunctive \\n\\t\\tnormal form, conjunctive normal form, Blake canonical form, \\n\\t\\tdual Blake canonical form, and a form specific to definite \\n\\t\\tfunctions. We compare the resulting implementations of \\n\\t\\tgroundness analyzers based on the representations for precision\\n\\t\\tand efficiency.},\\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Armstrong, T.\",\"Marriott, K.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"key\":\"Arm-Mar-Sch-Son_SCP98\",\"id\":\"Arm-Mar-Sch-Son_SCP98\",\"bibbaseid\":\"armstrong-marriott-schachte-sndergaard-twoclassesofbooleanfunctionsfordependencyanalysis-1998\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Abstract domains\",\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"James\"],\"propositions\":[],\"lastnames\":[\"Bailey\"],\"suffixes\":[]},{\"firstnames\":[\"Lobel\"],\"propositions\":[],\"lastnames\":[\"Crnogorac\"],\"suffixes\":[]},{\"firstnames\":[\"Kotagiri\"],\"propositions\":[],\"lastnames\":[\"Ramamohanarao\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Abstract Interpretation of Active Rules and Its Use in Termination Analysis\",\"editor\":[{\"firstnames\":[\"F.\"],\"propositions\":[],\"lastnames\":[\"Afrati\"],\"suffixes\":[]},{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Kolaitis\"],\"suffixes\":[]}],\"booktitle\":\"Database Theory—ICDT'97\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1186\",\"pages\":\"188–202\",\"publisher\":\"Springer\",\"year\":\"1997\",\"doi\":\"10.1007/3-540-62222-5_45\",\"abstract\":\"The behaviour of rules in an active database system can be difficult to predict, and much work has been devoted to the development of automatic support for reasoning about properties such as confluence and termination. We show how abstract interpretation can provide a generic framework for analysis of active rules. Abstract interpretation is a well-understood, semantics-based method for static analysis. Its advantage, apart from generality, lies in the separation of concerns: Once the underlying semantics has been captured formally, a variety of analyses can be derived, almost for free, as \\\\emphapproximations to the semantics. Moreover, powerful general theorems enable simple proofs of global correctness and uniform termination of specific analyses. We outline these ideas and present, as an example application, a new method for termination analysis. In terms of precision, the method compares favourably with previous solutions to the problem. This is because the method investigates the flow of data rather than just the syntax of conditions and actions.\",\"keywords\":\"Termination analysis, Abstract interpretation, Active databases\",\"bibtex\":\"@Inproceedings{Bai-Crn-Ram-Son_ICDT97,\\n  author    = {James Bailey and \\n\\t\\tLobel Crnogorac and \\n\\t\\tKotagiri Ramamohanarao and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Abstract Interpretation of Active Rules and Its Use in\\n\\t\\tTermination Analysis},\\n  editor    = {F. Afrati and P. Kolaitis},\\n  booktitle = {Database Theory---ICDT'97},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1186},\\n  pages     = {188--202},\\n  publisher = {Springer},\\n  year      = {1997},\\n  doi       = {10.1007/3-540-62222-5_45},\\n  abstract  = {The behaviour of rules in an active database system can be\\n\\t\\tdifficult to predict, and much work has been devoted to the\\n\\t\\tdevelopment of automatic support for reasoning about properties\\n\\t\\tsuch as confluence and termination. We show how abstract \\n\\t\\tinterpretation can provide a generic framework for analysis of\\n\\t\\tactive rules. Abstract interpretation is a well-understood, \\n\\t\\tsemantics-based method for static analysis. Its advantage, \\n\\t\\tapart from generality, lies in the separation of concerns: \\n\\t\\tOnce the underlying semantics has been captured formally, a \\n\\t\\tvariety of analyses can be derived, almost for free, as \\n\\t\\t\\\\emph{approximations} to the semantics. Moreover, powerful \\n\\t\\tgeneral theorems enable simple proofs of global correctness \\n\\t\\tand uniform termination of specific analyses. We outline these\\n\\t\\tideas and present, as an example application, a new method for \\n\\t\\ttermination analysis. In terms of precision, the method \\n\\t\\tcompares favourably with previous solutions to the problem.\\n\\t\\tThis is because the method investigates the flow of data \\n\\t\\trather than just the syntax of conditions and actions.},\\n  keywords  = {Termination analysis, Abstract interpretation, Active databases},\\n}\\n\\n\",\"author_short\":[\"Bailey, J.\",\"Crnogorac, L.\",\"Ramamohanarao, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Afrati, F.\",\"Kolaitis, P.\"],\"key\":\"Bai-Crn-Ram-Son_ICDT97\",\"id\":\"Bai-Crn-Ram-Son_ICDT97\",\"bibbaseid\":\"bailey-crnogorac-ramamohanarao-sndergaard-abstractinterpretationofactiverulesanditsuseinterminationanalysis-1997\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Termination analysis\",\"Abstract interpretation\",\"Active databases\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Naomi\"],\"propositions\":[],\"lastnames\":[\"Baker\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Definiteness Analysis for CLP(R)\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Gupta\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Mohay\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Topor\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Sixteenth Australian Computer Science Conference\",\"series\":\"Australian Computer Science Communications\",\"volume\":\"15\",\"number\":\"1\",\"pages\":\"321–332\",\"year\":\"1993\",\"abstract\":\"Constraint logic programming (CLP) languages generalise logic programming languages, amalgamating logic programming and constraint programming. Combining the best of two worlds, they provide powerful tools for wide classes of problems. As with logic programming languages, code optimization by compilers is an important issue in the implementation of CLP languages. A compiler needs sophisticated global information, collected by dataflow analyses, to generate competitive code. One kind of useful dataflow information concerns the point at which variables become definite, that is, constrained to take a unique value. In this paper we present a very precise dataflow analysis to determine definiteness, and we discuss its applications. By separating the two concerns: correctness and implementation techniques, abstract interpretation enables us to develop a sophisticated dataflow analysis in a straightforward manner, in fact in a framework where the correctness of the analysis is easily established—a feature which is uncommon when complex analyses are developed in an ad hoc way. We use a class of Boolean functions, the positive functions, to represent the definiteness relationship between variables. A Boolean function is interpreted as expressing a relation which holds not simply at the given point in an evaluation, but in fact during the rest of the evaluation branch. The nature of variables in a CLP language makes this treatment both possible and natural.\",\"keywords\":\"Constraint logic programming, Boolean logic, Abstract interpretation\",\"bibtex\":\"@inproceedings{Bak-Son_ACSC93,\\n  author    = {Naomi Baker and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Definiteness Analysis for {CLP(R)}},\\n  editor    = {G. Gupta and G. Mohay and R. Topor},\\n  booktitle = {Proceedings of the Sixteenth Australian Computer Science \\n\\t\\tConference},\\n  series    = {Australian Computer Science Communications},\\n  volume    = {15},\\n  number    = {1},\\n  pages     = {321--332},\\n  year      = {1993},\\n  abstract  = {Constraint logic programming (CLP) languages generalise\\n\\t\\tlogic programming languages, amalgamating logic programming\\n\\t\\tand constraint programming.  Combining the best of two\\n\\t\\tworlds, they provide powerful tools for wide classes\\n\\t\\tof problems.  As with logic programming languages, code\\n\\t\\toptimization by compilers is an important issue in the\\n\\t\\timplementation of CLP languages.  A compiler needs\\n\\t\\tsophisticated global information, collected by dataflow\\n\\t\\tanalyses, to generate competitive code.\\n\\t\\tOne kind of useful dataflow information concerns the point\\n\\t\\tat which variables become definite, that is, constrained\\n\\t\\tto take a unique value.  In this paper we present a very\\n\\t\\tprecise dataflow analysis to determine definiteness, and we\\n\\t\\tdiscuss its applications.  By separating the two concerns:\\n\\t\\tcorrectness and implementation techniques, abstract\\n\\t\\tinterpretation enables us to develop a sophisticated\\n\\t\\tdataflow analysis in a straightforward manner, in fact in\\n\\t\\ta framework where the correctness of the analysis is easily\\n\\t\\testablished---a feature which is uncommon when complex\\n\\t\\tanalyses are developed in an ad hoc way.\\n\\t\\tWe use a class of Boolean functions, the positive functions,\\n\\t\\tto represent the definiteness relationship between variables.\\n\\t\\tA Boolean function is interpreted as expressing a relation\\n\\t\\twhich holds not simply at the given point in an evaluation,\\n\\t\\tbut in fact during the rest of the evaluation branch.\\n\\t\\tThe nature of variables in a CLP language makes this\\n\\t\\ttreatment both possible and natural.},\\n  keywords  = {Constraint logic programming, Boolean logic, Abstract interpretation},\\n}\\n\\n\",\"author_short\":[\"Baker, N.\",\"Søndergaard, H.\"],\"editor_short\":[\"Gupta, G.\",\"Mohay, G.\",\"Topor, R.\"],\"key\":\"Bak-Son_ACSC93\",\"id\":\"Bak-Son_ACSC93\",\"bibbaseid\":\"baker-sndergaard-definitenessanalysisforclpr-1993\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint logic programming\",\"Boolean logic\",\"Abstract interpretation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"proceedings\",\"editor\":[{\"firstnames\":[\"Juliana\"],\"propositions\":[],\"lastnames\":[\"Bowles\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Logic-Based Program Synthesis and Transformation: Proceedings of the 34th International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"14919\",\"publisher\":\"Springer\",\"year\":\"2024\",\"doi\":\"10.1007/978-3-031-71294-4\",\"keywords\":\"Program transformation, Program synthesis, Program analysis, Inversion, Specification, Logic-based methods, Logic programming\",\"bibtex\":\"@Proceedings{Bow-Son_LOPSTR24,\\n  editor    = {Juliana Bowles and Harald S{\\\\o}ndergaard},\\n  title     = {Logic-Based Program Synthesis and Transformation:\\n\\t\\tProceedings of the 34th International Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {14919},\\n  publisher = {Springer},\\n  year      = {2024},\\n  doi       = {10.1007/978-3-031-71294-4},\\n  keywords  = {Program transformation, Program synthesis, Program analysis, Inversion, Specification, Logic-based methods, Logic programming},\\n}\\n\\n\",\"editor_short\":[\"Bowles, J.\",\"Søndergaard, H.\"],\"key\":\"Bow-Son_LOPSTR24\",\"id\":\"Bow-Son_LOPSTR24\",\"bibbaseid\":\"bowles-sndergaard-logicbasedprogramsynthesisandtransformationproceedingsofthe34thinternationalsymposium-2024\",\"role\":\"editor\",\"urls\":{},\"keyword\":[\"Program transformation\",\"Program synthesis\",\"Program analysis\",\"Inversion\",\"Specification\",\"Logic-based methods\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Rosemary\"],\"propositions\":[],\"lastnames\":[\"Chang\"],\"suffixes\":[]},{\"firstnames\":[\"Linda\"],\"propositions\":[],\"lastnames\":[\"Stern\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Roger\"],\"propositions\":[],\"lastnames\":[\"Hadgraft\"],\"suffixes\":[]}],\"title\":\"Places for Learning Engineering: A Preliminary Report on Informal Learning Spaces\",\"booktitle\":\"Proceedings of the 2009 Research in Engineering Education Symposium\",\"location\":\"Palm Cove, Queensland\",\"year\":\"2009\",\"keywords\":\"Education\",\"bibtex\":\"@Inproceedings{Cha-Ste-Son-Had_REES09,\\n  author    = {Rosemary Chang and\\n\\t\\tLinda Stern and\\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tRoger Hadgraft},\\n  title     = {Places for Learning Engineering: \\n\\t\\tA Preliminary Report on Informal Learning Spaces},\\n  booktitle = {Proceedings of the 2009 Research in Engineering Education \\n\\t\\tSymposium},\\n  location  = {Palm Cove, Queensland},\\n  year      = {2009},\\n  keywords  = {Education},\\n}\\n\\n\",\"author_short\":[\"Chang, R.\",\"Stern, L.\",\"Søndergaard, H.\",\"Hadgraft, R.\"],\"key\":\"Cha-Ste-Son-Had_REES09\",\"id\":\"Cha-Ste-Son-Had_REES09\",\"bibbaseid\":\"chang-stern-sndergaard-hadgraft-placesforlearningengineeringapreliminaryreportoninformallearningspaces-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Michael\"],\"propositions\":[],\"lastnames\":[\"Codish\"],\"suffixes\":[]},{\"firstnames\":[\"Samir\"],\"propositions\":[],\"lastnames\":[\"Genaim\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Higher-Precision Groundness Analysis\",\"editor\":[{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Codognet\"],\"suffixes\":[]}],\"booktitle\":\"Logic Programming: Proceedings of the 17th International Conference\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"2237\",\"pages\":\"135–149\",\"publisher\":\"Springer\",\"year\":\"2001\",\"doi\":\"10.1007/3-540-45635-x_17\",\"abstract\":\"Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis. In this work we identify two problems with the Pos domain, the multiplicity and sign problems, that arise independently in groundness and uniqueness analysis. We describe how these problems can be solved using an analysis based on a domain Size for inferring term size relations. However this solution has its own shortcomings because it involves a widening operator which leads to a loss of Pos information. Inspired by Pos, Size and the Lsign domain for abstract linear arithmetic constraints we introduce a new domain Lpos, and show how it can be used for groundness and uniqueness analysis. The idea is to use the sign information of Lsign to improve the widening of Size so that it does not lose Pos information. We prove that the resulting analyses using Lpos are uniformly more precise than those using Pos.\",\"keywords\":\"Boolean logic, Abstract domains, Abstract interpretation, Logic programming\",\"bibtex\":\"@Inproceedings{Cod-Gen-Son-Stu_ICLP01,\\n  author    = {Michael Codish and \\n\\t\\tSamir Genaim and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Higher-Precision Groundness Analysis},\\n  editor    = {P. Codognet},\\n  booktitle = {Logic Programming: Proceedings of the 17th International \\n\\t\\tConference},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {2237},\\n  pages     = {135--149},\\n  publisher = {Springer},\\n  year      = {2001},\\n  doi       = {10.1007/3-540-45635-x_17},\\n  abstract  = {Groundness analysis of logic programs using Pos-based abstract\\n\\t\\tinterpretation is one of the clear success stories of the last\\n\\t\\tdecade in the area of logic program analysis. In this work we\\n\\t\\tidentify two problems with the Pos domain, the multiplicity and\\n\\t\\tsign problems, that arise independently in groundness and \\n\\t\\tuniqueness analysis. We describe how these problems can be \\n\\t\\tsolved using an analysis based on a domain Size for inferring \\n\\t\\tterm size relations.  However this solution has its own \\n\\t\\tshortcomings because it involves a widening operator which leads\\n\\t\\tto a loss of Pos information. Inspired by Pos, Size and the\\n\\t\\tLsign domain for abstract linear arithmetic constraints we\\n\\t\\tintroduce a new domain Lpos, and show how it can be used for\\n\\t\\tgroundness and uniqueness analysis. The idea is to use the sign\\n\\t\\tinformation of Lsign to improve the widening of Size so that\\n\\t\\tit does not lose Pos information. We prove that the resulting \\n\\t\\tanalyses using Lpos are uniformly more precise than those using\\n\\t\\tPos.},\\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Codish, M.\",\"Genaim, S.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Codognet, P.\"],\"key\":\"Cod-Gen-Son-Stu_ICLP01\",\"id\":\"Cod-Gen-Son-Stu_ICLP01\",\"bibbaseid\":\"codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Abstract domains\",\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Michael\"],\"propositions\":[],\"lastnames\":[\"Codish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Sharing and Groundness Dependencies in Logic Programs\",\"journal\":\"ACM Transactions on Programming Languages and Systems\",\"volume\":\"21\",\"number\":\"5\",\"pages\":\"948–976\",\"year\":\"1999\",\"doi\":\"10.1145/330249.330252\",\"abstract\":\"We investigate Jacobs and Langen's \\\\textsfSharing domain, introduced for the analysis of variable sharing in logic programs, and show that it is isomorphic to Marriott and Søndergaard's \\\\textsfPos domain, introduced for the analysis of groundness dependencies. Our key idea is to view the sets of variables in a \\\\textsfSharing domain element as the models of a corresponding Boolean function. This leads to a recasting of sharing analysis in terms of the property of ``not being affected by the binding of a \\\\emphsingle variable.'' Such an ``unaffectedness dependency'' analysis has close connections with groundness dependency analysis using positive Boolean functions. This new view improves our understanding of sharing analysis, and leads to an elegant expression of its combination with groundness dependency analysis based on the reduced product of \\\\textsfSharing and \\\\textsfPos. It also opens up new avenues for the efficient implementation of sharing analysis, for example using reduced order binary decision diagrams, as well as efficient implementation of the reduced product, using domain factorizations.\",\"keywords\":\"Boolean logic, Abstract domains, Abstract interpretation, Logic programming\",\"bibtex\":\"@Article{Cod-Son-Stu_TOPLAS99,\\n  author   = {Michael Codish and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title    = {Sharing and Groundness Dependencies in Logic Programs},\\n  journal  = {ACM Transactions on Programming Languages and Systems},\\n  volume   = {21},\\n  number   = {5},\\n  pages    = {948--976},\\n  year     = {1999},\\n  doi      = {10.1145/330249.330252},\\n  abstract = {We investigate Jacobs and Langen's \\\\textsf{Sharing} domain, \\n\\t\\tintroduced for the analysis of variable sharing in logic \\n\\t\\tprograms, and show that it is isomorphic to Marriott and \\n\\t\\tS{\\\\o}ndergaard's \\\\textsf{Pos} domain, introduced for the \\n\\t\\tanalysis of groundness dependencies.  Our key idea\\n\\t\\tis to view the sets of variables in a \\\\textsf{Sharing} \\n\\t\\tdomain element as the models of a corresponding Boolean \\n\\t\\tfunction.  This leads to a recasting of sharing analysis \\n\\t\\tin terms of the property of ``not being affected by the \\n\\t\\tbinding of a \\\\emph{single} variable.''  Such an\\n\\t\\t``unaffectedness dependency'' analysis has close \\n\\t\\tconnections with groundness dependency analysis using \\n\\t\\tpositive Boolean functions.  This new view improves our \\n\\t\\tunderstanding of sharing analysis, and leads to an elegant\\n\\t\\texpression of its combination with groundness dependency\\n\\t\\tanalysis based on the reduced product of \\\\textsf{Sharing} \\n\\t\\tand \\\\textsf{Pos}.  It also opens up new avenues for the \\n\\t\\tefficient implementation of sharing analysis, for example \\n\\t\\tusing reduced order binary decision diagrams, as well as\\n\\t\\tefficient implementation of the reduced product, using \\n\\t\\tdomain factorizations.},\\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Codish, M.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Cod-Son-Stu_TOPLAS99\",\"id\":\"Cod-Son-Stu_TOPLAS99\",\"bibbaseid\":\"codish-sndergaard-stuckey-sharingandgroundnessdependenciesinlogicprograms-1999\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Abstract domains\",\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"firstnames\":[\"Michael\"],\"propositions\":[],\"lastnames\":[\"Codish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Meta-Circular Abstract Interpretation in Prolog\",\"editor\":[{\"firstnames\":[\"T.\"],\"propositions\":[],\"lastnames\":[\"Mogensen\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Schmidt\"],\"suffixes\":[]},{\"firstnames\":[\"I.\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Sudborough\"],\"suffixes\":[]}],\"booktitle\":\"The Essence of Computation: Complexity, Analysis, Transformation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"2566\",\"pages\":\"109–134\",\"publisher\":\"Springer\",\"year\":\"2002\",\"doi\":\"10.1007/3-540-36377-7_6\",\"abstract\":\"We give an introduction to the meta-circular approach to the abstract interpretation of logic programs. This approach is particularly useful for prototyping and for introductory classes on abstract interpretation. Using interpreters, students can immediately write, adapt, and experiment with interpreters and working dataflow analysers. We use a simple meta-circular interpreter, based on a ``non-ground $T_P$'' semantics, as a generic analysis engine. Instantiating the engine is a matter of providing an appropriate domain of approximations, together with definitions of ``abstract'' unification and disjunction. Small changes of the interpreter let us vary both what can be ``observed'' by an analyser, and how fixed point computation is done. Amongst the dataflow analyses used to exemplify this approach are a parity analysis, groundness dependency analysis, call patterns, depth-$k$ analysis, and a ``pattern'' analysis to establish most specific generalisations of calls and success sets.\",\"keywords\":\"Abstract interpretation, Abstract domains, Logic programming, Prolog\",\"bibtex\":\"@Incollection{Cod-Son_JonesFest02,\\n  author    = {Michael Codish and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Meta-Circular Abstract Interpretation in {Prolog}},\\n  editor    = {T. Mogensen and D. Schmidt and I. H. Sudborough},\\n  booktitle = {The Essence of Computation: Complexity, Analysis, Transformation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {2566},\\n  pages     = {109--134},\\n  publisher = {Springer},\\n  year      = {2002},\\n  doi       = {10.1007/3-540-36377-7_6},\\n  abstract  = {We give an introduction to the meta-circular approach to the\\n\\t\\tabstract interpretation of logic programs.  This approach is\\n\\t\\tparticularly useful for prototyping and for introductory \\n\\t\\tclasses on abstract interpretation.  Using interpreters, \\n\\t\\tstudents can immediately write, adapt, and experiment with \\n\\t\\tinterpreters and working dataflow analysers.  We use a simple\\n\\t\\tmeta-circular interpreter, based on a ``non-ground $T_P$'' \\n\\t\\tsemantics, as a generic analysis engine.  Instantiating the\\n\\t\\tengine is a matter of providing an appropriate domain of\\n\\t\\tapproximations, together with definitions of ``abstract'' \\n\\t\\tunification and disjunction.  Small changes of the interpreter\\n\\t\\tlet us vary both what can be ``observed'' by an analyser, and\\n\\t\\thow fixed point computation is done.  Amongst the dataflow \\n\\t\\tanalyses used to exemplify this approach are a parity analysis,\\n\\t\\tgroundness dependency analysis, call patterns, depth-$k$ \\n\\t\\tanalysis, and a ``pattern'' analysis to establish most specific\\n\\t\\tgeneralisations of calls and success sets.},\\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Prolog},\\n}\\n\\n\",\"author_short\":[\"Codish, M.\",\"Søndergaard, H.\"],\"editor_short\":[\"Mogensen, T.\",\"Schmidt, D.\",\"Sudborough, I. H.\"],\"key\":\"Cod-Son_JonesFest02\",\"id\":\"Cod-Son_JonesFest02\",\"bibbaseid\":\"codish-sndergaard-metacircularabstractinterpretationinprolog-2002\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Logic programming\",\"Prolog\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"downloads\":0,\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Michael\"],\"propositions\":[],\"lastnames\":[\"Codish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"The Boolean Logic of Set Sharing Analysis\",\"editor\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Palamidessi\"],\"suffixes\":[]},{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Glaser\"],\"suffixes\":[]},{\"firstnames\":[\"K.\"],\"propositions\":[],\"lastnames\":[\"Meinke\"],\"suffixes\":[]}],\"booktitle\":\"Principles of Declarative Programming\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1490\",\"pages\":\"89–101\",\"publisher\":\"Springer\",\"year\":\"1998\",\"doi\":\"10.1007/bfb0056609\",\"abstract\":\"We show that Jacobs and Langen's domain for set-sharing analysis is isomorphic to the domain of positive Boolean functions, introduced by Marriott and Søndergaard for groundness dependency analysis. Viewing a set-sharing description as a minterm representation of a Boolean function leads to re-casting sharing analysis as an instantiation dependency analysis. The key idea is to view the sets of variables in a sharing domain element as the models of a Boolean function. In this way, sharing sets are precisely dual negated positive Boolean functions. This new view improves our understanding of sharing analysis considerably and opens up new avenues for the efficient implementation of this kind of analysis, for example using ROBDDs. To this end we express Jacobs and Langen's abstract operations for set sharing in logical form.\",\"keywords\":\"Boolean logic, Abstract domains, Abstract interpretation, Logic programming\",\"bibtex\":\"@Inproceedings{Cod-Son_PLILP98,\\n  author    = {Michael Codish and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {The {Boolean} Logic of Set Sharing Analysis},\\n  editor    = {C. Palamidessi and H. Glaser and K. Meinke},\\n  booktitle = {Principles of Declarative Programming},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1490},\\n  pages     = {89--101},\\n  publisher = {Springer},\\n  year      = {1998},\\n  doi       = {10.1007/bfb0056609},\\n  abstract  = {We show that Jacobs and Langen's domain for set-sharing \\n\\t\\tanalysis is isomorphic to the domain of positive Boolean \\n\\t\\tfunctions, introduced by Marriott and S{\\\\o}ndergaard for \\n\\t\\tgroundness dependency analysis. Viewing a set-sharing \\n\\t\\tdescription as a minterm representation of a Boolean \\n\\t\\tfunction leads to re-casting sharing analysis as an\\n\\t\\tinstantiation dependency analysis. The key idea is to \\n\\t\\tview the sets of variables in a sharing domain element \\n\\t\\tas the models of a Boolean function. In this way, sharing \\n\\t\\tsets are precisely dual negated positive Boolean functions. \\n\\t\\tThis new view improves our understanding of sharing \\n\\t\\tanalysis considerably and opens up new avenues for the\\n\\t\\tefficient implementation of this kind of analysis, for \\n\\t\\texample using ROBDDs. To this end we express Jacobs and \\n\\t\\tLangen's abstract operations for set sharing in logical form.},\\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Codish, M.\",\"Søndergaard, H.\"],\"editor_short\":[\"Palamidessi, C.\",\"Glaser, H.\",\"Meinke, K.\"],\"key\":\"Cod-Son_PLILP98\",\"id\":\"Cod-Son_PLILP98\",\"bibbaseid\":\"codish-sndergaard-thebooleanlogicofsetsharinganalysis-1998\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Abstract domains\",\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"J.\",\"Robert\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Cornish\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Analyzing Array Manipulating Programs by Program Transformation\",\"editor\":[{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Proietti\"],\"suffixes\":[]},{\"firstnames\":[\"H.\"],\"propositions\":[],\"lastnames\":[\"Seki\"],\"suffixes\":[]}],\"booktitle\":\"Logic-Based Program Synthesis and Transformation: Proceedings of the 24th International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"8981\",\"pages\":\"3–20\",\"publisher\":\"Springer International\",\"year\":\"2015\",\"doi\":\"10.1007/978-3-319-17822-6_1\",\"abstract\":\"We explore a transformational approach to the problem of verifying simple array-manipulating programs. Traditionally, verification of such programs requires intricate analysis machinery to reason with universally quantified statements about symbolic array segments, such as ``every data item stored in the segment A[i] to A[j] is equal to the corresponding item stored in the segment B[i] to B[j].'' We define a simple abstract machine which allows for set-valued variables and we show how to translate programs with array operations to array-free code for this machine. For the purpose of program analysis, the translated program remains faithful to the semantics of array manipulation. Based on our implementation in LLVM, we evaluate the approach with respect to its ability to extract useful invariants and the cost in terms of code size.\",\"keywords\":\"Program transformation, Static analysis, Array analysis\",\"bibtex\":\"@inproceedings{Cor-Gan-Nav-Sch-Son-Stu_LOPSTR14,\\n  author    = {J. Robert M. Cornish and \\n\\t\\tGraeme Gange and \\n\\t\\tJorge Navas and\\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Analyzing Array Manipulating Programs by Program Transformation},\\n  editor    = {M. Proietti and H. Seki},\\n  booktitle = {Logic-Based Program Synthesis and Transformation:\\n                Proceedings of the 24th International Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {8981},\\n  pages     = {3--20},\\n  publisher = {Springer International},\\n  year      = {2015},\\n  doi       = {10.1007/978-3-319-17822-6_1},\\n  abstract  = {We explore a transformational approach to the problem \\n\\t\\tof verifying simple array-manipulating programs.  \\n\\t\\tTraditionally, verification of such programs requires \\n\\t\\tintricate analysis machinery to reason with universally\\n\\t\\tquantified statements about symbolic array segments, \\n\\t\\tsuch as ``every data item stored in the segment A[i] \\n\\t\\tto A[j] is equal to the corresponding item stored in the\\n\\t\\tsegment B[i] to B[j].'' We define a simple abstract \\n\\t\\tmachine which allows for set-valued variables and we \\n\\t\\tshow how to translate programs with array operations to\\n\\t\\tarray-free code for this machine.  For the purpose of \\n\\t\\tprogram analysis, the translated program remains faithful\\n\\t\\tto the semantics of array manipulation.  Based on our \\n\\t\\timplementation in LLVM, we evaluate the approach with\\n\\t\\trespect to its ability to extract useful invariants and \\n\\t\\tthe cost in terms of code size.},\\n  keywords  = {Program transformation, Static analysis, Array analysis},\\n}\\n\\n\",\"author_short\":[\"Cornish, J. R. M.\",\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Proietti, M.\",\"Seki, H.\"],\"key\":\"Cor-Gan-Nav-Sch-Son-Stu_LOPSTR14\",\"id\":\"Cor-Gan-Nav-Sch-Son-Stu_LOPSTR14\",\"bibbaseid\":\"cornish-gange-navas-schachte-sndergaard-stuckey-analyzingarraymanipulatingprogramsbyprogramtransformation-2015\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program transformation\",\"Static analysis\",\"Array analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roberto\"],\"propositions\":[],\"lastnames\":[\"Cremonini\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A General Theory for Abstraction\",\"editor\":[{\"firstnames\":[\"C.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Tsang\"],\"suffixes\":[]}],\"booktitle\":\"AI '90: Proceedings of the Fourth Australian Joint Conference on Artificial Intelligence\",\"pages\":\"121–134\",\"publisher\":\"World Scientific Publ.\",\"year\":\"1990\",\"abstract\":\"Abstraction is the process of mapping one representation of a problem into another representation so as to simplify reasoning while preserving the essence of the problem. It has been investigated in many different areas of computer science. In artificial intelligence, abstraction is used in automated theorem proving, problem solving, planning, common sense reasoning and qualitative reasoning. In dataflow analysis of programs, it has been formalized in the theory of abstract interpretation. However, the possible connections between research on abstraction in artificial intelligence and dataflow analysis have gone unnoticed until now. This paper investigates these connections and provides a general theory of abstraction for artificial intelligence. In particular, we present a method for building an ``optimal'' abstraction and give general sufficient conditions for the abstraction to be ``safe.'' The usefulness and generality of our theory is illustrated with a number of example applications and by comparisons with related work.\",\"keywords\":\"Abstract interpretation, Artificial intelligence\",\"bibtex\":\"@Inproceedings{Cre-Mar-Son_AI90,\\n  author    = {Roberto Cremonini and \\n\\t\\tKim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {A General Theory for Abstraction},\\n  editor    = {C. P. Tsang},\\n  booktitle = {AI '90: Proceedings of the Fourth Australian Joint Conference on \\n\\t\\t\\tArtificial Intelligence}, \\n  pages     = {121--134},\\n  publisher = {World Scientific Publ.},\\n  year\\t    = {1990},\\n  abstract  = {Abstraction is the process of mapping one representation of \\n\\t\\ta problem into another representation so as to simplify \\n\\t\\treasoning while preserving the essence of the problem.\\n\\t\\tIt has been investigated in many different areas of computer\\n\\t\\tscience. In artificial intelligence, abstraction is used in\\n\\t\\tautomated theorem proving, problem solving, planning, common\\n\\t\\tsense reasoning and qualitative reasoning. In dataflow \\n\\t\\tanalysis of programs, it has been formalized in the theory \\n\\t\\tof abstract interpretation. However, the possible \\n\\t\\tconnections between research on abstraction in artificial \\n\\t\\tintelligence and dataflow analysis have gone unnoticed until\\n\\t\\tnow. This paper investigates these connections and\\n\\t\\tprovides a general theory of abstraction for artificial \\n\\t\\tintelligence. In particular, we present a method for \\n\\t\\tbuilding an ``optimal'' abstraction and give general \\n\\t\\tsufficient conditions for the abstraction to be ``safe.''\\n\\t\\tThe usefulness and generality of our theory is illustrated \\n\\t\\twith a number of example applications and by comparisons \\n\\t\\twith related work.},\\n  keywords  = {Abstract interpretation, Artificial intelligence},\\n}\\n\\n\",\"author_short\":[\"Cremonini, R.\",\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Tsang, C. P.\"],\"key\":\"Cre-Mar-Son_AI90\",\"id\":\"Cre-Mar-Son_AI90\",\"bibbaseid\":\"cremonini-marriott-sndergaard-ageneraltheoryforabstraction-1990\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Artificial intelligence\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Lobel\"],\"propositions\":[],\"lastnames\":[\"Crnogorac\"],\"suffixes\":[]},{\"firstnames\":[\"Andrew\"],\"propositions\":[],\"lastnames\":[\"Kelly\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A Comparison of Three Occur-Check Analysers\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Cousot\"],\"suffixes\":[]},{\"firstnames\":[\"D.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Schmidt\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis: Proceedings of the Third International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1145\",\"pages\":\"159–173\",\"publisher\":\"Springer\",\"year\":\"1996\",\"doi\":\"10.1007/3-540-61739-6_40\",\"abstract\":\"A well known problem with many Prolog interpreters and compilers is the lack of occur-check in the implementation of the unification algorithm. This means that such systems are unsound with respect to first-order predicate logic. Static analysis offers an appealing approach to the problem of occur-check reduction, that is, the safe omission of occur-checks in unification. We compare, for the first time, three static methods that have been suggested for occur-check reduction, two based on assigning ``modes'' to programs and one which uses abstract interpretation. In each case, the analysis or some essential part of it had not been implemented so far. Of the mode-based methods, one is due to Chadha and Plaisted and the other is due to Apt and Pellegrini. The method using abstract interpretation is based on earlier work by Plaisted, Søndergaard and others who have developed groundness and sharing analyses for logic programs. The conclusion is that a truly global analysis based on abstract interpretation leads to markedly higher precision and hence fewer occur-checks at run-time. Given the potential run-time speedups, a precise analysis would be well worth the extra time.\",\"keywords\":\"Abstract interpretation, Groundness analysis, Sharing analysis, Unification, Prolog, Compilation\",\"bibtex\":\"@Inproceedings{Crn-Kel-Son_SAS96,\\n  author    = {Lobel Crnogorac and \\n\\t\\tAndrew Kelly and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {A Comparison of Three Occur-Check Analysers},\\n  editor    = {R. Cousot and D. A. Schmidt},\\n  booktitle = {Static Analysis: Proceedings of the Third International \\n\\t\\tSymposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1145},\\n  pages     = {159--173},\\n  publisher = {Springer},\\n  year      = {1996},\\n  doi       = {10.1007/3-540-61739-6_40},\\n  abstract  = {A well known problem with many Prolog interpreters and compilers\\n\\t\\tis the lack of occur-check in the implementation of the \\n\\t\\tunification algorithm. This means that such systems are unsound\\n\\t\\twith respect to first-order predicate logic. Static analysis \\n\\t\\toffers an appealing approach to the problem of occur-check \\n\\t\\treduction, that is, the safe omission of occur-checks in \\n\\t\\tunification. We compare, for the first time, three static \\n\\t\\tmethods that have been suggested for occur-check reduction, \\n\\t\\ttwo based on assigning ``modes'' to programs and one which \\n\\t\\tuses abstract interpretation. In each case, the analysis or \\n\\t\\tsome essential part of it had not been implemented so far.\\n\\t\\tOf the mode-based methods, one is due to Chadha and Plaisted\\n\\t\\tand the other is due to Apt and Pellegrini. The method using \\n\\t\\tabstract interpretation is based on earlier work by Plaisted, \\n\\t\\tS{\\\\o}ndergaard and others who have developed groundness and \\n\\t\\tsharing analyses for logic programs. The conclusion is that a \\n\\t\\ttruly global analysis based on abstract interpretation leads \\n\\t\\tto markedly higher precision and hence fewer occur-checks at \\n\\t\\trun-time. Given the potential run-time speedups, a precise \\n\\t\\tanalysis would be well worth the extra time.},\\n  keywords  = {Abstract interpretation, Groundness analysis, Sharing analysis, Unification, Prolog, Compilation},\\n}\\n\\n\",\"author_short\":[\"Crnogorac, L.\",\"Kelly, A.\",\"Søndergaard, H.\"],\"editor_short\":[\"Cousot, R.\",\"Schmidt, D. A.\"],\"key\":\"Crn-Kel-Son_SAS96\",\"id\":\"Crn-Kel-Son_SAS96\",\"bibbaseid\":\"crnogorac-kelly-sndergaard-acomparisonofthreeoccurcheckanalysers-1996\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Groundness analysis\",\"Sharing analysis\",\"Unification\",\"Prolog\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Toby\",\"O.\"],\"propositions\":[],\"lastnames\":[\"Davies\"],\"suffixes\":[]},{\"firstnames\":[\"Adrian\",\"R.\"],\"propositions\":[],\"lastnames\":[\"Pearce\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Optimisation and Relaxation for Planning in the Situation Calculus\",\"editor\":[{\"firstnames\":[\"R.\",\"H.\"],\"propositions\":[],\"lastnames\":[\"Bordini\"],\"suffixes\":[]},{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Elkind\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Weiss\"],\"suffixes\":[]},{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Yolum\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2015)\",\"pages\":\"1141–1149\",\"publisher\":\"IFAAMAS\",\"year\":\"2015\",\"url_paper\":\"http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf\",\"abstract\":\"The situation calculus can express rich agent behaviours and goals and facilitates the reduction of complex planning problems to theorem proving. However, in many planning problems, solution quality is critically important, and the achievable quality is not necessarily known in advance. Existing \\\\textscGolog implementations merely search for a \\\\emphlegal plan, typically relying on depth-first search to find an execution. We illustrate where existing strategies will not terminate when quality is considered, and to overcome this limitation we formally introduce the notion of \\\\emphcost to simplify the search for a solution. The main contribution is a new class of relaxations of the planning problem, termed \\\\emphprecondition relaxations, based on Lagrangian relaxation. We show how this facilitates optimisation of a restricted class of \\\\textscGolog programs for which plan existence (under a cost budget) is decidable. It allows for tractably computing relaxations to the planning problem and leads to a general, \\\\emphblackbox, approach to optimally solving multi-agent planning problems without explicit reference to the semantics of interleaved concurrency.\",\"keywords\":\"Planning, Artificial intelligence\",\"bibtex\":\"@inproceedings{Dav-Pea-Stu-Son_AAMAS15,\\n  author    = {Toby O. Davies and \\n\\t\\tAdrian R. Pearce and\\n                Peter J. Stuckey and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Optimisation and Relaxation for Planning in the Situation\\n                Calculus},\\n  editor    = {R. H. Bordini and E. Elkind and G. Weiss and P. Yolum},\\n  booktitle = {Proceedings of the 14th International Conference\\n                on Autonomous Agents and Multiagent Systems (AAMAS 2015)},\\n  pages     = {1141--1149},\\n  publisher = {IFAAMAS},\\n  year      = {2015},  \\n  url_Paper = {http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf},\\n  abstract  = {The situation calculus can express rich agent behaviours and \\n\\t\\tgoals and facilitates the reduction of complex planning \\n\\t\\tproblems to theorem proving. However, in many planning \\n\\t\\tproblems, solution quality is critically important, and the \\n\\t\\tachievable quality is not necessarily known in advance.\\n\\t\\tExisting \\\\textsc{Golog} implementations merely search for a \\n\\t\\t\\\\emph{legal} plan, typically relying on depth-first search to \\n\\t\\tfind an execution. We illustrate where existing strategies \\n\\t\\twill not terminate when quality is considered, and to overcome\\n\\t\\tthis limitation we formally introduce the notion of \\\\emph{cost}\\n\\t\\tto simplify the search for a solution. The main contribution is\\n\\t\\ta new class of relaxations of the planning problem, termed \\n\\t\\t\\\\emph{precondition relaxations}, based on Lagrangian relaxation.\\n\\t\\tWe show how this facilitates optimisation of a restricted class\\n\\t\\tof \\\\textsc{Golog} programs for which plan existence (under a \\n\\t\\tcost budget) is decidable. It allows for tractably computing \\n\\t\\trelaxations to the planning problem and leads to a general, \\n\\t\\t\\\\emph{blackbox}, approach to optimally solving multi-agent \\n\\t\\tplanning problems without explicit reference to the semantics \\n\\t\\tof interleaved concurrency.},\\n  keywords  = {Planning, Artificial intelligence},\\n}\\n\\n\",\"author_short\":[\"Davies, T. O.\",\"Pearce, A. R.\",\"Stuckey, P. J.\",\"Søndergaard, H.\"],\"editor_short\":[\"Bordini, R. H.\",\"Elkind, E.\",\"Weiss, G.\",\"Yolum, P.\"],\"key\":\"Dav-Pea-Stu-Son_AAMAS15\",\"id\":\"Dav-Pea-Stu-Son_AAMAS15\",\"bibbaseid\":\"davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf\"},\"keyword\":[\"Planning\",\"Artificial intelligence\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Toby\",\"O.\"],\"propositions\":[],\"lastnames\":[\"Davies\"],\"suffixes\":[]},{\"firstnames\":[\"Adrian\",\"R.\"],\"propositions\":[],\"lastnames\":[\"Pearce\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Fragment-Based Planning Using Column Generation\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Chien\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Do\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Fern\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Ruml\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 24th International Conference on Automated Planning and Scheduling\",\"pages\":\"83–91\",\"publisher\":\"AAAI\",\"year\":\"2014\",\"url_paper\":\"www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015\",\"doi\":\"10.1609/icaps.v24i1.13628\",\"abstract\":\"We introduce a novel algorithm for temporal planning in \\\\textscGolog using shared resources, and describe the Bulk Freight Rail Scheduling Problem, a motivating example of such a temporal domain. We use the framework of column generation to tackle complex resource constrained temporal planning problems that are beyond the scope of current planning technology by combining: the global view of a linear programming relaxation of the problem; the strength of search in finding action sequences; and the domain knowledge that can be encoded in a \\\\textscGolog program. We show that our approach significantly outperforms state-of-the-art temporal planning and constraint programming approaches in this domain, in addition to existing temporal \\\\textscGolog implementations. We also apply our algorithm to a temporal variant of blocks-world where our decomposition speeds proof of optimality significantly compared to other anytime algorithms. We discuss the potential of the underlying algorithm being applicable to STRIPS planning, with further work.\",\"keywords\":\"Planning, Artificial intelligence\",\"bibtex\":\"@inproceedings{Dav-Pea-Stu-Son_ICAPS14,\\n  author    = {Toby O. Davies and \\n\\t\\tAdrian R. Pearce and\\n                Peter J. Stuckey and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Fragment-Based Planning Using Column Generation},\\n  editor    = {S. Chien and M. Do and A. Fern and W. Ruml},\\n  booktitle = {Proceedings of the 24th International Conference\\n                on Automated Planning and Scheduling},\\n  pages     = {83--91},\\n  publisher = {AAAI},\\n  year      = {2014},  \\n  url_Paper = {www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015},\\n  doi       = {10.1609/icaps.v24i1.13628},\\n  abstract  = {We introduce a novel algorithm for temporal planning in \\n\\t\\t\\\\textsc{Golog} using shared resources, and describe the \\n\\t\\tBulk Freight Rail Scheduling Problem, a motivating example\\n\\t\\tof such a temporal domain. We use the framework of column \\n\\t\\tgeneration to tackle complex resource constrained temporal \\n\\t\\tplanning problems that are beyond the scope of current planning\\n\\t\\ttechnology by combining: the global view of a linear programming\\n\\t\\trelaxation of the problem; the strength of search in finding \\n\\t\\taction sequences; and the domain knowledge that can be encoded \\n\\t\\tin a \\\\textsc{Golog} program. We show that our approach \\n\\t\\tsignificantly outperforms state-of-the-art temporal planning \\n\\t\\tand constraint programming approaches in this domain, in \\n\\t\\taddition to existing temporal \\\\textsc{Golog} implementations.\\n\\t\\tWe also apply our algorithm to a temporal variant of \\n\\t\\tblocks-world where our decomposition speeds proof of optimality\\n\\t\\tsignificantly compared to other anytime algorithms. We discuss \\n\\t\\tthe potential of the underlying algorithm being applicable to\\n\\t\\tSTRIPS planning, with further work.},\\n  keywords  = {Planning, Artificial intelligence},\\n}\\n\\n\",\"author_short\":[\"Davies, T. O.\",\"Pearce, A. R.\",\"Stuckey, P. J.\",\"Søndergaard, H.\"],\"editor_short\":[\"Chien, S.\",\"Do, M.\",\"Fern, A.\",\"Ruml, W.\"],\"key\":\"Dav-Pea-Stu-Son_ICAPS14\",\"id\":\"Dav-Pea-Stu-Son_ICAPS14\",\"bibbaseid\":\"davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014\",\"role\":\"author\",\"urls\":{\" paper\":\"people.eng.unimelb.edu.au/harald/www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015\"},\"keyword\":[\"Planning\",\"Artificial intelligence\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Davis\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltan\"],\"propositions\":[],\"lastnames\":[\"Somogyi\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Towards Region Based Memory Management for Go\",\"booktitle\":\"Proceedings of the 2012 ACM Workshop on Memory Systems Performance and Correctness (MSPC 2012)\",\"pages\":\"58–67\",\"publisher\":\"ACM Press\",\"year\":\"2012\",\"doi\":\"10.1145/2247684.2247695\",\"abstract\":\"Region-based memory management aims to lower the cost of deallocation through bulk processing: instead of recovering the memory of each object separately, it recovers the memory of a region containing many objects. It relies on static analysis to determinethe set of memory regions needed by a program, the program points at which each region should be created and removed, and, for each memory allocation, the region that should supply the memory. The concurrent language Go has features that pose interesting challenges for this analysis. We present a novel design for region-based memory management for Go, combining static analysis, to guide region creation, and lightweight runtime bookkeeping, to help control reclamation. The main advantage of our approach is that it greatly limits the amount of re-work that must be done after eachchange to the program source code, making our approach more practical than existing RBMM systems. Our prototype implementation covers most of the sequential fragment of Go, and preliminary results are encouraging.\",\"keywords\":\"Memory management, Go\",\"bibtex\":\"@Inproceedings{Dav-Sch-Som-Son_MSPC12,\\n  author    = {Matthew Davis and \\n\\t\\tPeter Schachte and \\n\\t\\tZoltan Somogyi and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Towards Region Based Memory Management for {Go}},\\n  booktitle = {Proceedings of the 2012 ACM Workshop on Memory Systems \\n\\t\\tPerformance and Correctness (MSPC 2012)},\\n  pages     = {58--67},\\n  publisher = {ACM Press},\\n  year      = {2012},\\n  doi       = {10.1145/2247684.2247695},\\n  abstract  = {Region-based memory management aims to lower the cost of \\n\\t\\tdeallocation through bulk processing: instead of \\n\\t\\trecovering the memory of each object separately, it\\n\\t\\trecovers the memory of a region containing many objects.\\n\\t\\tIt relies on static analysis to determinethe set of \\n\\t\\tmemory regions needed by a program, the program points at\\n\\t\\twhich each region should be created and removed, and, for\\n\\t\\teach memory allocation, the region that should supply the\\n\\t\\tmemory.  The concurrent language Go has features that pose\\n\\t\\tinteresting challenges for this analysis.  We present a \\n\\t\\tnovel design for region-based memory management for Go,\\n\\t\\tcombining static analysis, to guide region creation, and\\n\\t\\tlightweight runtime bookkeeping, to help control \\n\\t\\treclamation.  The main advantage of our approach is that\\n\\t\\tit greatly limits the amount of re-work that must be done\\n\\t\\tafter eachchange to the program source code, making our\\n\\t\\tapproach more practical than existing RBMM systems.  Our\\n\\t\\tprototype implementation covers most of the sequential\\n\\t\\tfragment of Go, and preliminary results are encouraging.},\\n  keywords  = {Memory management, Go},\\n}\\n\\n\",\"author_short\":[\"Davis, M.\",\"Schachte, P.\",\"Somogyi, Z.\",\"Søndergaard, H.\"],\"key\":\"Dav-Sch-Som-Son_MSPC12\",\"id\":\"Dav-Sch-Som-Son_MSPC12\",\"bibbaseid\":\"davis-schachte-somogyi-sndergaard-towardsregionbasedmemorymanagementforgo-2012\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Memory management\",\"Go\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Davis\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltan\"],\"propositions\":[],\"lastnames\":[\"Somogyi\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A Low Overhead Method for Recovering Unused Memory Inside Regions\",\"booktitle\":\"Proceedings of the 2013 ACM Workshop on Memory Systems Performance and Correctness (MSPC 2013)\",\"publisher\":\"ACM Press\",\"year\":\"2013\",\"doi\":\"10.1145/2492408.2492415\",\"abstract\":\"Automating memory management improves both resource safety and programmer productivity. One approach, region-based memory management (RBMM), applies compile-time reasoning to identify points in a program at which memory can be safely reclaimed. The main advantage of RBMM over traditional garbage collection (GC) is the avoidance of expensive runtime analysis, which makes reclaiming memory much faster. On the other hand, GC requires no static analysis, and, operating at runtime, can have significantly more accurate information about object lifetimes. In this paper we propose a hybrid system that seeks to combine the advantages of both methods while avoiding the overheads that previous hybrid systems incurred. Our system can also reclaim array segments whose elements are no longer reachable.\",\"keywords\":\"Memory management, Compilation, Go\",\"bibtex\":\"@Inproceedings{Dav-Sch-Som-Son_MSPC13,\\n  author    = {Matthew Davis and \\n\\t\\tPeter Schachte and \\n\\t\\tZoltan Somogyi and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {A Low Overhead Method for Recovering Unused Memory \\n\\t\\tInside Regions},\\n  booktitle = {Proceedings of the 2013 ACM Workshop on Memory Systems \\n\\t\\tPerformance and Correctness (MSPC 2013)},\\n  publisher = {ACM Press},\\n  year      = {2013},\\n  doi       = {10.1145/2492408.2492415},\\n  abstract  = {Automating memory management improves both resource safety\\n\\t\\tand programmer productivity.  One approach, region-based\\n\\t\\tmemory management (RBMM), applies compile-time reasoning\\n\\t\\tto identify points in a program at which memory can be \\n\\t\\tsafely reclaimed.  The main advantage of RBMM over \\n\\t\\ttraditional garbage collection (GC) is the avoidance of \\n\\t\\texpensive runtime analysis, which makes reclaiming memory\\n\\t\\tmuch faster.  On the other hand, GC requires no static \\n\\t\\tanalysis, and, operating at runtime, can have \\n\\t\\tsignificantly more accurate information about object \\n\\t\\tlifetimes.  In this paper we propose a hybrid system\\n\\t\\tthat seeks to combine the advantages of both methods\\n\\t\\twhile avoiding the overheads that previous hybrid systems\\n\\t\\tincurred.  Our system can also reclaim array segments \\n\\t\\twhose elements are no longer reachable.},\\n  keywords  = {Memory management, Compilation, Go},\\n}\\n\\n\",\"author_short\":[\"Davis, M.\",\"Schachte, P.\",\"Somogyi, Z.\",\"Søndergaard, H.\"],\"key\":\"Dav-Sch-Som-Son_MSPC13\",\"id\":\"Dav-Sch-Som-Son_MSPC13\",\"bibbaseid\":\"davis-schachte-somogyi-sndergaard-alowoverheadmethodforrecoveringunusedmemoryinsideregions-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Memory management\",\"Compilation\",\"Go\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Farrugia-Roberts\"],\"suffixes\":[]},{\"firstnames\":[\"Bryn\"],\"propositions\":[],\"lastnames\":[\"Jeffries\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Programming to Learn: Logic and Computation from a Programming Perspective\",\"booktitle\":\"Proceedings of the 27th Annual Conference on Innovation and Technology in Computer Science Education\",\"pages\":\"311–317\",\"publisher\":\"Association for Computing Machinery\",\"address\":\"New York, NY\",\"year\":\"2022\",\"doi\":\"10.1145/3502718.3524814\",\"abstract\":\"Programming problems are commonly used as a learning and assessment activity for learning to program. We believe that programming problems can be effective for broader learning goals. In our large-enrolment course, we have designed special programming problems relevant to logic, discrete mathematics, and the theory of computation, and we have used them for formative and summative assessment. In this report, we reflect on our experience. We aim to leverage our students' programming backgrounds by offering a code-based formalism for our mathematical syllabus. We find we can translate many traditional questions into programming problems of a special kind—calling for `programs' as simple as a single expression, such as a formula or automaton represented in code. A web-based platform enables self-paced learning with rapid contextual corrective feedback, and helps us scale summative assessment to the size of our cohort. We identify several barriers arising with our approach and discuss how we have attempted to negate them. We highlight the potential of programming problems as a digital learning activity even beyond a logic and computation course.\",\"keywords\":\"Education, Web-based learning\",\"bibtex\":\"@InProceedings{Far-Jef-Son_ITiCSE22,\\n  author    = {Matthew Farrugia-Roberts and\\n\\t\\tBryn Jeffries and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Programming to Learn:\\n\\t\\tLogic and Computation from a Programming Perspective},\\n  booktitle = {Proceedings of the 27th Annual Conference on Innovation and \\n\\t\\tTechnology in Computer Science Education},\\n  pages     = {311--317},\\n  publisher = {Association for Computing Machinery},\\n  address   = {New York, NY},\\n  year      = {2022},\\n  doi       = {10.1145/3502718.3524814},\\n  abstract  = {Programming problems are commonly used as a learning and \\n\\t\\tassessment activity for learning to program. We believe\\n\\t\\tthat programming problems can be effective for broader \\n\\t\\tlearning goals. In our large-enrolment course, we have \\n\\t\\tdesigned special programming problems relevant to logic, \\n\\t\\tdiscrete mathematics, and the theory of computation, and \\n\\t\\twe have used them for formative and summative assessment.\\n\\t\\tIn this report, we reflect on our experience. We aim to \\n\\t\\tleverage our students' programming backgrounds by offering\\n\\t\\ta code-based formalism for our mathematical syllabus.\\n\\t\\tWe find we can translate many traditional questions into \\n\\t\\tprogramming problems of a special kind---calling for \\n\\t\\t`programs' as simple as a single expression, such as a \\n\\t\\tformula or automaton represented in code. A web-based \\n\\t\\tplatform enables self-paced learning with rapid contextual\\n\\t\\tcorrective feedback, and helps us scale summative \\n\\t\\tassessment to the size of our cohort. We identify several \\n\\t\\tbarriers arising with our approach and discuss how we have\\n\\t\\tattempted to negate them. We highlight the potential of \\n\\t\\tprogramming problems as a digital learning activity even \\n\\t\\tbeyond a logic and computation course.},\\n  keywords  = {Education, Web-based learning},\\n}\\n\\n\",\"author_short\":[\"Farrugia-Roberts, M.\",\"Jeffries, B.\",\"Søndergaard, H.\"],\"key\":\"Far-Jef-Son_ITiCSE22\",\"id\":\"Far-Jef-Son_ITiCSE22\",\"bibbaseid\":\"farrugiaroberts-jeffries-sndergaard-programmingtolearnlogicandcomputationfromaprogrammingperspective-2022\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Web-based learning\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Matthew\"],\"propositions\":[],\"lastnames\":[\"Farrugia-Roberts\"],\"suffixes\":[]},{\"firstnames\":[\"Bryn\"],\"propositions\":[],\"lastnames\":[\"Jeffries\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Teaching Simple Constructive Proofs with Haskell Programs\",\"editor\":[{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Achten\"],\"suffixes\":[]},{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"Machkasova\"],\"suffixes\":[]}],\"booktitle\":\"Trends in Functional Programming in Education (TFPIE)\",\"series\":\"Electronic Proceedings in Theoretical Computer Science\",\"volume\":\"363\",\"pages\":\"54–73\",\"year\":\"2022\",\"url_paper\":\"https://arxiv.org/abs/2208.04699v1\",\"doi\":\"10.4204/EPTCS.363.4\",\"abstract\":\"In recent years we have explored using Haskell alongside a traditional mathematical formalism in our large-enrolment university course on topics including logic and formal languages, aiming to offer our students a programming perspective on these mathematical topics. We have found it possible to offer almost all formative and summative assessment through an interactive learning platform, using Haskell as a lingua franca for digital exercises across our broad syllabus. One of the hardest exercises to convert into this format are traditional written proofs conveying constructive arguments. In this paper we reflect on the digitisation of this kind of exercise. We share many examples of Haskell exercises designed to target similar skills to written proof exercises across topics in propositional logic and formal languages, discussing various aspects of the design of such exercises. We also catalogue a sample of student responses to such exercises. This discussion contributes to our broader exploration of programming problems as a flexible digital medium for learning and assessment.\",\"keywords\":\"Education, Web-based learning, Haskell\",\"bibtex\":\"@InProceedings{Far-Jef-Son_TFPIE21,\\n  author    = {Matthew Farrugia-Roberts and\\n\\t\\tBryn Jeffries and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Teaching Simple Constructive Proofs with {Haskell} Programs},\\n  editor    = {P. Achten and E. Machkasova},\\n  booktitle = {Trends in Functional Programming in Education (TFPIE)},\\n  series    = {Electronic Proceedings in Theoretical Computer Science},\\n  volume    = {363},\\n  pages     = {54--73},\\n  year      = {2022},\\n  url_Paper       = {https://arxiv.org/abs/2208.04699v1},\\n  doi       = {10.4204/EPTCS.363.4},\\n  abstract  = {In recent years we have explored using Haskell alongside a\\n\\t\\ttraditional mathematical formalism in our large-enrolment \\n\\t\\tuniversity course on topics including logic and formal \\n\\t\\tlanguages, aiming to offer our students a programming \\n\\t\\tperspective on these mathematical topics. We have found it \\n\\t\\tpossible to offer almost all formative and summative \\n\\t\\tassessment through an interactive learning platform, using \\n\\t\\tHaskell as a lingua franca for digital exercises across our \\n\\t\\tbroad syllabus. One of the hardest exercises to convert \\n\\t\\tinto this format are traditional written proofs conveying \\n\\t\\tconstructive arguments. In this paper we reflect on the \\n\\t\\tdigitisation of this kind of exercise. We share many examples\\n\\t\\tof Haskell exercises designed to target similar skills to \\n\\t\\twritten proof exercises across topics in propositional logic \\n\\t\\tand formal languages, discussing various aspects of the design \\n\\t\\tof such exercises. We also catalogue a sample of student \\n\\t\\tresponses to such exercises. This discussion contributes to \\n\\t\\tour broader exploration of programming problems as a flexible\\n\\t\\tdigital medium for learning and assessment.},\\n  keywords  = {Education, Web-based learning, Haskell},\\n}\\n\\n\",\"author_short\":[\"Farrugia-Roberts, M.\",\"Jeffries, B.\",\"Søndergaard, H.\"],\"editor_short\":[\"Achten, P.\",\"Machkasova, E.\"],\"key\":\"Far-Jef-Son_TFPIE21\",\"id\":\"Far-Jef-Son_TFPIE21\",\"bibbaseid\":\"farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022\",\"role\":\"author\",\"urls\":{\" paper\":\"https://arxiv.org/abs/2208.04699v1\"},\"keyword\":[\"Education\",\"Web-based learning\",\"Haskell\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Tihomir\"],\"propositions\":[],\"lastnames\":[\"Gabrić\"],\"suffixes\":[]},{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Glynn\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Strictness Analysis as Finite-Domain Constraint Solving\",\"editor\":[{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Flener\"],\"suffixes\":[]}],\"booktitle\":\"Logic-Based Program Synthesis and Transformation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1559\",\"pages\":\"255–270\",\"publisher\":\"Springer\",\"address\":\"Berlin, Germany\",\"year\":\"1999\",\"doi\":\"10.1007/3-540-48958-4_14\",\"abstract\":\"It has become popular to express dataflow analyses in logical form. In this paper we investigate a new approach to the analysis of functional programs, based on synthesis of constraint logic programs. We sketch how the language Toupie, originally designed with logic program analysis as one objective, lends itself also to sophisticated strictness analysis. Strictness analysis is straightforward in the simplest case, that of analysing a first-order functional language using just two strictness values, namely divergence and ``don't know''. Mycroft's classical translation immediately yields perfectly valid Boolean constraint logic programs, which, when run, provide the desired strictness information. However, more sophisticated analysis requires more complex domains of strictness values. We recast Wadler's classical analysis over a $2n$-point domain as finite-domain constraint solving. This approach has several advantages. First, the translation is relatively simple. We translate a recursive function definition into one or two constraint program clauses, in a manner which naturally extends Mycroft's translation for the 2-point case, where the classical approach translate the definition of an $n$-place function over lists into $4^n$ mutually recursive equations. Second, the resulting program produces \\\\emphrelational information, allowing for example to ask which combinations of properties of input will produce a given output. Third, the approach allows us to leverage from established technology, for solving finite-domain constraints, as well as for finding fixed points. Finally, the use of (disjunctive) constraints can yield a higher precision in the analysis of some programs.\",\"keywords\":\"Strictness analysis, Abstract interpretation, Abstract domains, Functional programming, Constraint programming\",\"bibtex\":\"@InProceedings{Gab-Gly-Son_LOPSTR98,\\n  author    = {Tihomir Gabri{\\\\'c} and \\n\\t\\tKevin Glynn and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Strictness Analysis as Finite-Domain Constraint Solving},\\n  editor    = {P. Flener},\\n  booktitle = {Logic-Based Program Synthesis and Transformation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1559},\\n  pages     = {255--270},\\n  publisher = {Springer},\\n  address   = {Berlin, Germany},\\n  year      = {1999},\\n  doi       = {10.1007/3-540-48958-4_14},\\n  abstract  = {It has become popular to express dataflow analyses in logical \\n\\t\\tform. In this paper we investigate a new approach to the \\n\\t\\tanalysis of functional programs, based on synthesis of \\n\\t\\tconstraint logic programs. We sketch how the language Toupie,\\n\\t\\toriginally designed with logic program analysis as one \\n\\t\\tobjective, lends itself also to sophisticated strictness \\n\\t\\tanalysis. Strictness analysis is straightforward in the \\n\\t\\tsimplest case, that of analysing a first-order functional \\n\\t\\tlanguage using just two strictness values, namely divergence \\n\\t\\tand ``don't know''. Mycroft's classical translation immediately\\n\\t\\tyields perfectly valid Boolean constraint logic programs, \\n\\t\\twhich, when run, provide the desired strictness information.\\n\\t\\tHowever, more sophisticated analysis requires more complex \\n\\t\\tdomains of strictness values. We recast Wadler's classical \\n\\t\\tanalysis over a $2n$-point domain as finite-domain \\n\\t\\tconstraint solving. This approach has several advantages.\\n\\t\\tFirst, the translation is relatively simple. We translate a \\n\\t\\trecursive function definition into one or two constraint \\n\\t\\tprogram clauses, in a manner which naturally extends Mycroft's\\n\\t\\ttranslation for the 2-point case, where the classical approach\\n\\t\\ttranslate the definition of an $n$-place function over lists \\n\\t\\tinto $4^n$ mutually recursive equations. Second, the resulting \\n\\t\\tprogram produces \\\\emph{relational} information, allowing for \\n\\t\\texample to ask which combinations of properties of input will \\n\\t\\tproduce a given output. Third, the approach allows us to \\n\\t\\tleverage from established technology, for solving finite-domain \\n\\t\\tconstraints, as well as for finding fixed points. Finally, the\\n\\t\\tuse of (disjunctive) constraints can yield a higher precision \\n\\t\\tin the analysis of some programs.},\\n  keywords  = {Strictness analysis, Abstract interpretation, Abstract domains, Functional programming, Constraint programming},\\n}\\n\\n\",\"author_short\":[\"Gabrić, T.\",\"Glynn, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Flener, P.\"],\"key\":\"Gab-Gly-Son_LOPSTR98\",\"id\":\"Gab-Gly-Son_LOPSTR98\",\"bibbaseid\":\"gabri-glynn-sndergaard-strictnessanalysisasfinitedomainconstraintsolving-1999\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Strictness analysis\",\"Abstract interpretation\",\"Abstract domains\",\"Functional programming\",\"Constraint programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Benjamin\"],\"propositions\":[],\"lastnames\":[\"Horsfall\"],\"suffixes\":[]},{\"firstnames\":[\"Lee\"],\"propositions\":[],\"lastnames\":[\"Naish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Four-Valued Reasoning and Cyclic Circuits\",\"journal\":\"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\",\"volume\":\"33\",\"number\":\"7\",\"pages\":\"1003–1016\",\"month\":\"july\",\"year\":\"2014\",\"url_paper\":\"http://dx.doi.org/10.1109/TCAD.2014.2304176\",\"doi\":\"10.1109/TCAD.2014.2304176\",\"abstract\":\"Allowing cycles in a logic circuit can be advantageous, for example, by reducing the number of gates required to implement a given Boolean function, or set of functions. However, a cyclic circuit may easily be ill-behaved. For instance it may have some output wire oscillate instead of reaching a steady state. Propositional three-valued logic has long been used in tests for well-behaviour of cyclic circuits: a symbolic evaluation method known as ternary analysis provides one criterion for well-behaviour under certain assumptions about wire and gate delay. We revisit ternary analysis and argue for the use of four truth values. The fourth truth value allows for the distinction of ``undefined'' and ``underspecified'' behaviour. Ability to under-specify behaviour is useful, because, in a quest for smaller circuits, an implementor can capitalize on degrees of freedom offered in the specification. Moreover, a fourth truth value is attractive because, rather than complicating (ternary) circuit analysis, it introduces a pleasant symmetry, in the form of contra-duality, as well as providing a convenient framework for manipulating specifications. We use this symmetry to provide fixed point results that clarify how two-, three-, and four-valued analyses are related, and to explain some observations about ternary analysis.\",\"keywords\":\"Fixed points, Many-valued logic, Logic circuits, Circuit synthesis\",\"bibtex\":\"@article{Gan-Hor-Nai-Son_TCAD14,\\n  author    = {Graeme Gange and \\n\\t\\tBenjamin Horsfall and \\n\\t\\tLee Naish and\\n                Harald S{\\\\o}ndergaard},\\n  title     = {Four-Valued Reasoning and Cyclic Circuits},\\n  journal   = {IEEE Transactions on Computer-Aided Design of Integrated\\n                Circuits and Systems},\\n  volume    = {33},\\n  number    = {7},\\n  pages     = {1003--1016},\\n  month     = {july},\\n  year      = {2014},\\n  url_Paper = {http://dx.doi.org/10.1109/TCAD.2014.2304176},\\n  doi       = {10.1109/TCAD.2014.2304176},\\n  abstract  = {Allowing cycles in a logic circuit can be advantageous,\\n\\t\\tfor example, by reducing the number of gates required to \\n\\t\\timplement a given Boolean function, or set of functions.\\n\\t\\tHowever, a cyclic circuit may easily be ill-behaved.\\n\\t\\tFor instance it may have some output wire oscillate \\n\\t\\tinstead of reaching a steady state.  Propositional \\n\\t\\tthree-valued logic has long been used in tests for\\n\\t\\twell-behaviour of cyclic circuits: a symbolic evaluation \\n\\t\\tmethod known as ternary analysis provides one criterion \\n\\t\\tfor well-behaviour under certain assumptions about wire \\n\\t\\tand gate delay.  We revisit ternary analysis and argue \\n\\t\\tfor the use of four truth values.  The fourth truth \\n\\t\\tvalue allows for the distinction of ``undefined'' and\\n\\t\\t``underspecified'' behaviour.  Ability to under-specify \\n\\t\\tbehaviour is useful, because, in a quest for smaller \\n\\t\\tcircuits, an implementor can capitalize on degrees of \\n\\t\\tfreedom offered in the specification.  Moreover, a fourth\\n\\t\\ttruth value is attractive because, rather than complicating\\n\\t\\t(ternary) circuit analysis, it introduces a pleasant \\n\\t\\tsymmetry, in the form of contra-duality, as well as \\n\\t\\tproviding a convenient framework for manipulating\\n\\t\\tspecifications.  We use this symmetry to provide fixed \\n\\t\\tpoint results that clarify how two-, three-, and four-valued\\n\\t\\tanalyses are related, and to explain some observations about\\n\\t\\tternary analysis.},\\n  keywords  = {Fixed points, Many-valued logic, Logic circuits, Circuit synthesis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Horsfall, B.\",\"Naish, L.\",\"Søndergaard, H.\"],\"key\":\"Gan-Hor-Nai-Son_TCAD14\",\"id\":\"Gan-Hor-Nai-Son_TCAD14\",\"bibbaseid\":\"gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014\",\"role\":\"author\",\"urls\":{\" paper\":\"http://dx.doi.org/10.1109/TCAD.2014.2304176\"},\"keyword\":[\"Fixed points\",\"Many-valued logic\",\"Logic circuits\",\"Circuit synthesis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Zequn\"],\"propositions\":[],\"lastnames\":[\"Ma\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Fresh Look at Zones and Octagons\",\"journal\":\"ACM Transactions on Programming Languages and Systems\",\"volume\":\"43\",\"number\":\"3\",\"pages\":\"11:1–11:51\",\"year\":\"2021\",\"doi\":\"10.1145/3457885\",\"abstract\":\"Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numerical relations that hold between pairs of program variables. Both domains are well understood mathematically but the detailed implementation of static analyses based on these domains poses many interesting algorithmic challenges. In this paper we study the two abstract domains, their implementation and use. Utilizing improved data structures and algorithms for the manipulation of graphs that represent difference-bound constraints, we present fast implementations of both abstract domains, built around a common infrastructure. We compare the performance of these implementations against alternative approaches offering the same analysis precision. We quantify the differences in performance by measuring their speed and precision on standard benchmarks. We also assess, in the context of software verification, the extent to which the improved precision translates to better verification outcomes. Experiments demonstrate that our new implementations improve the state-of-the-art for both Zones and Octagons significantly.\",\"keywords\":\"Abstract domains, Abstract interpretation, Static analysis\",\"bibtex\":\"@article{Gan-Ma-Nav-Sch-Son-Stu_TOPLAS21,\\n  author    = {Graeme Gange and\\n                Zequn Ma and\\n                Jorge A. Navas and\\n                Peter Schachte and\\n                Harald S{\\\\o}ndergaard and\\n                Peter J. Stuckey},\\n  title     = {A Fresh Look at {Zones} and {Octagons}},\\n  journal   = {ACM Transactions on Programming Languages and Systems},\\n  volume    = {43},\\n  number    = {3},\\n  pages     = {11:1--11:51},\\n  year      = {2021},\\n  doi       = {10.1145/3457885},\\n  abstract  = {Zones and Octagons are popular abstract domains for \\n\\t\\tstatic program analysis. They enable the automated \\n\\t\\tdiscovery of simple numerical relations that hold \\n\\t\\tbetween pairs of program variables. Both domains \\n\\t\\tare well understood mathematically but the detailed \\n\\t\\timplementation of static analyses based on these \\n\\t\\tdomains poses many interesting algorithmic challenges. \\n\\t\\tIn this paper we study the two abstract domains, their \\n\\t\\timplementation and use. Utilizing improved data \\n\\t\\tstructures and algorithms for the manipulation of \\n\\t\\tgraphs that represent difference-bound constraints, \\n\\t\\twe present fast implementations of both abstract domains, \\n\\t\\tbuilt around a common infrastructure. We compare the \\n\\t\\tperformance of these implementations against alternative \\n\\t\\tapproaches offering the same analysis precision. We \\n\\t\\tquantify the differences in performance by measuring \\n\\t\\ttheir speed and precision on standard benchmarks. We \\n\\t\\talso assess, in the context of software verification, \\n\\t\\tthe extent to which the improved precision translates \\n\\t\\tto better verification outcomes. Experiments demonstrate \\n\\t\\tthat our new implementations improve the state-of-the-art \\n\\t\\tfor both Zones and Octagons significantly.},\\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Ma, Z.\",\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Ma-Nav-Sch-Son-Stu_TOPLAS21\",\"id\":\"Gan-Ma-Nav-Sch-Son-Stu_TOPLAS21\",\"bibbaseid\":\"gange-ma-navas-schachte-sndergaard-stuckey-afreshlookatzonesandoctagons-2021\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Static analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Dissecting Widening: Separating Termination from Information\",\"editor\":[{\"firstnames\":[\"A.\",\"W.\"],\"propositions\":[],\"lastnames\":[\"Lin\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 17th Asian Symposium on Programming Languages and Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"11893\",\"pages\":\"95–114\",\"publisher\":\"Springer\",\"year\":\"2019\",\"doi\":\"10.1007/978-3-030-34175-6_6\",\"abstract\":\"Widening ensures or accelerates convergence of a program analysis, and sometimes contributes a guarantee of soundness that would otherwise be absent. In this paper we propose a generalised view of widening, in which widening operates on values that are not necessarily elements of the given abstract domain, although they must be in a correspondence, the details of which we spell out. We show that the new view generalizes the traditional view, and that at least three distinct advantages flow from the generalization. First, it gives a handle on ``compositional safety'', the problem of creating widening operators for product domains. Second, it adds a degree of flexibility, allowing us to define variants of widening, such as delayed widening, without resorting to intrusive surgery on an underlying fixpoint engine. Third, it adds a degree of robustness, by making it difficult for an analysis implementor to make certain subtle (syntactic vs semantic) category mistakes. The paper supports these claims with examples. Our proposal has been implemented in a state-of-the-art abstract interpreter, and we briefly report on the changes that the revised view necessitated.\",\"keywords\":\"Fixed points, Abstract domains, Abstract interpretation, Widening\",\"bibtex\":\"@InProceedings{Gan-Nav-Sch-Son-Stu_APLAS19,\\n  author    = {Graeme Gange and \\n\\t\\tJorge A. Navas and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Dissecting Widening: Separating Termination from Information},\\n  editor    = {A. W. Lin},\\n  booktitle = {Proceedings of the 17th Asian Symposium on Programming \\n\\t\\tLanguages and Systems},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {11893},\\n  pages     = {95--114},\\n  publisher = {Springer},\\n  year      = {2019},\\n  doi       = {10.1007/978-3-030-34175-6_6},\\n  abstract  = {Widening ensures or accelerates convergence of a program \\n\\t\\tanalysis, and sometimes contributes a guarantee of soundness \\n\\t\\tthat would otherwise be absent. In this paper we propose a \\n\\t\\tgeneralised view of widening, in which widening operates on \\n\\t\\tvalues that are not necessarily elements of the given abstract\\n\\t\\tdomain, although they must be in a correspondence, the details\\n\\t\\tof which we spell out. We show that the new view generalizes \\n\\t\\tthe traditional view, and that at least three distinct \\n\\t\\tadvantages flow from the generalization. First, it gives a \\n\\t\\thandle on ``compositional safety'', the problem of creating \\n\\t\\twidening operators for product domains. Second, it adds a \\n\\t\\tdegree of flexibility, allowing us to define variants of \\n\\t\\twidening, such as delayed widening, without resorting to \\n\\t\\tintrusive surgery on an underlying fixpoint engine.  Third, \\n\\t\\tit adds a degree of robustness, by making it difficult for\\n\\t\\tan analysis implementor to make certain subtle (syntactic vs \\n\\t\\tsemantic) category mistakes. The paper supports these claims \\n\\t\\twith examples. Our proposal has been implemented in a \\n\\t\\tstate-of-the-art abstract interpreter, and we briefly report \\n\\t\\ton the changes that the revised view necessitated.},\\n  keywords  = {Fixed points, Abstract domains, Abstract interpretation, Widening},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Lin, A. W.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_APLAS19\",\"id\":\"Gan-Nav-Sch-Son-Stu_APLAS19\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-dissectingwideningseparatingterminationfrominformation-2019\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Fixed points\",\"Abstract domains\",\"Abstract interpretation\",\"Widening\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"misc\",\"type\":\"misc\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Partial-Order Approach to Array Content Analysis\",\"note\":\"ArXiv preprint https://arxiv.org/abs/1408.1754\",\"year\":\"2014\",\"doi\":\"10.48550/arxiv.1408.1754\",\"abstract\":\"We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and Sagiv, and of Halbwachs and Peron. However, it introduces a novel concept of an array content graph, avoiding the need for an up-front factorial partitioning step. The resulting analysis can be used with arbitrary numeric relational abstract domains; we evaluate the domain on a range of array manipulating program fragments.\",\"keywords\":\"Abstract domains, Array analysis\",\"bibtex\":\"@misc{Gan-Nav-Sch-Son-Stu_ArXiv14,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Partial-Order Approach to Array Content Analysis},\\n  note      = {ArXiv preprint {https://arxiv.org/abs/1408.1754}},\\n  year      = {2014},\\n  doi       = {10.48550/arxiv.1408.1754},\\n  abstract  = {We present a parametric abstract domain for array content \\n\\t\\tanalysis. The method maintains invariants for contiguous \\n\\t\\tregions of the array, similar to the methods of Gopan, Reps \\n\\t\\tand Sagiv, and of Halbwachs and Peron. However, it introduces \\n\\t\\ta novel concept of an array content graph, avoiding the need \\n\\t\\tfor an up-front factorial partitioning step. The resulting \\n\\t\\tanalysis can be used with arbitrary numeric relational \\n\\t\\tabstract domains; we evaluate the domain on a range of \\n\\t\\tarray manipulating program fragments.},\\n  keywords  = {Abstract domains, Array analysis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_ArXiv14\",\"id\":\"Gan-Nav-Sch-Son-Stu_ArXiv14\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-apartialorderapproachtoarraycontentanalysis-2014\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Array analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Tool for Intersecting Context-Free Grammars and Its Applications\",\"editor\":[{\"firstnames\":[\"K.\"],\"propositions\":[],\"lastnames\":[\"Havelund\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Holzmann\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Joshi\"],\"suffixes\":[]}],\"booktitle\":\"NASA Formal Methods: Proceedings of the Seventh International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9058\",\"pages\":\"422–428\",\"publisher\":\"Springer\",\"year\":\"2015\",\"doi\":\"10.1007/978-3-319-17524-9\",\"abstract\":\"This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.\",\"keywords\":\"String analysis, Formal languages, Program verification\",\"bibtex\":\"@inproceedings{Gan-Nav-Sch-Son-Stu_NFM15,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Tool for Intersecting Context-Free Grammars and Its\\n                Applications},\\n  editor    = {K. Havelund and G. Holzmann and R. Joshi},\\n  booktitle = {NASA Formal Methods:\\n                Proceedings of the Seventh International Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {9058},\\n  pages     = {422--428},\\n  publisher = {Springer},\\n  year      = {2015},\\n  doi       = {10.1007/978-3-319-17524-9},\\n  abstract  = {This paper describes a tool for intersecting context-free\\n\\t\\tgrammars. Since this problem is undecidable the tool \\n\\t\\tfollows a refinement-based approach and implements a \\n\\t\\tnovel refinement which is complete for regularly \\n\\t\\tseparable grammars. We show its effectiveness for safety\\n\\t\\tverification of recursive multi-threaded programs.},\\n  keywords  = {String analysis, Formal languages, Program verification},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Havelund, K.\",\"Holzmann, G.\",\"Joshi, R.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_NFM15\",\"id\":\"Gan-Nav-Sch-Son-Stu_NFM15\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-atoolforintersectingcontextfreegrammarsanditsapplications-2015\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"String analysis\",\"Formal languages\",\"Program verification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Abstract Interpretation over Non-Lattice Abstract Domains\",\"editor\":[{\"firstnames\":[\"F.\"],\"propositions\":[],\"lastnames\":[\"Logozzo\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Fähndrich\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"7935\",\"pages\":\"6–24\",\"publisher\":\"Springer\",\"year\":\"2013\",\"doi\":\"10.1007/978-3-642-38856-9_3\",\"abstract\":\"The classical theoretical framework for static analysis of programs is abstract interpretation. Much of the power and elegance of that framework rests on the assumption that an abstract domain is a lattice. Nonetheless, and for good reason, the literature on program analysis provides many examples of non-lattice domains, including non-convex numeric domains. The lack of domain structure, however, has negative consequences, both for the precision of program analysis and for the termination of standard Kleene iteration. In this paper we explore these consequences and present general remedies.\",\"keywords\":\"Fixed points, Abstract domains, Lattice theory\",\"bibtex\":\"@InProceedings{Gan-Nav-Sch-Son-Stu_SAS13,\\n  author    = {Graeme Gange and \\n\\t\\tJorge A. Navas and \\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Abstract Interpretation over Non-Lattice Abstract Domains},\\n  editor    = {F. Logozzo and M. F{\\\\\\\"a}hndrich},\\n  booktitle = {Static Analysis},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {7935},\\n  pages     = {6--24},\\n  publisher = {Springer},\\n  year      = {2013},\\n  doi       = {10.1007/978-3-642-38856-9_3},\\n  abstract  = {The classical theoretical framework for static analysis of\\n\\t\\tprograms is abstract interpretation. Much of the power and \\n\\t\\telegance of that framework rests on the assumption that an \\n\\t\\tabstract domain is a lattice. Nonetheless, and for good reason,\\n\\t\\tthe literature on program analysis provides many examples of \\n\\t\\tnon-lattice domains, including non-convex numeric domains. \\n\\t\\tThe lack of domain structure, however, has negative \\n\\t\\tconsequences, both for the precision of program analysis and \\n\\t\\tfor the termination of standard Kleene iteration. In this paper \\n\\t\\twe explore these consequences and present general remedies.},\\n  keywords  = {Fixed points, Abstract domains, Lattice theory},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Logozzo, F.\",\"Fähndrich, M.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_SAS13\",\"id\":\"Gan-Nav-Sch-Son-Stu_SAS13\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-abstractinterpretationovernonlatticeabstractdomains-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Fixed points\",\"Abstract domains\",\"Lattice theory\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Exploiting Sparsity in Difference-Bound Matrices\",\"editor\":[{\"firstnames\":[\"X.\"],\"propositions\":[],\"lastnames\":[\"Rival\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis: Proceedings of the 23rd International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9837\",\"pages\":\"189–211\",\"publisher\":\"Springer\",\"year\":\"2016\",\"doi\":\"10.1007/978-3-662-53413-7\",\"abstract\":\"Relational numeric abstract domains are very important in program analysis. Common domains, such as Zones and Octagons, are usually conceptualised with weighted digraphs and implemented using difference-bound matrices (DBMs). Unfortunately, though conceptually simple, direct implementations of graph-based domains tend to perform poorly in practice, and are impractical for analyzing large code-bases. We propose new DBM algorithms that exploit sparsity and closed operands. In particular, a new representation which we call split normal form reduces graph density on typical abstract states. We compare the resulting implementation with several existing DBM-based abstract domains, and show that we can substantially reduce the time to perform full DBM analysis, without sacrificing precision.\",\"keywords\":\"Abstract domains, Abstract interpretation, Static analysis\",\"bibtex\":\"@inproceedings{Gan-Nav-Sch-Son-Stu_SAS16,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Exploiting Sparsity in Difference-Bound Matrices},\\n  editor    = {X. Rival},\\n  booktitle = {Static Analysis:\\n                Proceedings of the 23rd International Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {9837},\\n  pages     = {189--211},\\n  publisher = {Springer},\\n  year      = {2016},\\n  doi       = {10.1007/978-3-662-53413-7},\\n  abstract  = {Relational numeric abstract domains are very important in \\n\\t\\tprogram analysis. Common domains, such as Zones and Octagons, \\n\\t\\tare usually conceptualised with weighted digraphs and \\n\\t\\timplemented using difference-bound matrices (DBMs). \\n\\t\\tUnfortunately, though conceptually simple, direct \\n\\t\\timplementations of graph-based domains tend to perform\\n\\t\\tpoorly in practice, and are impractical for analyzing large \\n\\t\\tcode-bases. We propose new DBM algorithms that exploit \\n\\t\\tsparsity and closed operands. In particular, a new \\n\\t\\trepresentation which we call split normal form reduces graph\\n\\t\\tdensity on typical abstract states. We compare the resulting \\n\\t\\timplementation with several existing DBM-based abstract \\n\\t\\tdomains, and show that we can substantially reduce the time\\n\\t\\tto perform full DBM analysis, without sacrificing precision.},\\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Rival, X.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_SAS16\",\"id\":\"Gan-Nav-Sch-Son-Stu_SAS16\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-exploitingsparsityindifferenceboundmatrices-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Static analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Disjunctive Interval Analysis\",\"editor\":[{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Drăgoi\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Mukherjee\"],\"suffixes\":[]},{\"firstnames\":[\"K.\"],\"propositions\":[],\"lastnames\":[\"Namjoshi\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"12913\",\"pages\":\"144–165\",\"publisher\":\"Springer\",\"year\":\"2021\",\"doi\":\"10.1007/978-3-030-88806-0_7\",\"abstract\":\"We revisit disjunctive interval analysis based on the Boxes abstract domain. We propose the use of what we call range decision diagrams (RDDs) to implement Boxes, and we provide algorithms for the necessary RDD operations. RDDs tend to be more compact than the linear decision diagrams (LDDs) that have traditionally been used for Boxes. Representing information more directly, RDDs also allow for the implementation of more accurate abstract operations. This comes at no cost in terms of analysis efficiency, whether LDDs utilise dynamic variable ordering or not. RDD and LDD implementations are available in the Crab analyzer, and our experiments confirm that RDDs are well suited for disjunctive interval analysis.\",\"keywords\":\"Abstract domains, Abstract interpretation, Static analysis, Interval analysis\",\"bibtex\":\"@InProceedings{Gan-Nav-Sch-Son-Stu_SAS21,\\n  author    = {Graeme Gange and \\n\\t\\tJorge A. Navas and \\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Disjunctive Interval Analysis},\\n  editor    = {C. Dr{\\\\u{a}}goi and S. Mukherjee and K. Namjoshi},\\n  booktitle = {Static Analysis},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {12913},\\n  pages     = {144--165},\\n  publisher = {Springer},\\n  year      = {2021},\\n  doi       = {10.1007/978-3-030-88806-0_7},\\n  abstract  = {We revisit disjunctive interval analysis based on the \\n\\t\\tBoxes abstract domain. We propose the use of what we call \\n\\t\\trange decision diagrams (RDDs) to implement Boxes, and we \\n\\t\\tprovide algorithms for the necessary RDD operations.  \\n\\t\\tRDDs tend to be more compact than the linear decision\\n\\t\\tdiagrams (LDDs) that have traditionally been used for Boxes.\\n\\t\\tRepresenting information more directly, RDDs also allow for \\n\\t\\tthe implementation of more accurate abstract operations.\\n\\t\\tThis comes at no cost in terms of analysis efficiency,\\n\\t\\twhether LDDs utilise dynamic variable ordering or not.\\n\\t\\tRDD and LDD implementations are available in the Crab analyzer,\\n\\t\\tand our experiments confirm that RDDs are well suited for\\n\\t\\tdisjunctive interval analysis.},\\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Interval analysis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Drăgoi, C.\",\"Mukherjee, S.\",\"Namjoshi, K.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_SAS21\",\"id\":\"Gan-Nav-Sch-Son-Stu_SAS21\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-disjunctiveintervalanalysis-2021\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Static analysis\",\"Interval analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Complete Refinement Procedure for Regular Separability of Context-Free Languages\",\"journal\":\"Theoretical Computer Science\",\"volume\":\"625\",\"pages\":\"1–24\",\"month\":\"April\",\"year\":\"2016\",\"doi\":\"10.1016/j.tcs.2016.01.026\",\"abstract\":\"Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present a class of semi-decision procedures for regular separability of context-free languages, based on counter-example guided abstraction refinement. We propose two effective instances of this approach, one that is complete but relatively expensive, and one that is inexpensive and sound, but for which we do not have a completeness proof. The complete method will prove disjointness whenever the input languages are regularly separable. Both methods will terminate whenever the input languages overlap. We provide an experimental evaluation of these procedures, and demonstrate their practicality on a range of verification and language-theoretic instances.\",\"keywords\":\"String analysis, Formal languages, Program verification\",\"bibtex\":\"@article{Gan-Nav-Sch-Son-Stu_TCS16,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Complete Refinement Procedure for Regular Separability\\n                of Context-Free Languages},\\n  journal   = {Theoretical Computer Science},\\n  volume    = {625},\\n  pages     = {1--24},\\n  month     = {April},\\n  year      = {2016},\\n  doi       = {10.1016/j.tcs.2016.01.026},\\n  abstract  = {Often, when analyzing the behaviour of systems modelled \\n\\t\\tas context-free languages, we wish to know if two \\n\\t\\tlanguages overlap.  To this end, we present a class of \\n\\t\\tsemi-decision procedures for regular separability of \\n\\t\\tcontext-free languages, based on counter-example guided \\n\\t\\tabstraction refinement.  We propose two effective\\n\\t\\tinstances of this approach, one that is complete but \\n\\t\\trelatively expensive, and one that is inexpensive and \\n\\t\\tsound, but for which we do not have a completeness proof.\\n\\t\\tThe complete method will prove disjointness whenever the \\n\\t\\tinput languages are regularly separable. Both methods \\n\\t\\twill terminate whenever the input languages overlap. \\n\\t\\tWe provide an experimental evaluation of these procedures,\\n\\t\\tand demonstrate their practicality on a range of \\n\\t\\tverification and language-theoretic instances.},\\n  keywords  = {String analysis, Formal languages, Program verification},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_TCS16\",\"id\":\"Gan-Nav-Sch-Son-Stu_TCS16\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-acompleterefinementprocedureforregularseparabilityofcontextfreelanguages-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"String analysis\",\"Formal languages\",\"Program verification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss\",\"journal\":\"ACM Transactions on Programming Languages and Systems\",\"volume\":\"37\",\"number\":\"1\",\"pages\":\"1:1–1:35\",\"month\":\"january\",\"year\":\"2015\",\"doi\":\"http://dx.doi.org/10.1145/2651360\",\"abstract\":\"The most commonly used integer types have fixed bit-width, making it possible for computations to ``wrap around'', and many programs depend on this behaviour. Yet much work to date on program analysis and verification of integer computations treats integers as having infinite precision, and most analyses that do respect fixed width lose precision when overflow is possible. We present a novel integer interval abstract domain that correctly handles wrap-around. The analysis is signedness agnostic. By treating integers as strings of bits, only considering signedness for operations that treat them differently, we produce precise, correct results at a modest cost in execution time.\",\"keywords\":\"Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM\",\"bibtex\":\"@article{Gan-Nav-Sch-Son-Stu_TOPLAS15,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and \\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Interval Analysis and Machine Arithmetic: \\n                Why Signedness Ignorance Is Bliss},\\n  journal   = {ACM Transactions on Programming Languages and Systems},\\n  volume    = {37},\\n  number    = {1},\\n  pages     = {1:1--1:35},\\n  month     = {january},\\n  year      = {2015},\\n  doi       = {http://dx.doi.org/10.1145/2651360},\\n  abstract  = {The most commonly used integer types have fixed bit-width,\\n\\t\\tmaking it possible for computations to ``wrap around'',\\n\\t\\tand many programs depend on this behaviour.  Yet much \\n\\t\\twork to date on program analysis and verification of \\n\\t\\tinteger computations treats integers as having infinite \\n\\t\\tprecision, and most analyses that do respect fixed width\\n\\t\\tlose precision when overflow is possible.  We present a \\n\\t\\tnovel integer interval abstract domain that correctly \\n\\t\\thandles wrap-around.  The analysis is signedness agnostic.\\n\\t\\tBy treating integers as strings of bits, only considering\\n\\t\\tsignedness for operations that treat them differently, \\n\\t\\twe produce precise, correct results at a modest cost in \\n\\t\\texecution time.},\\n  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_TOPLAS15\",\"id\":\"Gan-Nav-Sch-Son-Stu_TOPLAS15\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-intervalanalysisandmachinearithmeticwhysignednessignoranceisbliss-2015\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Interval analysis\",\"Machine arithmetic\",\"C analysis\",\"LLVM\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Failure Tabled Constraint Logic Programming by Interpolation\",\"journal\":\"Theory and Practice of Logic Programming\",\"volume\":\"13\",\"number\":\"4–5\",\"pages\":\"593–607\",\"year\":\"2013\",\"doi\":\"10.1017/S1471068413000379\",\"abstract\":\"We present a new execution strategy for constraint logic programs called \\\\emphFailure Tabled CLP. Similarly to \\\\emphTabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from \\\\emphfailed derivations. This allows us to compute \\\\emphinterpolants rather than \\\\emphconstraint projection for generation of \\\\emphreuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.\",\"keywords\":\"Logic programming, Interpolants\",\"bibtex\":\"@Article{Gan-Nav-Sch-Son-Stu_TPLP13,\\n  author    = {Graeme Gange and \\n\\t\\tJorge A. Navas and \\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Failure Tabled Constraint Logic Programming by Interpolation},\\n  journal   = {Theory and Practice of Logic Programming},\\n  volume    = {13},\\n  number    = {4--5},\\n  pages     = {593--607},\\n  year      = {2013},\\n  doi       = {10.1017/S1471068413000379},\\n  abstract  = {We present a new execution strategy for constraint logic\\n\\t\\tprograms called \\\\emph{Failure Tabled CLP}. Similarly to\\n\\t\\t\\\\emph{Tabled CLP} our strategy records certain derivations\\n\\t\\tin order to prune further derivations. However, our method\\n\\t\\tonly learns from \\\\emph{failed derivations}. This allows us\\n\\t\\tto compute \\\\emph{interpolants} rather than \\n\\t\\t\\\\emph{constraint projection} for generation of \\n\\t\\t\\\\emph{reuse conditions}. As a result, our technique can\\n\\t\\tbe used where projection is too expensive or does not \\n\\t\\texist. Our experiments indicate that Failure Tabling can\\n\\t\\tspeed up the execution of programs with many redundant \\n\\t\\tfailed derivations as well as achieve termination in the\\n\\t\\tpresence of infinite executions.},\\n  keywords  = {Logic programming, Interpolants},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_TPLP13\",\"id\":\"Gan-Nav-Sch-Son-Stu_TPLP13\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Logic programming\",\"Interpolants\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Horn Clauses As an Intermediate Representation for Program Analysis and Transformation\",\"journal\":\"Theory and Practice of Logic Programming\",\"volume\":\"15\",\"number\":\"4–5\",\"pages\":\"526–542\",\"year\":\"2015\",\"doi\":\"http://dx.doi.org/10.1017/S1471068415000204\",\"abstract\":\"Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine language or other low-level language, while maintaining the simple semantics that makes it suitable as a language for program analysis and transformation. We present a simple LP language that enforces determinism and single-modedness, and show that it makes a convenient program representation for analysis and transformation.\",\"keywords\":\"Static analysis, Intermediate representations, Horn clauses, Logic programming\",\"bibtex\":\"@article{Gan-Nav-Sch-Son-Stu_TPLP15,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Horn Clauses As an Intermediate Representation for \\n                Program Analysis and Transformation},\\n  journal   = {Theory and Practice of Logic Programming},\\n  volume    = {15},\\n  number    = {4--5},\\n  pages     = {526--542},\\n  year      = {2015},\\n  doi       = {http://dx.doi.org/10.1017/S1471068415000204},\\n  abstract  = {Many recent analyses for conventional imperative programs \\n\\t\\tbegin by transforming programs into logic programs, \\n\\t\\tcapitalising on existing LP analyses and simple LP \\n\\t\\tsemantics.  We propose using logic programs as an \\n\\t\\tintermediate program representation throughout the \\n\\t\\tcompilation process.  With restrictions ensuring \\n\\t\\tdeterminism and single-modedness, a logic program can \\n\\t\\teasily be transformed to machine language or other \\n\\t\\tlow-level language, while maintaining the simple semantics\\n  \\t\\tthat makes it suitable as a language for program analysis\\n\\t\\tand transformation.  We present a simple LP language that\\n\\t\\tenforces determinism and single-modedness, and show that\\n\\t\\tit makes a convenient program representation for analysis\\n\\t\\tand transformation.},\\n  keywords  = {Static analysis, Intermediate representations, Horn clauses, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_TPLP15\",\"id\":\"Gan-Nav-Sch-Son-Stu_TPLP15\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-hornclausesasanintermediaterepresentationforprogramanalysisandtransformation-2015\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Static analysis\",\"Intermediate representations\",\"Horn clauses\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"An Abstract Domain of Uninterpreted Functions\",\"editor\":[{\"firstnames\":[\"B.\"],\"propositions\":[],\"lastnames\":[\"Jobstmann\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"R.\",\"M.\"],\"propositions\":[],\"lastnames\":[\"Leino\"],\"suffixes\":[]}],\"booktitle\":\"Verification, Model Checking and Abstract Interpretation: Proceedings of the 17th International Conference\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9583\",\"pages\":\"85–103\",\"publisher\":\"Springer\",\"year\":\"2016\",\"isbn\":\"978-3-662-49121-8\",\"doi\":\"10.1007/978-3-662-49122-5\",\"abstract\":\"We revisit relational static analysis of numeric variables. Such analyses face two difficulties. First, even inexpensive relational domains scale too poorly to be practical for large code-bases. Second, to remain tractable they have extremely coarse handling of non-linear relations. In this paper, we introduce the subterm domain, a weakly relational abstract domain for inferring equivalences amongst sub-expressions, based on the theory of uninterpreted functions. This provides an extremely cheap approach for enriching non-relational domains with relational information, and enhances precision of both relational and non-relational domains in the presence of non-linear operations. We evaluate the idea in the context of the software verification tool SeaHorn.\",\"keywords\":\"Abstract domains, Abstract interpretation, Static analysis, Program verification\",\"bibtex\":\"@inproceedings{Gan-Nav-Sch-Son-Stu_VMCAI15,\\n  author    = {Graeme Gange and \\n\\t\\tJorge Navas and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {An Abstract Domain of Uninterpreted Functions},\\n  editor    = {B. Jobstmann and K. R. M. Leino},\\n  booktitle = {Verification, Model Checking and Abstract Interpretation:\\n                Proceedings of the 17th International Conference},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {9583},\\n  pages     = {85--103},\\n  publisher = {Springer},\\n  year      = {2016},\\n  isbn      = {978-3-662-49121-8},\\n  doi       = {10.1007/978-3-662-49122-5},\\n  abstract  = {We revisit relational static analysis of numeric variables.\\n\\t\\tSuch analyses face two difficulties. First, even inexpensive \\n\\t\\trelational domains scale too poorly to be practical for large \\n\\t\\tcode-bases. Second, to remain tractable they have extremely \\n\\t\\tcoarse handling of non-linear relations. In this paper, we \\n\\t\\tintroduce the subterm domain, a weakly relational abstract \\n\\t\\tdomain for inferring equivalences amongst sub-expressions,\\n\\t\\tbased on the theory of uninterpreted functions. This provides \\n\\t\\tan extremely cheap approach for enriching non-relational \\n\\t\\tdomains with relational information, and enhances precision \\n\\t\\tof both relational and non-relational domains in the presence\\n\\t\\tof non-linear operations. We evaluate the idea in the context \\n\\t\\tof the software verification tool SeaHorn.},\\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Program verification},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Jobstmann, B.\",\"Leino, K. R. M.\"],\"key\":\"Gan-Nav-Sch-Son-Stu_VMCAI15\",\"id\":\"Gan-Nav-Sch-Son-Stu_VMCAI15\",\"bibbaseid\":\"gange-navas-schachte-sndergaard-stuckey-anabstractdomainofuninterpretedfunctions-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Static analysis\",\"Program verification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]}],\"title\":\"Unbounded Model-Checking with Interpolation for Regular Language Constraints\",\"editor\":[{\"firstnames\":[\"N.\"],\"propositions\":[],\"lastnames\":[\"Piterman\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Smolka\"],\"suffixes\":[]}],\"booktitle\":\"TACAS 2013: Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"7795\",\"pages\":\"277–291\",\"publisher\":\"Springer\",\"year\":\"2013\",\"doi\":\"10.1007/978-3-642-36742-7_20\",\"abstract\":\"We present a decision procedure for the problem of, given a set of regular expressions $R_1, …, R_n$, determining whether $R = R_1 ∩ ⋯ ∩ R_n$ is empty. Our solver, \\\\sysrevenant, finitely unrolls automata for $R_1, …, R_n$, encoding each as a set of propositional constraints. If a SAT solver determines satisfiability then $R$ is non-empty. Otherwise our solver uses unbounded model checking techniques to extract an interpolant from the bounded proof. This interpolant serves as an overapproximation of $R$. If the solver reaches a fixed-point with the constraints remaining unsatisfiable, it has proven $R$ to be empty. Otherwise, it increases the unrolling depth and repeats. We compare \\\\textscrevenant with other state-of-the-art string solvers. Evaluation suggests that it behaves better for constraints that express the intersection of sets of regular languages, a case of interest in the context of verification.\",\"keywords\":\"Static analysis, Formal languages, Model checking, Interpolants, String constraints\",\"bibtex\":\"@InProceedings{Gan-Nav-Stu-Son-Sch_TACAS13,\\n  author    = {Graeme Gange and \\n\\t\\tJorge A. Navas and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter Schachte},\\n  title     = {Unbounded Model-Checking with Interpolation for Regular\\n                Language Constraints},\\n  editor    = {N. Piterman and S. Smolka},\\n  booktitle = {TACAS 2013: Proceedings of the 19th International\\n\\t\\tConference on Tools and Algorithms for the Construction \\n\\t\\tand Analysis of Systems},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {7795},\\n  pages     = {277--291},\\n  publisher = {Springer},\\n  year      = {2013},\\n  doi       = {10.1007/978-3-642-36742-7_20},\\n  abstract  = {We present a decision procedure for the problem of, \\n\\t\\tgiven a set of regular expressions $R_1, \\\\ldots, R_n$,\\n\\t\\tdetermining whether $R = R_1 \\\\cap \\\\cdots \\\\cap R_n$ is \\n\\t\\tempty.  Our solver, \\\\sys{revenant}, finitely unrolls \\n\\t\\tautomata for $R_1, \\\\ldots, R_n$, encoding each as a \\n\\t\\tset of propositional constraints.  If a SAT solver \\n\\t\\tdetermines satisfiability then $R$ is non-empty. Otherwise\\n\\t\\tour solver uses unbounded model checking techniques \\n\\t\\tto extract an interpolant from the bounded proof.  \\n\\t\\tThis interpolant serves as an overapproximation of $R$.  \\n\\t\\tIf the solver reaches a fixed-point with the constraints\\n\\t\\tremaining unsatisfiable, it has proven $R$ to be empty.\\n\\t\\tOtherwise, it increases the unrolling depth and repeats.\\n\\t\\tWe compare \\\\textsc{revenant} with other state-of-the-art \\n\\t\\tstring solvers.  Evaluation suggests that it behaves\\n\\t\\tbetter for constraints that express the intersection of\\n\\t\\tsets of regular languages, a case of interest in the \\n\\t\\tcontext of verification.},\\n  keywords  = {Static analysis, Formal languages, Model checking, Interpolants, String constraints},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Navas, J. A.\",\"Stuckey, P. J.\",\"Søndergaard, H.\",\"Schachte, P.\"],\"editor_short\":[\"Piterman, N.\",\"Smolka, S.\"],\"key\":\"Gan-Nav-Stu-Son-Sch_TACAS13\",\"id\":\"Gan-Nav-Stu-Son-Sch_TACAS13\",\"bibbaseid\":\"gange-navas-stuckey-sndergaard-schachte-unboundedmodelcheckingwithinterpolationforregularlanguageconstraints-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Static analysis\",\"Formal languages\",\"Model checking\",\"Interpolants\",\"String constraints\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]}],\"title\":\"Solving Difference Constraints over Modular Arithmetic\",\"editor\":[{\"firstnames\":[\"M.\",\"P.\"],\"propositions\":[],\"lastnames\":[\"Bonacina\"],\"suffixes\":[]}],\"booktitle\":\"CADE 2013: Proceedings of the 24th International Conference on Automated Deduction\",\"series\":\"Lecture Notes in Artificial Intelligence\",\"volume\":\"7898\",\"pages\":\"215–230\",\"publisher\":\"Springer\",\"year\":\"2013\",\"doi\":\"10.1007/978-3-642-38574-2_15\",\"abstract\":\"Difference logic is commonly used in program verification and analysis. In the context of fixed-precision integers, as used in assembly languages for example, the use of classical difference logic is unsound. We study the problem of deciding difference constraints in the context of modular arithmetic and show that it is strongly NP-complete. We discuss the applicability of the Bellman-Ford algorithm and related shortest-distance algorithms to the context of modular arithmetic. We explore two approaches, namely a complete method implemented using SMT technology and an incomplete fixpoint-based method, and the two are experimentally evaluated. The incomplete method performs considerably faster while maintaining acceptable accuracy on a range of instances.\",\"keywords\":\"Constraint solving, Program verification, Static analysis, Machine arithmetic, Fixed points\",\"bibtex\":\"@InProceedings{Gan-Son-Stu-Sch_CADE13,\\n  author    = {Graeme Gange and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tPeter Schachte},\\n  title     = {Solving Difference Constraints over Modular Arithmetic},\\n  editor    = {M. P. Bonacina},\\n  booktitle = {CADE 2013: Proceedings of the 24th International\\n\\t\\tConference on Automated Deduction},\\n  series    = {Lecture Notes in Artificial Intelligence},\\n  volume    = {7898},\\n  pages     = {215--230},\\n  publisher = {Springer},\\n  year      = {2013},\\n  doi       = {10.1007/978-3-642-38574-2_15},\\n  abstract  = {Difference logic is commonly used in program verification \\n\\t\\tand analysis. In the context of fixed-precision integers,\\n\\t\\tas used in assembly languages for example, the use of \\n\\t\\tclassical difference logic is unsound. We study the problem\\n\\t\\tof deciding difference constraints in the context of modular\\n\\t\\tarithmetic and show that it is strongly NP-complete. We \\n\\t\\tdiscuss the applicability of the Bellman-Ford algorithm and \\n\\t\\trelated shortest-distance algorithms to the context of modular\\n\\t\\tarithmetic. We explore two approaches, namely a complete \\n\\t\\tmethod implemented using SMT technology and an incomplete \\n\\t\\tfixpoint-based method, and the two are experimentally \\n\\t\\tevaluated. The incomplete method performs considerably \\n\\t\\tfaster while maintaining acceptable accuracy on a range\\n\\t\\tof instances.},\\n  keywords  = {Constraint solving, Program verification, Static analysis, Machine arithmetic, Fixed points},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Søndergaard, H.\",\"Stuckey, P. J.\",\"Schachte, P.\"],\"editor_short\":[\"Bonacina, M. P.\"],\"key\":\"Gan-Son-Stu-Sch_CADE13\",\"id\":\"Gan-Son-Stu-Sch_CADE13\",\"bibbaseid\":\"gange-sndergaard-stuckey-schachte-solvingdifferenceconstraintsovermodulararithmetic-2013\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint solving\",\"Program verification\",\"Static analysis\",\"Machine arithmetic\",\"Fixed points\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Synthesizing Optimal Switching Lattices\",\"journal\":\"ACM Transactions on Design Automation of Electronic Systems\",\"volume\":\"20\",\"number\":\"1\",\"pages\":\"6:1–6:14\",\"month\":\"november\",\"year\":\"2014\",\"doi\":\"10.1145/2661632\",\"abstract\":\"The use of nanoscale technologies to create electronic devices has revived interest in the use of regular structures for defining complex logic functions. One such structure is the switching lattice, a two-dimensional lattice of four-terminal switches. We show how to directly construct switching lattices of polynomial size from arbitrary logic functions; we also show how to synthesize minimal-sized lattices by translating the problem to the satisfiability problem for a restricted class of quantified Boolean formulas. The synthesis method is an anytime algorithm which uses modern SAT solving technology and dichotomic search. It improves considerably on an earlier proposal for creating switching lattices for arbitrary logic functions.\",\"keywords\":\"Boolean logic, Logic circuits, Circuit synthesis\",\"bibtex\":\"@article{Gan-Son-Stu_TODAES14,\\n  author    = {Graeme Gange and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Synthesizing Optimal Switching Lattices},\\n  journal   = {ACM Transactions on Design Automation of Electronic Systems},\\n  volume    = {20},\\n  number    = {1},\\n  pages     = {6:1--6:14},\\n  month     = {november},\\n  year      = {2014},\\n  doi       = {10.1145/2661632},\\n  abstract  = {The use of nanoscale technologies to create electronic devices \\n\\t\\thas revived interest in the use of regular structures for \\n\\t\\tdefining complex logic functions. One such structure is the \\n\\t\\tswitching lattice, a two-dimensional lattice of four-terminal \\n\\t\\tswitches. We show how to directly construct switching lattices \\n\\t\\tof polynomial size from arbitrary logic functions; we also show\\n\\t\\thow to synthesize minimal-sized lattices by translating the \\n\\t\\tproblem to the satisfiability problem for a restricted class of\\n\\t\\tquantified Boolean formulas. The synthesis method is an anytime\\n\\t\\talgorithm which uses modern SAT solving technology and \\n\\t\\tdichotomic search. It improves considerably on an earlier \\n\\t\\tproposal for creating switching lattices for arbitrary logic \\n\\t\\tfunctions.},\\n  keywords  = {Boolean logic, Logic circuits, Circuit synthesis},\\n}\\n\\n\",\"author_short\":[\"Gange, G.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Gan-Son-Stu_TODAES14\",\"id\":\"Gan-Son-Stu_TODAES14\",\"bibbaseid\":\"gange-sndergaard-stuckey-synthesizingoptimalswitchinglattices-2014\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Logic circuits\",\"Circuit synthesis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"techreport\",\"author\":[{\"firstnames\":[\"Maria\"],\"propositions\":[],\"lastnames\":[\"Garcı́a de la Banda\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Improved Analysis of Logic Programs Using a Differential Approach\",\"number\":\"95/15\",\"institution\":\"Department of Computer Science, The University of Melbourne\",\"year\":\"1995\",\"abstract\":\"Abstract interpretation based program analysis has proven very useful in compilation of constraint and logic programming languages. Unfortunately, existing theoretical frameworks are inherently imprecise. This is because of the way the frameworks handle call and return from an atom evaluation—in effect the same information may be added twice, leading to a loss of precision in many description domains. For this reason some implementations use seemingly \\\\emphad hoc tricks. Here we formalize these tricks and suggest three methods for overcoming this loss of precision. Experimental and theoretical results indicate that use of these methods leads to more accurate and faster analyses for little extra implementation effort.\",\"keywords\":\"Abstract interpretation, Logic programming\",\"bibtex\":\"@Techreport{Garcia_TR95,\\n  author      = {Maria {Garc{\\\\'\\\\i}a de la Banda} and \\n\\t\\tKim Marriott and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title       = {Improved Analysis of Logic Programs Using a Differential\\n\\t\\tApproach},\\n  number      = {95/15},\\n  institution = {Department of Computer Science, The University of Melbourne},\\n  year        = {1995},\\n  abstract    = {Abstract interpretation based program analysis has proven\\n\\t\\tvery useful in compilation of constraint and logic programming\\n\\t\\tlanguages. Unfortunately, existing theoretical frameworks are \\n\\t\\tinherently imprecise. This is because of the way the frameworks\\n\\t\\thandle call and return from an atom evaluation---in effect the \\n\\t\\tsame information may be added twice, leading to a loss of \\n\\t\\tprecision in many description domains. For this reason some \\n\\t\\timplementations use seemingly \\\\emph{ad hoc} tricks. Here we \\n\\t\\tformalize these tricks and suggest three methods for overcoming\\n\\t\\tthis loss of precision. Experimental and theoretical results \\n\\t\\tindicate that use of these methods leads to more accurate and \\n\\t\\tfaster analyses for little extra implementation effort.},\\n  keywords  = {Abstract interpretation, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Garcı́a de la Banda, M.\",\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Garcia_TR95\",\"id\":\"Garcia_TR95\",\"bibbaseid\":\"garcadelabanda-marriott-sndergaard-stuckey-improvedanalysisoflogicprogramsusingadifferentialapproach-1995\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Maria\"],\"propositions\":[],\"lastnames\":[\"Garcı́a de la Banda\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Differential Methods in Logic Program Analysis\",\"journal\":\"Journal of Logic Programming\",\"volume\":\"35\",\"number\":\"1\",\"pages\":\"1–37\",\"year\":\"1998\",\"doi\":\"10.1016/s0743-1066(97)10002-4\",\"abstract\":\"Program analysis based on abstract interpretation has proven very useful in compilation of constraint and logic programming languages. Unfortunately, the traditional goal-dependent framework is inherently imprecise. This is because it handles call and return in such a way that dataflow information may be re-asserted unnecessarily, leading to a loss of precision for many description domains. For a few specific domains, the literature contains proposals to overcome the problem, and some implementations use various unpublished tricks that sometimes avoid the precision loss. The purpose of this paper is to map the landscape of goal-dependent, goal-independent, and combined approaches to generic analysis of logic programs. This includes formalising existing methods and tricks in a way that is independent of specific description domains. Moreover, we suggest new methods for overcoming the loss of precision—altogether eight different semantics are considered and compared. We provide theoretical results determining the relative accuracy of the approaches. These show that two of our new semantics are uniformally more accurate than existing approaches. Experiments that we have performed (for two description domains) with implementations of the eight different approaches enable a discussion of their relative runtime performances. We discuss the expected effect on other domains as well and conclude that our new methods can be trusted to yield significantly more accurate analysis for a small extra implementation effort, without compromising the efficiency of analysis.\",\"keywords\":\"Abstract interpretation, Logic programming, Sharing analysis\",\"bibtex\":\"@article{Gar-Mar-Stu-Son_JLP98,\\n  author    = {Maria {Garc{\\\\'\\\\i}a de la Banda} and \\n\\t\\tKim Marriott and\\n\\t\\tPeter J. Stuckey and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Differential Methods in Logic Program Analysis},\\n  journal   = {Journal of Logic Programming},\\n  volume    = {35},\\n  number    = {1},\\n  pages     = {1--37},\\n  year      = {1998},\\n  doi       = {10.1016/s0743-1066(97)10002-4},\\n  abstract  = {Program analysis based on abstract interpretation has proven\\n\\t\\tvery useful in compilation of constraint and logic programming\\n\\t\\tlanguages. Unfortunately, the traditional goal-dependent \\n\\t\\tframework is inherently imprecise. This is because it handles \\n\\t\\tcall and return in such a way that dataflow information may be \\n\\t\\tre-asserted unnecessarily, leading to a loss of precision for\\n\\t\\tmany description domains. For a few specific domains, the \\n\\t\\tliterature contains proposals to overcome the problem, and some\\n\\t\\timplementations use various unpublished tricks that sometimes \\n\\t\\tavoid the precision loss. The purpose of this paper is to map \\n\\t\\tthe landscape of goal-dependent, goal-independent, and combined\\n\\t\\tapproaches to generic analysis of logic programs. This includes\\n\\t\\tformalising existing methods and tricks in a way that is \\n\\t\\tindependent of specific description domains. Moreover, we \\n\\t\\tsuggest new methods for overcoming the loss of \\n\\t\\tprecision---altogether eight different semantics are \\n\\t\\tconsidered and compared. We provide theoretical results \\n\\t\\tdetermining the relative accuracy of the approaches. These \\n\\t\\tshow that two of our new semantics are uniformally more \\n\\t\\taccurate than existing approaches. Experiments that we have \\n\\t\\tperformed (for two description domains) with implementations \\n\\t\\tof the eight different approaches enable a discussion of their\\n\\t\\trelative runtime performances. We discuss the expected effect \\n\\t\\ton other domains as well and conclude that our new methods \\n\\t\\tcan be trusted to yield significantly more accurate analysis \\n\\t\\tfor a small extra implementation effort, without compromising \\n\\t\\tthe efficiency of analysis.},\\n  keywords  = {Abstract interpretation, Logic programming, Sharing analysis},\\n}\\n\\n\",\"author_short\":[\"Garcı́a de la Banda, M.\",\"Marriott, K.\",\"Stuckey, P. J.\",\"Søndergaard, H.\"],\"key\":\"Gar-Mar-Stu-Son_JLP98\",\"id\":\"Gar-Mar-Stu-Son_JLP98\",\"bibbaseid\":\"garcadelabanda-marriott-stuckey-sndergaard-differentialmethodsinlogicprogramanalysis-1998\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\",\"Sharing analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Glynn\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Immediate Fixpoints for Strictness Analysis\",\"editor\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Edwards\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 22nd Australasian Computer Science Conference\",\"series\":\"Australian Computer Science Communications\",\"volume\":\"21\",\"number\":\"1\",\"year\":\"1999\",\"pages\":\"336–347\",\"publisher\":\"Springer\",\"abstract\":\"This paper is concerned with the problem of finding fixpoints without resorting to Kleene iteration. In many cases, a simple syntactic test suffices to establish that a closed form can be found without iteration. For example, if the function $F$, whose fixpoint we want to determine, is idempotent, then its least fixpoint is simply the instantiation $F(0)$, where $0$ is the least element of the lattice. In many cases, idempotence can be gleaned easily from $F$'s definition. In other cases, simple symbolic manipulation of a recursive definition may reveal shortcuts to a closed form. We explore such cases and show how the faster fixpoint calculation can have applications in strictness analysis.\",\"keywords\":\"Fixed points, Strictness analysis, Functional programming\",\"bibtex\":\"@Inproceedings{Gly-Son_ACSC99,\\n  author    = {Kevin Glynn and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Immediate Fixpoints for Strictness Analysis},\\n  editor    = {J. Edwards},\\n  booktitle = {Proceedings of the 22nd Australasian Computer Science \\n\\t\\tConference},\\n  series    = {Australian Computer Science Communications},\\n  volume    = {21},\\n  number    = {1},\\n  year      = {1999},\\n  pages     = {336--347},\\n  publisher = {Springer},\\n  abstract  = {This paper is concerned with the problem of finding fixpoints\\n                without resorting to Kleene iteration. In many cases, a simple\\n\\t\\tsyntactic test suffices to establish that a closed form can be \\n\\t\\tfound without iteration. For example, if the function $F$, \\n\\t\\twhose fixpoint we want to determine, is idempotent, then its \\n\\t\\tleast fixpoint is simply the instantiation $F(0)$, where $0$ \\n\\t\\tis the least element of the lattice. In many cases, idempotence\\n\\t\\tcan be gleaned easily from $F$'s definition. In other cases, \\n\\t\\tsimple symbolic manipulation of a recursive definition may \\n\\t\\treveal shortcuts to a closed form. We explore such cases and \\n\\t\\tshow how the faster fixpoint calculation can have applications\\n\\t\\tin strictness analysis.},\\n  keywords  = {Fixed points, Strictness analysis, Functional programming},\\n}\\n\\n\",\"author_short\":[\"Glynn, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Edwards, J.\"],\"key\":\"Gly-Son_ACSC99\",\"id\":\"Gly-Son_ACSC99\",\"bibbaseid\":\"glynn-sndergaard-immediatefixpointsforstrictnessanalysis-1999\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Fixed points\",\"Strictness analysis\",\"Functional programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Glynn\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Sulzmann\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Exception Analysis for Non-Strict Languages\",\"booktitle\":\"Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming\",\"pages\":\"98–109\",\"publisher\":\"ACM Press\",\"year\":\"2002\",\"doi\":\"10.1145/581478.581488\",\"abstract\":\"In this paper we present the first exception analysis for a non-strict language. We augment a simply-typed functional language with exceptions, and show that we can define a type-based inference system to detect uncaught exceptions. We have implemented this exception analysis in the GHC compiler for Haskell, which has been recently extended with exceptions. We give empirical evidence that the analysis is practical.\",\"keywords\":\"Exception analysis, Functional programming\",\"bibtex\":\"@Inproceedings{Gly-Stu-Sul-Son_ICFP02,\\n  author    = {Kevin Glynn and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tMartin Sulzmann and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Exception Analysis for Non-Strict Languages},\\n  booktitle = {Proceedings of the 2002 ACM SIGPLAN International Conference on\\n        \\tFunctional Programming},\\n  pages     = {98--109},\\n  publisher = {ACM Press},\\n  year      = {2002},\\n  doi       = {10.1145/581478.581488},\\n  abstract  = {In this paper we present the first exception analysis\\n\\t\\tfor a non-strict language. We augment a simply-typed \\n\\t\\tfunctional language with exceptions, and show that we \\n\\t\\tcan define a type-based inference system to detect \\n\\t\\tuncaught exceptions. We have implemented this exception\\n\\t\\tanalysis in the GHC compiler for Haskell, which has been\\n\\t\\trecently extended with exceptions. We give empirical \\n\\t\\tevidence that the analysis is practical.},\\n  keywords  = {Exception analysis, Functional programming},\\n}\\n\\n\",\"author_short\":[\"Glynn, K.\",\"Stuckey, P. J.\",\"Sulzmann, M.\",\"Søndergaard, H.\"],\"key\":\"Gly-Stu-Sul-Son_ICFP02\",\"id\":\"Gly-Stu-Sul-Son_ICFP02\",\"bibbaseid\":\"glynn-stuckey-sulzmann-sndergaard-exceptionanalysisfornonstrictlanguages-2002\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Exception analysis\",\"Functional programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Glynn\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Martin\"],\"propositions\":[],\"lastnames\":[\"Sulzmann\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Boolean Constraints for Binding-Time Analysis\",\"editor\":[{\"firstnames\":[\"O.\"],\"propositions\":[],\"lastnames\":[\"Danvy\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Filinsky\"],\"suffixes\":[]}],\"booktitle\":\"Programs as Data Objects: Proceedings of the Second Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"2053\",\"pages\":\"39–63\",\"publisher\":\"Springer\",\"year\":\"2001\",\"doi\":\"10.1007/3-540-44978-7_4\",\"abstract\":\"To achieve acceptable accuracy, many program analyses for functional programs are ``property polymorphic''. That is, they can infer different input-output relations for a function at separate applications of the function, in a manner similar to type inference for a polymorphic language. We extend a property polymorphic (or ``polyvariant'') method for binding-time analysis, due to Dussart, Henglein, and Mossin, so that it applies to languages with ML-style type polymorphism. The extension is non-trivial and we have implemented it for Haskell. While we follow others in specifying the analysis as a non-standard type inference, we argue that it should be realised through a translation into the well-understood domain of Boolean constraints. The expressiveness offered by Boolean constraints opens the way for smooth extensions to sophisticated language features and it allows for more accurate analysis.\",\"keywords\":\"Boolean logic, Binding-time analysis, Haskell\",\"bibtex\":\"@Inproceedings{Gly-Stu-Sul-Son_PADO01,\\n  author    = {Kevin Glynn and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tMartin Sulzmann and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Boolean Constraints for Binding-Time Analysis},\\n  editor    = {O. Danvy and A. Filinsky},\\n  booktitle = {Programs as Data Objects: Proceedings of the Second Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {2053},\\n  pages     = {39--63},\\n  publisher = {Springer},\\n  year      = {2001},\\n  doi       = {10.1007/3-540-44978-7_4},\\n  abstract  = {To achieve acceptable accuracy, many program analyses for\\n\\t\\tfunctional programs are ``property polymorphic''.\\n\\t\\tThat is, they can infer different input-output relations \\n\\t\\tfor a function at separate applications of the function, \\n\\t\\tin a manner similar to type inference for a polymorphic \\n\\t\\tlanguage. We extend a property polymorphic (or ``polyvariant'')\\n\\t\\tmethod for binding-time analysis, due to Dussart, Henglein, \\n\\t\\tand Mossin, so that it applies to languages with ML-style \\n\\t\\ttype polymorphism. The extension is non-trivial \\n\\t\\tand we have implemented it for Haskell. While we follow \\n\\t\\tothers in specifying the analysis as a non-standard type\\n\\t\\tinference, we argue that it should be realised through a \\n\\t\\ttranslation into the well-understood domain of Boolean \\n\\t\\tconstraints. The expressiveness offered by Boolean \\n\\t\\tconstraints opens the way for smooth extensions to \\n\\t\\tsophisticated language features and it allows for \\n\\t\\tmore accurate analysis.},\\n  keywords  = {Boolean logic, Binding-time analysis, Haskell},\\n}\\n\\n\",\"author_short\":[\"Glynn, K.\",\"Stuckey, P. J.\",\"Sulzmann, M.\",\"Søndergaard, H.\"],\"editor_short\":[\"Danvy, O.\",\"Filinsky, A.\"],\"key\":\"Gly-Stu-Sul-Son_PADO01\",\"id\":\"Gly-Stu-Sul-Son_PADO01\",\"bibbaseid\":\"glynn-stuckey-sulzmann-sndergaard-booleanconstraintsforbindingtimeanalysis-2001\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Binding-time analysis\",\"Haskell\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Paul\"],\"propositions\":[],\"lastnames\":[\"Gruba\"],\"suffixes\":[]},{\"firstnames\":[\"Alistair\"],\"propositions\":[],\"lastnames\":[\"Moffat\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Justin\"],\"propositions\":[],\"lastnames\":[\"Zobel\"],\"suffixes\":[]}],\"title\":\"What Drives Curriculum Change?\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Lister\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Young\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Sixth Australasian Computing Education Conference (ACE2004)\",\"location\":\"Dunedin, New Zealand\",\"pages\":\"109–117\",\"month\":\"jan\",\"year\":\"2004\",\"abstract\":\"While promotional literature about computer science programs may claim that curricula are determined by the needs of the students and by international best practice, the reality is often different. In this paper we reflect on the factors underlying curriculum change in computer science departments and schools, from institutional requirements and financial pressures to purely academic considerations. We have used these reflections as the basis of an investigation of curriculum management practices at institutions in Australasia, via a survey instrument sent to a range of colleagues. Our findings from the survey are consistent with our own experiences, namely, that curriculum change is driven or inhibited by factors such as vocal individuals and practical constraints rather than higher academic motives.\",\"keywords\":\"Education, Computer science curricula\",\"bibtex\":\"@InProceedings{Gru-Mof-Son-Zob_ACE04,\\n  author    = {Paul Gruba and \\n\\t\\tAlistair Moffat and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tJustin Zobel},\\n  title     = {What Drives Curriculum Change?},\\n  editor    = {R. Lister and A. Young},\\n  booktitle = {Proceedings of the Sixth Australasian Computing\\n                        Education Conference (ACE2004)},\\n  location  = {Dunedin, New Zealand},\\n  pages     = {109--117},\\n  month     = {jan},\\n  year      = {2004},\\n  abstract  = {While promotional literature about computer science programs \\n\\t\\tmay claim that curricula are determined by the needs of the \\n\\t\\tstudents and by international best practice, the reality is \\n\\t\\toften different. In this paper we reflect on the factors \\n\\t\\tunderlying curriculum change in computer science departments \\n\\t\\tand schools, from institutional requirements and financial \\n\\t\\tpressures to purely academic considerations. We have used \\n\\t\\tthese reflections as the basis of an investigation of \\n\\t\\tcurriculum management practices at institutions in Australasia,\\n\\t\\tvia a survey instrument sent to a range of colleagues. Our \\n\\t\\tfindings from the survey are consistent with our own \\n\\t\\texperiences, namely, that curriculum change is driven or \\n\\t\\tinhibited by factors such as vocal individuals and practical\\n\\t\\tconstraints rather than higher academic motives.},\\n  keywords  = {Education, Computer science curricula},\\n}\\n\\n\",\"author_short\":[\"Gruba, P.\",\"Moffat, A.\",\"Søndergaard, H.\",\"Zobel, J.\"],\"editor_short\":[\"Lister, R.\",\"Young, A.\"],\"key\":\"Gru-Mof-Son-Zob_ACE04\",\"id\":\"Gru-Mof-Son-Zob_ACE04\",\"bibbaseid\":\"gruba-moffat-sndergaard-zobel-whatdrivescurriculumchange-2004\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Computer science curricula\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Paul\"],\"propositions\":[],\"lastnames\":[\"Gruba\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Transforming Communication Skills Instruction: The Conference Approach\",\"editor\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Edwards\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 23rd Australasian Computer Science Conference\",\"series\":\"Australian Computer Science Communications 22\",\"number\":\"1\",\"pages\":\"88–94\",\"year\":\"2000\",\"publisher\":\"IEEE Computer Society\",\"location\":\"Canberra, Australia\",\"doi\":\"10.1109/ACSC.2000.824385\",\"abstract\":\"From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge learners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.\",\"keywords\":\"Education, Communication skills instruction\",\"bibtex\":\"@InProceedings{Gru-Son_ACSC00,\\n  author    = {Paul Gruba and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Transforming Communication Skills Instruction:\\n                        The Conference Approach},\\n  editor    = {J. Edwards},\\n  booktitle = {Proceedings of the 23rd Australasian Computer Science \\n\\t\\tConference},\\n  series    = {Australian Computer Science Communications 22},\\n  number    = {1},\\n  pages     = {88--94},\\n  year      = {2000},\\n  publisher = {IEEE Computer Society},\\n  location  = {Canberra, Australia},\\n  doi       = {10.1109/ACSC.2000.824385},\\n  abstract  = {From the social constructivist perspective of education, \\n\\t\\tlearning is best achieved when students face complex, real \\n\\t\\tworld problems in which there are no clear answers. Faced with\\n\\t\\ta sizable common goal, students work collaboratively towards \\n\\t\\toutcomes and maintain ownership over key decisions. The role \\n\\t\\tof staff is that of facilitators whose role is to challenge \\n\\t\\tlearners to explore multiple aspects of the problem as they go \\n\\t\\tabout reaching viable solutions. Such a role contrasts, for \\n\\t\\texample, to an approach which sets out to lead students to a \\n\\t\\tpresumed correct solution that is already possessed by the\\n\\t\\tinstructor. Based on these principles we designed and \\n\\t\\timplemented a course on communication skills in Computer \\n\\t\\tScience. Here, we describe our experiences using a student-run \\n\\t\\tconference as a means to teach communication skills. In this \\n\\t\\tapproach, students were charged with the task of planning and \\n\\t\\torganising a conference, including peer review, publicity, \\n\\t\\tbudget, sponsorship, web design, conference program, \\n\\t\\tpresentation schedule, speaker support, and catering.\\n\\t\\tWe describe the principles and their implementation and \\n\\t\\treflect on the outcome.},\\n  keywords  = {Education, Communication skills instruction},\\n}\\n\\n\",\"author_short\":[\"Gruba, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Edwards, J.\"],\"key\":\"Gru-Son_ACSC00\",\"id\":\"Gru-Son_ACSC00\",\"bibbaseid\":\"gruba-sndergaard-transformingcommunicationskillsinstructiontheconferenceapproach-2000\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Communication skills instruction\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Paul\"],\"propositions\":[],\"lastnames\":[\"Gruba\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A Constructivist Approach to Communication Skills Instruction in Computer Science\",\"journal\":\"Computer Science Education\",\"volume\":\"11\",\"number\":\"3\",\"pages\":\"203–219\",\"year\":\"2001\",\"doi\":\"10.1076/csed.11.3.203.3833\",\"abstract\":\"From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge l earners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.\",\"keywords\":\"Education, Communication skills instruction\",\"bibtex\":\"@Article{Gru-Son_CSE01,\\n  author    = {Paul Gruba and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {A Constructivist Approach to Communication Skills Instruction \\n\\t\\tin Computer Science},\\n  journal   = {Computer Science Education},\\n  volume    = {11},\\n  number    = {3},\\n  pages     = {203--219},\\n  year      = {2001},\\n  doi       = {10.1076/csed.11.3.203.3833},\\n  abstract  = {From the social constructivist perspective of education, \\n\\t\\tlearning is best achieved when students face complex, real \\n\\t\\tworld problems in which there are no clear answers. Faced with\\n\\t\\ta sizable common goal, students work collaboratively towards \\n\\t\\toutcomes and maintain ownership over key decisions. The role \\n\\t\\tof staff is that of facilitators whose role is to challenge l\\n\\t\\tearners to explore multiple aspects of the problem as they go \\n\\t\\tabout reaching viable solutions. Such a role contrasts, for \\n\\t\\texample, to an approach which sets out to lead students to a \\n\\t\\tpresumed correct solution that is already possessed by the\\n\\t\\tinstructor. Based on these principles we designed and \\n\\t\\timplemented a course on communication skills in Computer \\n\\t\\tScience. Here, we describe our experiences using a student-run \\n\\t\\tconference as a means to teach communication skills. In this \\n\\t\\tapproach, students were charged with the task of planning and \\n\\t\\torganising a conference, including peer review, publicity, \\n\\t\\tbudget, sponsorship, web design, conference program, \\n\\t\\tpresentation schedule, speaker support, and catering. We \\n\\t\\tdescribe the principles and their implementation and reflect \\n\\t\\ton the outcome.},\\n  keywords  = {Education, Communication skills instruction},\\n}\\n\\n\",\"author_short\":[\"Gruba, P.\",\"Søndergaard, H.\"],\"key\":\"Gru-Son_CSE01\",\"id\":\"Gru-Son_CSE01\",\"bibbaseid\":\"gruba-sndergaard-aconstructivistapproachtocommunicationskillsinstructionincomputerscience-2001\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Communication skills instruction\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Trevor\"],\"propositions\":[],\"lastnames\":[\"Hansen\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"State Joining and Splitting for the Symbolic Execution of Binaries\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Bensalem\"],\"suffixes\":[]},{\"firstnames\":[\"D.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Peled\"],\"suffixes\":[]}],\"booktitle\":\"Runtime Verification\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5779\",\"pages\":\"76–92\",\"publisher\":\"Springer\",\"year\":\"2009\",\"doi\":\"10.1007/978-3-642-04694-0_6\",\"abstract\":\"Symbolic execution can be used to explore the possible run-time states of a program. It makes use of a concept of ``state'' where a variable's value has been replaced by an expression that gives the value as a function of program input. Additionally, a state can be equipped with a summary of control-flow history: a ``path constraint'' keeps track of the class of inputs that would have caused the same flow of control. But even simple programs can have trillions of paths, so a path-by-path analysis is impractical. We investigate a ``state joining'' approach to making symbolic execution more practical and describe the challenges of applying state joining to the analysis of unmodified Linux x86 executables. The results so far are mixed, with good results for some code. On other examples, state joining produces cumbersome constraints that are more expensive to solve than those generated by normal symbolic execution.\",\"keywords\":\"Symbolic execution\",\"bibtex\":\"@Inproceedings{Han-Sch-Son_RV09,\\n  author    = {Trevor Hansen and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {State Joining and Splitting for the Symbolic Execution \\n\\t\\tof Binaries},\\n  editor    = {S. Bensalem and D. A. Peled},\\n  booktitle = {Runtime Verification},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5779},\\n  pages     = {76--92},\\n  publisher = {Springer},\\n  year      = {2009},\\n  doi       = {10.1007/978-3-642-04694-0_6},\\n  abstract  = {Symbolic execution can be used to explore the possible run-time \\n\\t\\tstates of a program. It makes use of a concept of ``state'' \\n\\t\\twhere a variable's value has been replaced by an expression \\n\\t\\tthat gives the value as a function of program input. \\n\\t\\tAdditionally, a state can be equipped with a summary of \\n\\t\\tcontrol-flow history: a ``path constraint'' keeps track of the\\n\\t\\tclass of inputs that would have caused the same flow of control.\\n\\t\\tBut even simple programs can have trillions of paths, so a \\n\\t\\tpath-by-path analysis is impractical. We investigate a \\n\\t\\t``state joining'' approach to making symbolic execution more \\n\\t\\tpractical and describe the challenges of applying state joining\\n\\t\\tto the analysis of unmodified Linux x86 executables. The results\\n\\t\\tso far are mixed, with good results for some code. On other\\n\\t\\texamples, state joining produces cumbersome constraints that \\n\\t\\tare more expensive to solve than those generated by normal \\n\\t\\tsymbolic execution.},\\n  keywords  = {Symbolic execution},\\n}\\n\\n\",\"author_short\":[\"Hansen, T.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Bensalem, S.\",\"Peled, D. A.\"],\"key\":\"Han-Sch-Son_RV09\",\"id\":\"Han-Sch-Son_RV09\",\"bibbaseid\":\"hansen-schachte-sndergaard-statejoiningandsplittingforthesymbolicexecutionofbinaries-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Symbolic execution\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Henshall\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Leigh\"],\"propositions\":[],\"lastnames\":[\"Whiting\"],\"suffixes\":[]}],\"title\":\"Boolean Affine Approximation with Binary Decision Diagrams\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Downey\"],\"suffixes\":[]},{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Manyem\"],\"suffixes\":[]}],\"booktitle\":\"Theory of Computing 2009\",\"series\":\"Conferences in Research and Practice in Information Technology\",\"volume\":\"94\",\"pages\":\"121–129\",\"year\":\"2009\",\"url\":\"http://crpit.com/Vol94.html\",\"abstract\":\"Selman and Kautz's work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In the classical approach, the knowledge-base is assumed to be presented as a propositional formula in conjunctive normal form (CNF), and Horn functions are used to over- and under-approximate it (in the hope that many queries can be answered efficiently using the approximations only). However, other representations are possible, and functions other than Horn can be used for approximations, as long as they have deduction-computational properties similar to those of the Horn functions. Zanuttini has suggested that the class of affine Boolean functions would be especially useful in knowledge compilation and has presented various affine approximation algorithms. Since CNF is awkward for presenting affine functions, Zanuttini considers both a sets-of-models representation and the use of modulo 2 congruence equations. Here we consider the use of reduced ordered binary decision diagrams (ROBDDs), a representation which is more compact than the sets of models and which (unlike modulo 2 congruences) can express any source knowledge-base. We present an ROBDD algorithm to find strongest affine upper-approximations of a Boolean function and we argue its correctness.\",\"keywords\":\"Boolean logic, Boolean approximation, Knowledge compilation, ROBDDs\",\"bibtex\":\"@InProceedings{Hen-Sch-Son-Whi_CATS09,\\n  author    = {Kevin Henshall and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tLeigh Whiting},\\n  title     = {Boolean Affine Approximation with Binary Decision Diagrams},\\n  editor    = {R. Downey and P. Manyem},\\n  booktitle = {Theory of Computing 2009},\\n  series    = {Conferences in Research and Practice in Information Technology},\\n  volume    = {94},\\n  pages     = {121--129},\\n  year      = {2009},\\n  url       = {http://crpit.com/Vol94.html},\\n  abstract  ={Selman and Kautz's work on knowledge compilation has\\n\\t\\testablished how approximation (strengthening and/or\\n\\t\\tweakening) of a propositional knowledge-base can be used to\\n\\t\\tspeed up query processing, at the expense of completeness.\\n\\t\\tIn the classical approach, the knowledge-base is assumed\\n\\t\\tto be presented as a propositional formula in conjunctive\\n\\t\\tnormal form (CNF), and Horn functions are used to over-\\n\\t\\tand under-approximate it (in the hope that many queries\\n\\t\\tcan be answered efficiently using the approximations only).\\n\\t\\tHowever, other representations are possible, and functions\\n\\t\\tother than Horn can be used for approximations, as long\\n\\t\\tas they have deduction-computational properties similar to\\n\\t\\tthose of the Horn functions. Zanuttini has suggested that\\n\\t\\tthe class of affine Boolean functions would be especially\\n\\t\\tuseful in knowledge compilation and has presented various\\n\\t\\taffine approximation algorithms. Since CNF is awkward\\n\\t\\tfor presenting affine functions, Zanuttini considers both\\n\\t\\ta sets-of-models representation and the use of modulo 2\\n\\t\\tcongruence equations. Here we consider the use of reduced\\n\\t\\tordered binary decision diagrams (ROBDDs), a representation\\n\\t\\twhich is more compact than the sets of models and which\\n\\t\\t(unlike modulo 2 congruences) can express any source\\n\\t\\tknowledge-base. We present an ROBDD algorithm to find\\n\\t\\tstrongest affine upper-approximations of a Boolean function\\n\\t\\tand we argue its correctness.},\\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, ROBDDs},\\n}\\n\\n\",\"author_short\":[\"Henshall, K.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Whiting, L.\"],\"editor_short\":[\"Downey, R.\",\"Manyem, P.\"],\"key\":\"Hen-Sch-Son-Whi_CATS09\",\"id\":\"Hen-Sch-Son-Whi_CATS09\",\"bibbaseid\":\"henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://crpit.com/Vol94.html\"},\"keyword\":[\"Boolean logic\",\"Boolean approximation\",\"Knowledge compilation\",\"ROBDDs\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Henshall\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Leigh\"],\"propositions\":[],\"lastnames\":[\"Whiting\"],\"suffixes\":[]}],\"title\":\"An Algorithm for Affine Approximation of Binary Decision Diagrams\",\"journal\":\"Chicago Journal of Theoretical Computer Science\",\"volume\":\"2010\",\"number\":\"11\",\"publisher\":\"University of Chicago\",\"month\":\"June\",\"year\":\"2010\",\"doi\":\"10.4086/cjtcs.2010.011\",\"abstract\":\"This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function's best proxy in the class? Specifically, what is its strongest logical consequence (or \\\\emphenvelope) in the class of \\\\emphaffine Boolean functions. We prove various properties of affine Boolean functions and their representation as ROBDDs. Using these properties, we develop an ROBDD algorithm to find the affine envelope of a Boolean function.\",\"keywords\":\"Boolean logic, Boolean approximation, Knowledge compilation\",\"bibtex\":\"@article{Hen-Sch-Son-Whi_CJTCS10,\\n  author    = {Kevin Henshall and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tLeigh Whiting},\\n  title     = {An Algorithm for Affine Approximation of Binary Decision \\n\\t\\tDiagrams},\\n  journal   = {Chicago Journal of Theoretical Computer Science},\\n  volume    = {2010},\\n  number    = {11},\\n  publisher = {University of Chicago},\\n  month     = {June},\\n  year      = {2010},\\n  doi       = {10.4086/cjtcs.2010.011},\\n  abstract  = {This paper is concerned with the problem of Boolean approximation\\n\\t\\tin the following sense: given a Boolean function class and an\\n\\t\\tarbitrary Boolean function, what is the function's best proxy in\\n\\t\\tthe class? Specifically, what is its strongest logical \\n\\t\\tconsequence (or \\\\emph{envelope}) in the class of \\\\emph{affine} \\n\\t\\tBoolean functions. We prove various properties of affine Boolean\\n\\t\\tfunctions and their representation as ROBDDs. Using these \\n\\t\\tproperties, we develop an ROBDD algorithm to find the affine \\n\\t\\tenvelope of a Boolean function.},\\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation},\\n}\\n\\n\",\"author_short\":[\"Henshall, K.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Whiting, L.\"],\"key\":\"Hen-Sch-Son-Whi_CJTCS10\",\"id\":\"Hen-Sch-Son-Whi_CJTCS10\",\"bibbaseid\":\"henshall-schachte-sndergaard-whiting-analgorithmforaffineapproximationofbinarydecisiondiagrams-2010\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Boolean approximation\",\"Knowledge compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Brian\"],\"propositions\":[],\"lastnames\":[\"Herlihy\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Boolean Equation Solving as Graph Traversal\",\"editor\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Gudmundsson\"],\"suffixes\":[]},{\"firstnames\":[\"B.\"],\"propositions\":[],\"lastnames\":[\"Jay\"],\"suffixes\":[]}],\"booktitle\":\"Theory of Computing 2006\",\"series\":\"Conferences in Research and Practice in Information Technology\",\"volume\":\"51\",\"pages\":\"123–132\",\"year\":\"2006\",\"url\":\"http://crpit.com/Vol51.html\",\"abstract\":\"We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed point is reached. Conceptually, our new method replaces each $k$-ary function by $2^k$ Boolean variables defined by mutual recursion. The introduction of an exponential number of variables is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experimental evaluation suggests that this approach is significantly faster than Kleene iteration for examples that would require many Kleene iteration steps.\",\"keywords\":\"Fixed points, ROBDDs\",\"bibtex\":\"@InProceedings{Her-Sch-Son_CATS06,\\n  author    = {Brian Herlihy and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Boolean Equation Solving as Graph Traversal},\\n  editor    = {J. Gudmundsson and B. Jay},\\n  booktitle = {Theory of Computing 2006},\\n  series    = {Conferences in Research and Practice in Information Technology},\\n  volume    = {51},\\n  pages     = {123--132},\\n  year      = {2006},\\n  url       = {http://crpit.com/Vol51.html},\\n  abstract  = {We present a new method for finding closed forms of recursive \\n\\t\\tBoolean function definitions. Traditionally, these closed forms\\n\\t\\tare found by iteratively approximating until a fixed point is \\n\\t\\treached. Conceptually, our new method replaces each $k$-ary \\n\\t\\tfunction by $2^k$ Boolean variables defined by mutual recursion.\\n\\t\\tThe introduction of an exponential number of variables is \\n\\t\\tmitigated by the simplicity of their definitions and by the use\\n\\t\\tof a novel variant of ROBDDs to avoid repeated computation.\\n\\t\\tExperimental evaluation suggests that this approach is \\n\\t\\tsignificantly faster than Kleene iteration for examples that \\n\\t\\twould require many Kleene iteration steps.},\\n  keywords  = {Fixed points, ROBDDs},\\n}\\n\\n\",\"author_short\":[\"Herlihy, B.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Gudmundsson, J.\",\"Jay, B.\"],\"key\":\"Her-Sch-Son_CATS06\",\"id\":\"Her-Sch-Son_CATS06\",\"bibbaseid\":\"herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://crpit.com/Vol51.html\"},\"keyword\":[\"Fixed points\",\"ROBDDs\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Brian\"],\"propositions\":[],\"lastnames\":[\"Herlihy\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Un-Kleene Boolean Equation Solving\",\"journal\":\"International Journal on Foundations of Computer Science\",\"volume\":\"18\",\"number\":\"2\",\"pages\":\"227–250\",\"year\":\"2007\",\"doi\":\"10.1142/S0129054107004668\",\"abstract\":\"We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by Kleene iteration: iterative approximation until a fixed point is reached. Conceptually, our new method replaces each $k$-ary function by $2^k$ Boolean constants defined by mutual recursion. The introduction of an exponential number of constants is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experiments suggest that this approach is significantly faster than Kleene iteration for examples that require many Kleene iteration steps.\",\"keywords\":\"Fixed points, ROBDDs\",\"bibtex\":\"@Article{Her-Sch-Son_IJFCS07,\\n  author    = {Brian Herlihy and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Un-{Kleene} {Boolean} Equation Solving},\\n  journal   = {International Journal on Foundations of Computer Science},\\n  volume    = {18},\\n  number    = {2},\\n  pages     = {227--250},\\n  year      = {2007},\\n  doi       = {10.1142/S0129054107004668},\\n  abstract  = {We present a new method for finding closed forms of recursive \\n\\t\\tBoolean function definitions. Traditionally, these closed forms\\n\\t\\tare found by Kleene iteration: iterative approximation until a \\n\\t\\tfixed point is reached. Conceptually, our new method replaces \\n\\t\\teach $k$-ary function by $2^k$ Boolean constants defined by \\n\\t\\tmutual recursion. The introduction of an exponential number of\\n\\t\\tconstants is mitigated by the simplicity of their definitions \\n\\t\\tand by the use of a novel variant of ROBDDs to avoid repeated \\n\\t\\tcomputation. Experiments suggest that this approach is \\n\\t\\tsignificantly faster than Kleene iteration for examples that \\n\\t\\trequire many Kleene iteration steps.},\\n  keywords  = {Fixed points, ROBDDs},\\n}\\n\\n\",\"author_short\":[\"Herlihy, B.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"key\":\"Her-Sch-Son_IJFCS07\",\"id\":\"Her-Sch-Son_IJFCS07\",\"bibbaseid\":\"herlihy-schachte-sndergaard-unkleenebooleanequationsolving-2007\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Fixed points\",\"ROBDDs\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Roy\"],\"propositions\":[],\"lastnames\":[\"Johnston\"],\"suffixes\":[]},{\"firstnames\":[\"Alistair\"],\"propositions\":[],\"lastnames\":[\"Moffat\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Low-Contact Learning in a First Year Programming Course\",\"editor\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Rosenberg\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the First Australasian Conference on Computer Science Education\",\"pages\":\"19–26\",\"publisher\":\"ACM Press\",\"year\":\"1996\",\"location\":\"Sydney, Australia\",\"doi\":\"10.1145/369585.369589\",\"abstract\":\"Very large class sizes for introductory programming subjects pose a variety of problems, logistic and pedagogic. In response to these problems, we are experimenting with low-contact streams in a class of 750 first year students. Motivated and disciplined students are offered the alternative of fewer lectures and tutorials, that is, less direct contact, in return for more (compulsory) homework and increased feed-back, that is, more indirect contact. With a home computer and a link to the University, such students can take the subject with more flexible timetabling. We provide material to support the higher degree of self-study and tools for students to monitor their own progress. This paper describes how the low-contact streams are organised and discusses the advantages and disadvantages of the approach. A thorough evaluation is not possible yet, but our initial impression is that both traditional and self-paced students benefit—the traditional students are better catered for in a course that is pitched at a slightly lower and less challenging level, and the self-paced students respond to the challenge and extend themselves in a manner that might not occur in a large lecture group.\",\"keywords\":\"Education\",\"bibtex\":\"@Inproceedings{Joh-Mof-Son-Stu_ACSE96,\\n  author    = {Roy Johnston and \\n\\t\\tAlistair Moffat and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title\\t    = {Low-Contact Learning in a First Year Programming Course},\\n  editor    = {J. Rosenberg},\\n  booktitle = {Proceedings of the First Australasian Conference on \\n\\t\\tComputer Science Education},\\n  pages     = {19--26},\\n  publisher = {ACM Press},\\n  year      = {1996},\\n  location  = {Sydney, Australia},\\n  doi       = {10.1145/369585.369589},\\n  abstract  = {Very large class sizes for introductory programming subjects pose\\n\\t\\ta variety of problems, logistic and pedagogic.\\n\\t\\tIn response to these problems, we are experimenting with \\n\\t\\tlow-contact streams in a class of 750 first year students.\\n\\t\\tMotivated and disciplined students are offered the alternative \\n\\t\\tof fewer lectures and tutorials, that is, less direct contact, \\n\\t\\tin return for more (compulsory) homework and increased \\n\\t\\tfeed-back, that is, more indirect contact.\\n\\t\\tWith a home computer and a link to the University, such \\n\\t\\tstudents can take the subject with more flexible timetabling.\\n\\t\\tWe provide material to support the higher degree of self-study \\n\\t\\tand tools for students to monitor their own progress.\\n\\t\\tThis paper describes how the low-contact streams are organised \\n\\t\\tand discusses the advantages and disadvantages of the approach.\\n\\t\\tA thorough evaluation is not possible yet, but our initial \\n\\t\\timpression is that both traditional and self-paced students \\n\\t\\tbenefit---the traditional students are better catered for in \\n\\t\\ta course that is pitched at a slightly lower and less \\n\\t\\tchallenging level, and the self-paced students respond to the \\n\\t\\tchallenge and extend themselves in a manner that might not \\n\\t\\toccur in a large lecture group.},\\n  keywords  = {Education},\\n}\\n\\n\",\"author_short\":[\"Johnston, R.\",\"Moffat, A.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Rosenberg, J.\"],\"key\":\"Joh-Mof-Son-Stu_ACSE96\",\"id\":\"Joh-Mof-Son-Stu_ACSE96\",\"bibbaseid\":\"johnston-moffat-sndergaard-stuckey-lowcontactlearninginafirstyearprogrammingcourse-1996\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation\",\"journal\":\"Lisp and Symbolic Computation\",\"volume\":\"2\",\"number\":\"1\",\"pages\":\"9–50\",\"year\":\"1989\",\"doi\":\"10.1007/BF01806312\",\"abstract\":\"The program transformation principle called partial evaluation has interesting applications in compilation and compiler generation. Self-applicable partial evaluators may be used for transforming interpreters into corresponding compilers and even for the generation of compiler generators. This is useful because interpreters are significantly easier to write than compilers, but run much slower than compiled code. A major difficulty in writing compilers (and compiler generators) is the thinking in terms of distinct binding times: run time and compile time (and compiler generation time). The paper gives an introduction to partial evaluation and describes a fully automatic though experimental partial evaluator, called mix, able to generate stand-alone compilers as well as a compiler generator. Mix partially evaluates programs written in Mixwell, essentially a first-order subset of statically scoped pure Lisp. For compiler generation purposes it is necessary that the partial evaluator be self-applicable. Even though the potential utility of a self-applicable partial evaluator has been recognized since 1971, a 1984 version of mix appears to be the first successful implementation. The overall structure of mix and the basic ideas behind its way of working are sketched. Finally, some results of using a version of mix are reported.\",\"keywords\":\"Partial evaluation, Program transformation, Compilation\",\"bibtex\":\"@Article{Jon-Ses-Son_LASC89,\\n  author    = {Neil D. Jones and \\n\\t\\tPeter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in\\n\\t\\tCompiler Generation},\\n  journal   = {Lisp and Symbolic Computation},\\n  volume    = {2},\\n  number    = {1},\\n  pages     = {9--50},\\n  year      = {1989},\\n  doi       = {10.1007/BF01806312},\\n  abstract  = {The program transformation principle called partial \\n\\t\\tevaluation has interesting applications in compilation\\n\\t\\tand compiler generation. Self-applicable partial evaluators\\n\\t\\tmay be used for transforming interpreters into corresponding\\n\\t\\tcompilers and even for the generation of compiler generators.\\n\\t\\tThis is useful because interpreters are significantly easier\\n\\t\\tto write than compilers, but run much slower than compiled\\n\\t\\tcode. A major difficulty in writing compilers (and compiler\\n\\t\\tgenerators) is the thinking in terms of distinct binding\\n\\t\\ttimes: run time and compile time (and compiler generation\\n\\t\\ttime). The paper gives an introduction to partial\\n\\t\\tevaluation and describes a fully automatic though \\n\\t\\texperimental partial evaluator, called mix, able to generate\\n\\t\\tstand-alone compilers as well as a compiler generator.\\n\\t\\tMix partially evaluates programs written in Mixwell,\\n\\t\\tessentially a first-order subset of statically scoped pure\\n\\t\\tLisp. For compiler generation purposes it is necessary\\n\\t\\tthat the partial evaluator be self-applicable. Even though\\n\\t\\tthe potential utility of a self-applicable partial evaluator\\n\\t\\thas been recognized since 1971, a 1984 version of mix\\n\\t\\tappears to be the first successful implementation.\\n\\t\\tThe overall structure of mix and the basic ideas behind its\\n\\t\\tway of working are sketched. Finally, some results of using\\n\\t\\ta version of mix are reported.},\\n  keywords  = {Partial evaluation, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Jones, N. D.\",\"Sestoft, P.\",\"Søndergaard, H.\"],\"key\":\"Jon-Ses-Son_LASC89\",\"id\":\"Jon-Ses-Son_LASC89\",\"bibbaseid\":\"jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergeneration-1989\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"An Experiment in Partial Evaluation: The Generation of a Compiler Generator\",\"editor\":[{\"firstnames\":[\"J.-P.\"],\"propositions\":[],\"lastnames\":[\"Jouannaud\"],\"suffixes\":[]}],\"booktitle\":\"Rewriting Techniques and Applications\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"202\",\"pages\":\"124–140\",\"publisher\":\"Springer-Verlag\",\"year\":\"1985\",\"note\":\"Reviewed in Computing Reviews 27(7): 353, 1986\",\"doi\":\"10.1007/3-540-15976-2_6\",\"keywords\":\"Partial evaluation, Program transformation, Compilation\",\"bibtex\":\"@Incollection{Jon-Ses-Son_RTA85,\\n  author    = {Neil D. Jones and \\n\\t\\tPeter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {An Experiment in Partial Evaluation:\\n\\t\\t\\tThe Generation of a Compiler Generator},\\n  editor    = {J.-P. Jouannaud},\\n  booktitle = {Rewriting Techniques and Applications},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {202},\\n  pages     = {124--140},\\n  publisher = {Springer-Verlag},\\n  year      = {1985},\\n  note      = {Reviewed in Computing Reviews 27(7): 353, 1986},\\n  doi       = {10.1007/3-540-15976-2_6},\\n  keywords  = {Partial evaluation, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Jones, N. D.\",\"Sestoft, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Jouannaud, J.\"],\"key\":\"Jon-Ses-Son_RTA85\",\"id\":\"Jon-Ses-Son_RTA85\",\"bibbaseid\":\"jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergenerator-1985\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"An Experiment in Partial Evaluation: The Generation of a Compiler Generator (Extended Abstract)\",\"journal\":\"SIGPLAN Notices\",\"volume\":\"20\",\"number\":\"8\",\"pages\":\"82–87\",\"year\":\"1985\",\"doi\":\"10.1145/988346.988358\",\"keywords\":\"Partial evaluation, Program transformation, Compilation\",\"bibtex\":\"@Article{Jon-Ses-Son_SIGPLANN85,\\n  author    = {Neil D. Jones and \\n\\t\\tPeter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {An Experiment in Partial Evaluation: The Generation of a \\n\\t\\tCompiler Generator (Extended Abstract)},\\n  journal   = {SIGPLAN Notices},\\n  volume    = {20},\\n  number    = {8},\\n  pages     = {82--87},\\n  year      = {1985},\\n  doi       = {10.1145/988346.988358},\\n  keywords  = {Partial evaluation, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Jones, N. D.\",\"Sestoft, P.\",\"Søndergaard, H.\"],\"key\":\"Jon-Ses-Son_SIGPLANN85\",\"id\":\"Jon-Ses-Son_SIGPLANN85\",\"bibbaseid\":\"jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergeneratorextendedabstract-1985\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation—Extended Abstract\",\"editor\":[{\"firstnames\":[\"M.\",\"Main\"],\"propositions\":[\"et\",\"al.\"],\"lastnames\":[],\"suffixes\":[]}],\"booktitle\":\"Mathematical Foundations of Programming Language Semantics\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"298\",\"publisher\":\"Springer-Verlag\",\"pages\":\"386–413\",\"year\":\"1987\",\"doi\":\"10.1007/3-540-19020-1_21\",\"keywords\":\"Partial evaluation, Program transformation, Compilation\",\"bibtex\":\"@Incollection{Jon-Ses-Son_mix-abstract87,\\n  author    = {Neil D. Jones and \\n\\t\\tPeter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in\\n\\t\\tCompiler Generation---Extended Abstract},\\n  editor    = {M. Main et al.},\\n  booktitle = {Mathematical Foundations of Programming Language Semantics},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {298},\\n  publisher = {Springer-Verlag},\\n  pages     = {386--413},\\n  year      = {1987},\\n  doi       = {10.1007/3-540-19020-1_21},\\n  keywords  = {Partial evaluation, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Jones, N. D.\",\"Sestoft, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"et al. , M. M.\"],\"key\":\"Jon-Ses-Son_mix-abstract87\",\"id\":\"Jon-Ses-Son_mix-abstract87\",\"bibbaseid\":\"jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergenerationextendedabstract-1987\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"incollection\",\"type\":\"incollection\",\"author\":[{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A Semantics-Based Framework for the Abstract Interpretation of Prolog\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Abramsky\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Hankin\"],\"suffixes\":[]}],\"booktitle\":\"Abstract Interpretation of Declarative Languages\",\"chapter\":\"6\",\"pages\":\"123–142\",\"publisher\":\"Ellis Horwood\",\"year\":\"1987\",\"keywords\":\"Abstract interpretation, Logic programming, Prolog, Groundness analysis, Sharing analysis\",\"bibtex\":\"@Incollection{Jon-Son_absint87,\\n  author    = {Neil D. Jones and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {A Semantics-Based Framework for the Abstract Interpretation of \\n\\t\\t{Prolog}},\\n  editor    = {S. Abramsky and C. Hankin},\\n  booktitle = {Abstract Interpretation of Declarative Languages},\\n  chapter   = {6},\\n  pages     = {123--142},\\n  publisher = {Ellis Horwood},\\n  year      = {1987},\\n  keywords  = {Abstract interpretation, Logic programming, Prolog, Groundness analysis, Sharing analysis},\\n}\\n\\n\",\"author_short\":[\"Jones, N. D.\",\"Søndergaard, H.\"],\"editor_short\":[\"Abramsky, S.\",\"Hankin, C.\"],\"key\":\"Jon-Son_absint87\",\"id\":\"Jon-Son_absint87\",\"bibbaseid\":\"jones-sndergaard-asemanticsbasedframeworkfortheabstractinterpretationofprolog-1987\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\",\"Prolog\",\"Groundness analysis\",\"Sharing analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Bishoksan\"],\"propositions\":[],\"lastnames\":[\"Kafle\"],\"suffixes\":[]},{\"firstnames\":[\"John\"],\"propositions\":[],\"lastnames\":[\"Gallagher\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"An Iterative Approach to Precondition Inference Using Constrained Horn Clauses\",\"journal\":\"Theory and Practice of Logic Programming\",\"volume\":\"18\",\"pages\":\"553–570\",\"year\":\"2018\",\"doi\":\"10.1017/S1471068418000091\",\"abstract\":\"We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained Horn clauses (CHCs) are used to model the program and assertions in a uniform way, and we use standard abstract interpretations to derive an over-approximation of the set of unsafe initial states. The precondition then is the constraint corresponding to the complement of that set, under-approximating the set of safe initial states. This idea of complementation is not new, but previous attempts to exploit it have suffered from loss of precision. Here we develop an iterative specialisation algorithm to give more precise, and in some cases optimal safety conditions. The algorithm combines existing transformations, namely constraint specialisation, partial evaluation and a trace elimination transformation. The last two of these transformations perform polyvariant specialisation, leading to disjunctive constraints which improve precision. The algorithm is implemented and tested on a benchmark suite of programs from the literature in precondition inference and software verification competitions.\",\"keywords\":\"Program verification, Horn clauses, Program transformation, Partial evaluation\",\"bibtex\":\"@article{Kaf-Gal-Gan-Sch-Son-Stu_TPLP18,\\n  author    = {Bishoksan Kafle and \\n\\t\\tJohn Gallagher and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {An Iterative Approach to Precondition Inference Using\\n                Constrained {Horn} Clauses},\\n  journal   = {Theory and Practice of Logic Programming},\\n  volume    = {18},\\n  pages     = {553--570},\\n  year      = {2018},\\n  doi       = {10.1017/S1471068418000091},\\n  abstract  = {We present a method for automatic inference of conditions on \\n\\t\\tthe initial states of a program that guarantee that the safety \\n\\t\\tassertions in the program are not violated. Constrained Horn \\n\\t\\tclauses (CHCs) are used to model the program and assertions in \\n\\t\\ta uniform way, and we use standard abstract interpretations to \\n\\t\\tderive an over-approximation of the set of unsafe initial states.\\n\\t\\tThe precondition then is the constraint corresponding to the \\n\\t\\tcomplement of that set, under-approximating the set of safe \\n\\t\\tinitial states. This idea of complementation is not new, but \\n\\t\\tprevious attempts to exploit it have suffered from loss of \\n\\t\\tprecision. Here we develop an iterative specialisation algorithm\\n\\t\\tto give more precise, and in some cases optimal safety \\n\\t\\tconditions. The algorithm combines existing transformations, \\n\\t\\tnamely constraint specialisation, partial evaluation and a \\n\\t\\ttrace elimination transformation. The last two of these \\n\\t\\ttransformations perform polyvariant specialisation, leading \\n\\t\\tto disjunctive constraints which improve precision. The \\n\\t\\talgorithm is implemented and tested on a benchmark suite of \\n\\t\\tprograms from the literature in precondition inference and \\n\\t\\tsoftware verification competitions.},\\n  keywords  = {Program verification, Horn clauses, Program transformation, Partial evaluation},\\n}\\n\\n\",\"author_short\":[\"Kafle, B.\",\"Gallagher, J.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Kaf-Gal-Gan-Sch-Son-Stu_TPLP18\",\"id\":\"Kaf-Gal-Gan-Sch-Son-Stu_TPLP18\",\"bibbaseid\":\"kafle-gallagher-gange-schachte-sndergaard-stuckey-aniterativeapproachtopreconditioninferenceusingconstrainedhornclauses-2018\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program verification\",\"Horn clauses\",\"Program transformation\",\"Partial evaluation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Bishoksan\"],\"propositions\":[],\"lastnames\":[\"Kafle\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Gaspers\"],\"suffixes\":[]},{\"firstnames\":[\"T.\"],\"propositions\":[],\"lastnames\":[\"Walsh\"],\"suffixes\":[]}],\"booktitle\":\"Theory and Applications of Satisfiability Testing (SAT 2017)\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"10491\",\"pages\":\"380–397\",\"publisher\":\"Springer International Publishing\",\"year\":\"2017\",\"doi\":\"10.1007/978-3-319-66263-3_24\",\"abstract\":\"Verification tasks frequently require deciding systems of linear constraints over modular (machine) arithmetic. Existing approaches for reasoning over modular arithmetic use bit-vector solvers, or else approximate machine integers with mathematical integers and use arithmetic solvers. Neither is ideal; the first is sound but inefficient, and the second is efficient but unsound. We describe a linear encoding which correctly describes modular arithmetic semantics, yielding an optimistic but sound approach. Our method abstracts the problem with linear arithmetic, but progressively refines the abstraction when modular semantics is violated. This preserves soundness while exploiting the mostly integer nature of the constraint problem. We present a prototype implementation, which gives encouraging experimental results.\",\"keywords\":\"Program verification, Constraint solving, Machine arithmetic\",\"bibtex\":\"@inproceedings{Kaf-Gan-Sch-Son-Stu_SAT17,\\n  author    = {Bishoksan Kafle and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and\\n                Harald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A {Benders} Decomposition Approach to Deciding Modular\\n                Linear Integer Arithmetic},\\n  editor    = {S. Gaspers and T. Walsh},\\n  booktitle = {Theory and Applications of Satisfiability Testing (SAT 2017)},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {10491},\\n  pages     = {380--397},\\n  publisher = {Springer International Publishing},\\n  year      = {2017},\\n  doi       = {10.1007/978-3-319-66263-3_24},\\n  abstract  = {Verification tasks frequently require deciding systems of \\n\\t\\tlinear constraints over modular (machine) arithmetic. \\n\\t\\tExisting approaches for reasoning over modular arithmetic \\n\\t\\tuse bit-vector solvers, or else approximate machine integers \\n\\t\\twith mathematical integers and use arithmetic solvers. \\n\\t\\tNeither is ideal; the first is sound but inefficient, and the \\n\\t\\tsecond is efficient but unsound. We describe a linear encoding \\n\\t\\twhich correctly describes modular arithmetic semantics, \\n\\t\\tyielding an optimistic but sound approach. Our method \\n\\t\\tabstracts the problem with linear arithmetic, but \\n\\t\\tprogressively refines the abstraction when modular semantics \\n\\t\\tis violated. This preserves soundness while exploiting the \\n\\t\\tmostly integer nature of the constraint problem. We present \\n\\t\\ta prototype implementation, which gives encouraging \\n\\t\\texperimental results.},\\n  keywords  = {Program verification, Constraint solving, Machine arithmetic},\\n}\\n\\n\",\"author_short\":[\"Kafle, B.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Gaspers, S.\",\"Walsh, T.\"],\"key\":\"Kaf-Gan-Sch-Son-Stu_SAT17\",\"id\":\"Kaf-Gan-Sch-Son-Stu_SAT17\",\"bibbaseid\":\"kafle-gange-schachte-sndergaard-stuckey-abendersdecompositionapproachtodecidingmodularlinearintegerarithmetic-2017\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program verification\",\"Constraint solving\",\"Machine arithmetic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Bishoksan\"],\"propositions\":[],\"lastnames\":[\"Kafle\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Lightweight Approach to Nontermination Inference Using Constrained Horn Clauses\",\"journal\":\"Software and Systems Modeling\",\"volume\":\"23\",\"pages\":\"319–342\",\"year\":\"2024\",\"doi\":\"10.1007/s10270-024-01161-5\",\"abstract\":\"Nontermination is an unwanted program property for some software systems, and a safety property for other systems. In either case, automated discovery of preconditions for nontermination is of interest. We introduce \\\\textscNtHorn, a fast lightweight nontermination analyser, which is able to deduce non-trivial sufficient conditions for nontermination. Using Constrained Horn Clauses (CHCs) as a vehicle, we show how established techniques for CHC program transformation and abstract interpretation can be exploited for the purpose of nontermination analysis. \\\\textscNtHorn is comparable in effectiveness to the state-of-the-art nontermination analysis tools, as measured on standard competition benchmark suites (consisting of integer manipulating programs), while typically solving problems faster by one order of magnitude.\",\"bibtex\":\"@Article{Kaf-Gan-Sch-Son-Stu_SoSyM24,\\n  author    = {Bishoksan Kafle and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tPeter J. Stuckey},\\n  title     = {A Lightweight Approach to Nontermination Inference Using\\n\\t  \\t{Constrained} {Horn} {Clauses}},\\n  journal   = {Software and Systems Modeling},\\n  volume    = {23},\\n  pages     = {319--342},\\n  year      = {2024},\\n  doi       = {10.1007/s10270-024-01161-5},\\n  abstract  = {Nontermination is an unwanted program property for some \\n\\t  \\tsoftware systems, and a safety property for other systems.\\n\\t\\tIn either case, automated discovery of preconditions for \\n\\t\\tnontermination is of interest. We introduce \\\\textsc{NtHorn},\\n\\t\\ta fast lightweight nontermination analyser, which is able to\\n\\t\\tdeduce non-trivial sufficient conditions for nontermination.\\n\\t\\tUsing Constrained Horn Clauses (CHCs) as a vehicle, we show \\n\\t\\thow established techniques for CHC program transformation \\n\\t\\tand abstract interpretation can be exploited for the purpose\\n\\t\\tof nontermination analysis. \\\\textsc{NtHorn} is comparable in \\n\\t\\teffectiveness to the state-of-the-art nontermination analysis\\n\\t\\ttools, as measured on standard competition benchmark suites \\n\\t\\t(consisting of integer manipulating programs), while typically\\n\\t\\tsolving problems faster by one order of magnitude.},\\n}\\n\\n\",\"author_short\":[\"Kafle, B.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Kaf-Gan-Sch-Son-Stu_SoSyM24\",\"id\":\"Kaf-Gan-Sch-Son-Stu_SoSyM24\",\"bibbaseid\":\"kafle-gange-schachte-sndergaard-stuckey-alightweightapproachtononterminationinferenceusingconstrainedhornclauses-2024\",\"role\":\"author\",\"urls\":{},\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Bishoksan\"],\"propositions\":[],\"lastnames\":[\"Kafle\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Lightweight Non-Termination Inference with CHCs\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Calinescu\"],\"suffixes\":[]},{\"firstnames\":[\"C.\"],\"propositions\":[],\"lastnames\":[\"Păsăreanu\"],\"suffixes\":[]}],\"booktitle\":\"Software Engineering and Formal Methods\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13085\",\"pages\":\"383–402\",\"year\":\"2021\",\"doi\":\"10.1007/978-3-030-92124-8_22\",\"abstract\":\"Non-termination is an unwanted program property (considered a bug) for some software systems, and a safety property for other systems. In either case, automated discovery of preconditions for non-termination is of interest. We introduce \\\\textscNtHorn, a fast lightweight non-termination analyser, able to deduce non-trivial sufficient conditions for non-termination. Using Constrained Horn Clauses (CHCs) as a vehicle, we show how established techniques for CHC program transformation and abstract interpretation can be exploited for the purpose of non-termination analysis. \\\\textscNtHorn is comparable in power to the state-of-the-art non-termination analysis tools, as measured on standard competition benchmark suites (consisting of integer manipulating programs), while typically solving problems an order of magnitude faster.\",\"keywords\":\"Program verification, Program transformation, Partial evaluation, Nontermination analysis, Horn clauses\",\"bibtex\":\"@InProceedings{Kaf-Gan-Sch-Son-Stu_SEFM21,\\n  author    = {Bishoksan Kafle and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter Schachte and\\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tPeter J. Stuckey},\\n  title     = {Lightweight Non-Termination Inference with {CHCs}},\\n  editor    = {R. Calinescu and C. P{\\\\u{a}}s{\\\\u{a}}reanu},\\n  booktitle = {Software Engineering and Formal Methods},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {13085},\\n  pages     = {383--402},\\n  year      = {2021},\\n  doi       = {10.1007/978-3-030-92124-8_22},\\n  abstract  = {Non-termination is an unwanted program property (considered a \\n\\t\\tbug) for some software systems, and a safety property for \\n\\t\\tother systems. In either case, automated discovery of \\n\\t\\tpreconditions for non-termination is of interest. We introduce\\n\\t\\t\\\\textsc{NtHorn}, a fast lightweight non-termination analyser,\\n\\t\\table to deduce non-trivial sufficient conditions for \\n\\t\\tnon-termination. Using Constrained Horn Clauses (CHCs) as a \\n\\t\\tvehicle, we show how established techniques for CHC program \\n\\t\\ttransformation and abstract interpretation can be exploited \\n\\t\\tfor the purpose of non-termination analysis. \\\\textsc{NtHorn} \\n\\t\\tis comparable in power to the state-of-the-art\\n\\t\\tnon-termination analysis tools, as measured on standard \\n\\t\\tcompetition benchmark suites (consisting of integer \\n\\t\\tmanipulating programs), while typically solving problems \\n\\t\\tan order of magnitude faster.},\\n  keywords  = {Program verification, Program transformation, Partial evaluation, Nontermination analysis, Horn clauses},\\n}\\n\\n\",\"author_short\":[\"Kafle, B.\",\"Gange, G.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Calinescu, R.\",\"Păsăreanu, C.\"],\"key\":\"Kaf-Gan-Sch-Son-Stu_SEFM21\",\"id\":\"Kaf-Gan-Sch-Son-Stu_SEFM21\",\"bibbaseid\":\"kafle-gange-schachte-sndergaard-stuckey-lightweightnonterminationinferencewithchcs-2021\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program verification\",\"Program transformation\",\"Partial evaluation\",\"Nontermination analysis\",\"Horn clauses\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Bishoksan\"],\"propositions\":[],\"lastnames\":[\"Kafle\"],\"suffixes\":[]},{\"firstnames\":[\"Graeme\"],\"propositions\":[],\"lastnames\":[\"Gange\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Transformation-Enabled Precondition Inference\",\"journal\":\"Theory and Practice of Logic Programming\",\"volume\":\"21\",\"pages\":\"700–716\",\"year\":\"2021\",\"doi\":\"10.1017/S1471068421000272\",\"abstract\":\"Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving preconditions for the safety and unsafety of programs. Each iteration maintains over-approximations of the set of safe and unsafe initial states; which are used to partition the program's initial states into those known to be safe, known to be unsafe and unknown. We then construct revised programs with those unknown initial states and iterate the procedure until the approximations are disjoint or some termination criteria are met. An experimental evaluation of the method on a set of software verification benchmarks shows that it can infer precise preconditions (sometimes optimal) that are not possible using previous methods.\",\"keywords\":\"Program verification, Program transformation\",\"bibtex\":\"@article{Kaf-Gan-Stu-Sch-Son_TPLP21,\\n  author    = {Bishoksan Kafle and \\n\\t\\tGraeme Gange and \\n\\t\\tPeter J. Stuckey and\\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Transformation-Enabled Precondition Inference},\\n  journal   = {Theory and Practice of Logic Programming},\\n  volume    = {21},\\n  pages     = {700--716},\\n  year      = {2021},\\n  doi       = {10.1017/S1471068421000272},\\n  abstract  = {Precondition inference is a non-trivial problem with \\n\\t\\timportant applications in program analysis and verification. \\n\\t\\tWe present a novel iterative method for automatically deriving \\n\\t\\tpreconditions for the safety and unsafety of programs. \\n\\t\\tEach iteration maintains over-approximations of the set of \\n\\t\\tsafe and unsafe initial states; which are used to partition \\n\\t\\tthe program's initial states into those known to be safe, \\n\\t\\tknown to be unsafe and unknown. We then construct revised \\n\\t\\tprograms with those unknown initial states and iterate the \\n\\t\\tprocedure until the approximations are disjoint or some \\n\\t\\ttermination criteria are met. An experimental evaluation of \\n\\t\\tthe method on a set of software verification benchmarks shows \\n\\t\\tthat it can infer precise preconditions (sometimes optimal) \\n\\t\\tthat are not possible using previous methods.},\\n  keywords  = {Program verification, Program transformation},\\n}\\n\\n\",\"author_short\":[\"Kafle, B.\",\"Gange, G.\",\"Stuckey, P. J.\",\"Schachte, P.\",\"Søndergaard, H.\"],\"key\":\"Kaf-Gan-Stu-Sch-Son_TPLP21\",\"id\":\"Kaf-Gan-Stu-Sch-Son_TPLP21\",\"bibbaseid\":\"kafle-gange-stuckey-schachte-sndergaard-transformationenabledpreconditioninference-2021\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program verification\",\"Program transformation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Andrew\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Kelly\"],\"suffixes\":[]},{\"firstnames\":[\"Andrew\"],\"propositions\":[],\"lastnames\":[\"Macdonald\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Roland\",\"H.\",\"C.\"],\"propositions\":[],\"lastnames\":[\"Yap\"],\"suffixes\":[]}],\"title\":\"An Optimizing Compiler for CLP(R)\",\"editor\":[{\"firstnames\":[\"U.\"],\"propositions\":[],\"lastnames\":[\"Montanari\"],\"suffixes\":[]},{\"firstnames\":[\"F.\"],\"propositions\":[],\"lastnames\":[\"Rossi\"],\"suffixes\":[]}],\"booktitle\":\"Principles and Practice of Constraint Programming—CP'95\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"976\",\"pages\":\"222–239\",\"publisher\":\"Springer\",\"year\":\"1995\",\"doi\":\"10.1007/3-540-60299-2_14\",\"abstract\":\"The considerable expressive power and flexibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include expensive constraint solving algorithms tailored to specific domains, such as trees, Booleans, or real numbers. The performance of many current CLP compilers and interpreters does not encourage the widespread use of CLP. We outline an optimizing compiler for CLP(${a̧l R}$), a CLP language which extends Prolog by allowing linear arithmetic constraints. The compiler uses sophisticated global analyses to determine the applicability of different program transformations. Two important components of the compiler, the \\\\emphanalyzer and the \\\\emphoptimizer, work in continual interaction in order to apply semantics-preserving transformations to the source program. A large suite of transformations are planned. Currently the compiler applies three powerful transformations, namely ``solver bypass'', ``dead variable elimination'' and ``nofail constraint detection''. We explain these optimizations and their place in the overall compiler design and show how they lead to performance improvements on a set of benchmark programs.\",\"keywords\":\"Constraint programming, Logic programming, Static analysis, Program transformation, Compilation\",\"bibtex\":\"@Inproceedings{Kel-Mac-Mar-Son-Stu-Yap_CP95,\\n  author    = {Andrew D. Kelly and \\n\\t\\tAndrew Macdonald and \\n\\t\\tKim Marriott and\\n            \\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tRoland H. C. Yap},\\n  title     = {An Optimizing Compiler for {CLP(R)}},\\n  editor    = {U. Montanari and F. Rossi},\\n  booktitle = {Principles and Practice of Constraint Programming---CP'95},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {976},\\n  pages     = {222--239},\\n  publisher = {Springer},\\n  year      = {1995},\\n  doi       = {10.1007/3-540-60299-2_14},\\n  abstract  = {The considerable expressive power and flexibility gained by \\n\\t\\tcombining constraint programming with logic programming\\n\\t\\tis not without cost. Implementations of constraint logic \\n\\t\\tprogramming (CLP) languages must include expensive constraint \\n\\t\\tsolving algorithms tailored to specific domains, such as trees,\\n\\t\\tBooleans, or real numbers. The performance of many current CLP\\n\\t\\tcompilers and interpreters does not encourage the widespread \\n\\t\\tuse of CLP. We outline an optimizing compiler for \\n\\t\\tCLP(${\\\\cal R}$), a CLP language which extends Prolog by \\n\\t\\tallowing linear arithmetic constraints. The compiler uses \\n\\t\\tsophisticated global analyses to determine the applicability of\\n\\t\\tdifferent program transformations. Two important components of \\n\\t\\tthe compiler, the \\\\emph{analyzer} and the \\\\emph{optimizer}, \\n\\t\\twork in continual interaction in order to apply \\n\\t\\tsemantics-preserving transformations to the source program.\\n\\t\\tA large suite of transformations are planned. Currently the \\n\\t\\tcompiler applies three powerful transformations, namely \\n\\t\\t``solver bypass'', ``dead variable elimination'' and\\n\\t\\t``nofail constraint detection''. We explain these optimizations\\n\\t\\tand their place in the overall compiler design and show how \\n\\t\\tthey lead to performance improvements on a set of benchmark \\n\\t\\tprograms.},\\n  keywords  = {Constraint programming, Logic programming, Static analysis, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Kelly, A. D.\",\"Macdonald, A.\",\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\",\"Yap, R. H. C.\"],\"editor_short\":[\"Montanari, U.\",\"Rossi, F.\"],\"key\":\"Kel-Mac-Mar-Son-Stu-Yap_CP95\",\"id\":\"Kel-Mac-Mar-Son-Stu-Yap_CP95\",\"bibbaseid\":\"kelly-macdonald-marriott-sndergaard-stuckey-yap-anoptimizingcompilerforclpr-1995\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Static analysis\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Andrew\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Kelly\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Generic Object-Oriented Incremental Analyser for Constraint Logic Programs\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Kotagiri\"],\"suffixes\":[]},{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Zobel\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 20th Australasian Computer Science Conference\",\"series\":\"Australian Computer Science Communications\",\"volume\":\"19\",\"number\":\"1\",\"pages\":\"92–101\",\"year\":\"1997\",\"abstract\":\"The incorporation of global program analysis into compilers for constraint logic programming (CLP) languages has greatly improved the efficiency of these new languages. We present a global analyser based on abstract interpretation. The analyser is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The anayser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyser has an object-oriented design, enabling it to be easily adapted to different applications and allowing it to be used with various CLP languages. As an example of this generality, we outline the analyser's role in two different applications each for a different CLP language: an optimizing compiler for CLP(R) programs and an application for detecting occur-check problems in Prolog programs.\",\"keywords\":\"Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification\",\"bibtex\":\"@Inproceedings{Kel-Mar-Son-Stu_ACSC97,\\n  author    = {Andrew D. Kelly and \\n\\t\\tKim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Generic Object-Oriented Incremental Analyser for Constraint\\n             \\tLogic Programs},\\n  editor    = {R. Kotagiri and J. Zobel},\\n  booktitle = {Proceedings of the 20th Australasian Computer Science Conference},\\n  series    = {Australian Computer Science Communications},\\n  volume    = {19},\\n  number    = {1},\\n  pages     = {92--101},\\n  year      = {1997},\\n  abstract  = {The incorporation of global program analysis into compilers \\n\\t\\tfor constraint logic programming (CLP) languages has greatly\\n\\t\\timproved the efficiency of these new languages. We present\\n\\t\\ta global analyser based on abstract interpretation.  The \\n\\t\\tanalyser is incremental, allowing substantial program \\n\\t\\ttransformations by a compiler without requiring redundant\\n\\t\\tre-computation of analysis data. The anayser is also\\n\\t\\tgeneric in that it can perform a large number of different\\n\\t\\tprogram analyses. Furthermore, the analyser has an \\n\\t\\tobject-oriented design, enabling it to be easily adapted to\\n\\t\\tdifferent applications and allowing it to be used with various\\n\\t\\tCLP languages. As an example of this generality, we outline \\n\\t\\tthe analyser's role in two different applications each for a\\n\\t\\tdifferent CLP language: an optimizing compiler for CLP(R) \\n\\t\\tprograms and an application for detecting occur-check problems\\n\\t\\tin Prolog programs.},\\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},\\n}\\n\\n\",\"author_short\":[\"Kelly, A. D.\",\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Kotagiri, R.\",\"Zobel, J.\"],\"key\":\"Kel-Mar-Son-Stu_ACSC97\",\"id\":\"Kel-Mar-Son-Stu_ACSC97\",\"bibbaseid\":\"kelly-marriott-sndergaard-stuckey-agenericobjectorientedincrementalanalyserforconstraintlogicprograms-1997\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Abstract interpretation\",\"Prolog\",\"Static analysis\",\"Program transformation\",\"Compilation\",\"Unification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Andrew\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Kelly\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (System Description)\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Cousot\"],\"suffixes\":[]},{\"firstnames\":[\"D.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Schmidt\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis: Proceedings of the Third International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1145\",\"pages\":\"385–386\",\"publisher\":\"Springer\",\"year\":\"1996\",\"doi\":\"10.1007/3-540-61739-6_55\",\"keywords\":\"Constraint programming, Logic programming, Prolog, Static analysis, Program transformation, Compilation\",\"bibtex\":\"@Inproceedings{Kel-Mar-Son-Stu_SAS96,\\n  author    = {Andrew D. Kelly and \\n\\t\\tKim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Two Applications of an Incremental Analysis Engine for\\n                (Constraint) Logic Programs (System Description)},\\n  editor    = {R. Cousot and D. A. Schmidt},\\n  booktitle = {Static Analysis: Proceedings of the Third International \\n\\t\\tSymposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1145},\\n  pages     = {385--386},\\n  publisher = {Springer},\\n  year      = {1996},\\n  doi       = {10.1007/3-540-61739-6_55},\\n  keywords  = {Constraint programming, Logic programming, Prolog, Static analysis, Program transformation, Compilation},\\n}\\n\\n\",\"author_short\":[\"Kelly, A. D.\",\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Cousot, R.\",\"Schmidt, D. A.\"],\"key\":\"Kel-Mar-Son-Stu_SAS96\",\"id\":\"Kel-Mar-Son-Stu_SAS96\",\"bibbaseid\":\"kelly-marriott-sndergaard-stuckey-twoapplicationsofanincrementalanalysisengineforconstraintlogicprogramssystemdescription-1996\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Prolog\",\"Static analysis\",\"Program transformation\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Andrew\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Kelly\"],\"suffixes\":[]},{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Practical Object-Oriented Analysis Engine for Constraint Logic Programs\",\"journal\":\"Software—Practice and Experience\",\"volume\":\"28\",\"number\":\"2\",\"pages\":\"199–224\",\"year\":\"1998\",\"doi\":\"10.1002/(SICI)1097-024X(199802)28:2<199::AID-SPE150>3.0.CO;2-4\",\"abstract\":\"The incorporation of global program analysis into recent compilers for constraint logic programming (CLP) languages has greatly improved the efficiency of these new languages. We present a global analyzer based on abstract interpretation. Unlike traditional optimizers, whose designs tend to be ad hoc, the analyzer has been designed with maxiaml flexibility in mind. The analyzer is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The anayser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyzer has an object-oriented design, enabling it to be adapted to different applications and allowing it to be used with various CLP languages with simple modifications. As an example of this generality, we sketch the use of the analyzer in two different applications involving two different CLP languages: an optimizing compiler for CLP(${a̧l R}$) programs and an application for detecting occur-check problems in Prolog programs.\",\"keywords\":\"Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification\",\"bibtex\":\"@Article{Kel-Mar-Son-Stu_SPE98,\\n  author    = {Andrew D. Kelly and \\n\\t\\tKim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Practical Object-Oriented Analysis Engine for Constraint\\n                Logic Programs},\\n  journal   = {Software---Practice and Experience},\\n  volume    = {28},\\n  number    = {2},\\n  pages     = {199--224},\\n  year      = {1998},\\n  doi       = {10.1002/(SICI)1097-024X(199802)28:2<199::AID-SPE150>3.0.CO;2-4},\\n  abstract  = {The incorporation of global program analysis into recent \\n\\t\\tcompilers for constraint logic programming (CLP) languages has \\n\\t\\tgreatly improved the efficiency of these new languages. We \\n\\t\\tpresent a global analyzer based on abstract interpretation.\\n\\t\\tUnlike traditional optimizers, whose designs tend to be ad hoc,\\n\\t\\tthe analyzer has been designed with maxiaml flexibility in\\n\\t\\tmind. The analyzer is incremental, allowing substantial program\\n\\t\\ttransformations by a compiler without requiring redundant\\n\\t\\tre-computation of analysis data. The anayser is also\\n\\t\\tgeneric in that it can perform a large number of different\\n\\t\\tprogram analyses. Furthermore, the analyzer has an\\n\\t\\tobject-oriented design, enabling it to be adapted to different\\n\\t\\tapplications and allowing it to be used with various CLP \\n\\t\\tlanguages with simple modifications. As an example of this \\n\\t\\tgenerality, we sketch the use of the analyzer in two different\\n\\t\\tapplications involving two different CLP languages: an \\n\\t\\toptimizing compiler for CLP(${\\\\cal R}$) programs and an \\n\\t\\tapplication for detecting occur-check problems in Prolog \\n\\t\\tprograms.},\\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},\\n}\\n\\n\",\"author_short\":[\"Kelly, A. D.\",\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Kel-Mar-Son-Stu_SPE98\",\"id\":\"Kel-Mar-Son-Stu_SPE98\",\"bibbaseid\":\"kelly-marriott-sndergaard-stuckey-apracticalobjectorientedanalysisengineforconstraintlogicprograms-1998\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Abstract interpretation\",\"Prolog\",\"Static analysis\",\"Program transformation\",\"Compilation\",\"Unification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Andy\"],\"propositions\":[],\"lastnames\":[\"King\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Inferring Congruence Equations with SAT\",\"editor\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Gupta\"],\"suffixes\":[]},{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Malik\"],\"suffixes\":[]}],\"booktitle\":\"Computer Aided Verification\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5123\",\"pages\":\"281–293\",\"publisher\":\"Springer\",\"year\":\"2008\",\"doi\":\"10.1007/978-3-540-70545-1_26\",\"abstract\":\"This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, where a propositional formula is used to encode the semantics of a basic block, and abstraction, where the solutions to the formula are systematically combined and summarised as a system of congruence equations. The resulting technique is more precise than existing congruence analyses since a single optimal transfer function is derived for a basic block as a whole.\",\"keywords\":\"Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic\",\"bibtex\":\"@Inproceedings{Kin-Son_CAV08,\\n  author    = {Andy King and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Inferring Congruence Equations with {SAT}},\\n  editor    = {A. Gupta and S. Malik},\\n  booktitle = {Computer Aided Verification},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5123},\\n  pages     = {281--293},\\n  publisher = {Springer},\\n  year      = {2008},\\n  doi       = {10.1007/978-3-540-70545-1_26},\\n  abstract  = {This paper proposes a new approach for deriving invariants \\n\\t\\tthat are systems of congruence equations where the modulo\\n\\t\\tis a power of 2. The technique is an amalgam of SAT-solving,\\n\\t\\twhere a propositional formula is used to encode the semantics \\n\\t\\tof a basic block, and abstraction, where the solutions to the\\n\\t\\tformula are systematically combined and summarised as a system\\n\\t\\tof congruence equations. The resulting technique is more\\n\\t\\tprecise than existing congruence analyses since a single optimal\\n\\t\\ttransfer function is derived for a basic block as a whole.},\\n  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},\\n}\\n\\n\",\"author_short\":[\"King, A.\",\"Søndergaard, H.\"],\"editor_short\":[\"Gupta, A.\",\"Malik, S.\"],\"key\":\"Kin-Son_CAV08\",\"id\":\"Kin-Son_CAV08\",\"bibbaseid\":\"king-sndergaard-inferringcongruenceequationswithsat-2008\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Congruence analysis\",\"Abstract interpretation\",\"Abstract domains\",\"Boolean logic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Andy\"],\"propositions\":[],\"lastnames\":[\"King\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Automatic Abstraction for Congruences\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Barthe\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Hermenegildo\"],\"suffixes\":[]}],\"booktitle\":\"Verification, Model Checking and Abstract Interpretation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"5944\",\"pages\":\"197–213\",\"publisher\":\"Springer\",\"year\":\"2010\",\"doi\":\"10.1007/978-3-642-11319-2_16\",\"abstract\":\"One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation $ěc{c} · ěc{x} = d \\\\mod m$, $m$ is a power of two, $ěc{c}$ is a vector of integer coefficients, and $ěc{x}$ is a vector of propositional variables (bits). Because of the low-level nature of these invariants and the large number of bits that are involved, it is important that the transfer functions can be derived automatically. We address this problem, showing how an analysis for bit-level congruence relationships can be decoupled into two parts: (1) a SAT-based abstraction (compilation) step which can be automated, and (2) an interpretation step that requires no SAT-solving. We exploit triangular matrix forms to derive transfer functions efficiently, even in the presence of large numbers of bits. Finally we propose program transformations that improve the analysis results.\",\"keywords\":\"Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic\",\"bibtex\":\"@Inproceedings{Kin-Son_VMCAI10,\\n  author    = {Andy King and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Automatic Abstraction for Congruences},\\n  editor    = {G. Barthe and M. Hermenegildo},\\n  booktitle = {Verification, Model Checking and Abstract Interpretation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {5944},\\n  pages     = {197--213},\\n  publisher = {Springer},\\n  year      = {2010},\\n  doi       = {10.1007/978-3-642-11319-2_16},\\n  abstract  = {One approach to verifying bit-twiddling algorithms is to derive \\n\\t\\tinvariants between the bits that constitute the variables of a \\n\\t\\tprogram. Such invariants can often be described with systems\\n\\t\\tof congruences where in each equation \\n\\t\\t$\\\\vec{c} \\\\cdot \\\\vec{x} = d \\\\mod m$, $m$ is a power of two, \\n\\t\\t$\\\\vec{c}$ is a vector of integer coefficients, and $\\\\vec{x}$ is\\n\\t\\ta vector of propositional variables (bits). Because of the \\n\\t\\tlow-level nature of these invariants and the large number of\\n\\t\\tbits that are involved, it is important that the transfer \\n\\t\\tfunctions can be derived automatically. We address this problem,\\n\\t\\tshowing how an analysis for bit-level congruence relationships \\n\\t\\tcan be decoupled into two parts:\\n\\t\\t(1) a SAT-based abstraction (compilation) step which can be \\n\\t\\tautomated, and\\n\\t\\t(2) an interpretation step that requires no SAT-solving.\\n\\t\\tWe exploit triangular matrix forms to derive transfer functions\\n\\t\\tefficiently, even in the presence of large numbers of bits. \\n\\t\\tFinally we propose program transformations that improve the \\n\\t\\tanalysis results.},\\n  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},\\n}\\n\\n\",\"author_short\":[\"King, A.\",\"Søndergaard, H.\"],\"editor_short\":[\"Barthe, G.\",\"Hermenegildo, M.\"],\"key\":\"Kin-Son_VMCAI10\",\"id\":\"Kin-Son_VMCAI10\",\"bibbaseid\":\"king-sndergaard-automaticabstractionforcongruences-2010\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Congruence analysis\",\"Abstract interpretation\",\"Abstract domains\",\"Boolean logic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Yude\"],\"propositions\":[],\"lastnames\":[\"Lin\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Compositional Symbolic Execution: Incremental Solving Revisited\",\"editor\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Potanin\"],\"suffixes\":[]},{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Murphy\"],\"suffixes\":[]}],\"booktitle\":\"APSEC'16: Proceedings of the 23rd Asia-Pacific Software Engineering Conference\",\"pages\":\"273–280\",\"location\":\"Hamilton, New Zealand\",\"year\":\"2016\",\"doi\":\"10.1109/APSEC.2016.046\",\"abstract\":\"Symbolic execution can automatically explore different execution paths in a system under test and generate tests to precisely cover them. It has two main advantages—being automatic and thorough within a theory—and has many successful applications. The bottleneck of symbolic execution currently is the computation consumption for complex systems. Compositional Symbolic Execution (CSE) introduces a summarisation module to eliminate the redundancy in the exploration of repeatedly encountered code. In our previous work, we generalised the summarisation for any code fragments instead of functions. In this paper, we transplant this idea onto LLVM with many additional features, one of them being the use of incremental solving. We show that the combination of CSE and incremental solving is mutually beneficial. The obvious weakness of CSE is the lack of context during summarisation. We discuss the use of assumption-based features, available in modern constraint solvers, as a way to overcome this problem.\",\"keywords\":\"Symbolic execution, LLVM\",\"bibtex\":\"@inproceedings{Lin-Mil-Son_APSEC16,\\n  author    = {Yude Lin and \\n\\t\\tTim Miller and\\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Compositional Symbolic Execution: Incremental Solving Revisited},\\n  editor    = {A. Potanin and G. Murphy},\\n  booktitle = {APSEC'16: Proceedings of the 23rd Asia-Pacific Software \\n\\t\\tEngineering Conference},\\n  pages     = {273--280},\\n  location  = {Hamilton, New Zealand},\\n  year      = {2016},\\n  doi       = {10.1109/APSEC.2016.046},\\n  abstract  = {Symbolic execution can automatically explore different execution\\n  \\t\\tpaths in a system under test and generate tests to precisely \\n\\t\\tcover them. It has two main advantages---being automatic and \\n\\t\\tthorough within a theory---and has many successful applications.\\n\\t\\tThe bottleneck of symbolic execution currently is the \\n\\t\\tcomputation consumption for complex systems. Compositional \\n\\t\\tSymbolic Execution (CSE) introduces a summarisation module to \\n\\t\\teliminate the redundancy in the exploration of repeatedly \\n\\t\\tencountered code. In our previous work, we generalised the \\n\\t\\tsummarisation for any code fragments instead of functions. \\n\\t\\tIn this paper, we transplant this idea onto LLVM with many \\n\\t\\tadditional features, one of them being the use of incremental \\n\\t\\tsolving. We show that the combination of CSE and incremental \\n\\t\\tsolving is mutually beneficial. The obvious weakness of CSE is \\n\\t\\tthe lack of context during summarisation. We discuss the use\\n  \\t\\tof assumption-based features, available in modern constraint\\n  \\t\\tsolvers, as a way to overcome this problem.},\\n  keywords  = {Symbolic execution, LLVM},\\n}\\n\\n\",\"author_short\":[\"Lin, Y.\",\"Miller, T.\",\"Søndergaard, H.\"],\"editor_short\":[\"Potanin, A.\",\"Murphy, G.\"],\"key\":\"Lin-Mil-Son_APSEC16\",\"id\":\"Lin-Mil-Son_APSEC16\",\"bibbaseid\":\"lin-miller-sndergaard-compositionalsymbolicexecutionincrementalsolvingrevisited-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Symbolic execution\",\"LLVM\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Yude\"],\"propositions\":[],\"lastnames\":[\"Lin\"],\"suffixes\":[]},{\"firstnames\":[\"Tim\"],\"propositions\":[],\"lastnames\":[\"Miller\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Compositional Symbolic Execution Using Fine-Grained Summaries\",\"booktitle\":\"Proceedings of the 24th Australasian Software Engineering Conference (ASWEC 2015)\",\"pages\":\"213–222\",\"publisher\":\"IEEE Computing Society\",\"year\":\"2015\",\"doi\":\"10.1109/ASWEC.2015.32\",\"url_paper\":\"http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7365810\",\"abstract\":\"Compositional symbolic execution has been proposed as a way to increase the efficiency of symbolic execution. Essentially, when a function is symbolically executed, a \\\\emphsummary of the path that was executed is stored. This summary records the precondition and postcondition of the path, and on subsequent calls that satisfy that precondition, the corresponding postcondition can be returned instead of executing the function again. However, using functions as the unit of summarisation leaves the symbolic execution tool at the mercy of a program designer, essentially resulting in an arbitrary summarisation strategy. In this paper, we explore the use of \\\\emphfine-grained summaries, in which blocks \\\\emphwithin functions are summarised. We propose three types of summarisation and demonstrate how to generate these. At such a fine-grained level, symbolic execution of a path effectively becomes the concatenation of the summaries along that path. Using a prototype symbolic execution tool, we perform a preliminary experimental evaluation of our summary approaches, demonstrating that they can improve the speed of symbolic execution by reducing the number of calls sent to the underlying constraint solver.\",\"keywords\":\"Symbolic execution\",\"bibtex\":\"@inproceedings{Lin-Mil-Son_ASWEC15,\\n  author    = {Yude Lin and \\n\\t\\tTim Miller and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Compositional Symbolic Execution Using Fine-Grained Summaries},\\n  booktitle = {Proceedings of the 24th Australasian Software Engineering\\n                Conference (ASWEC 2015)},\\n  pages     = {213--222},\\n  publisher = {IEEE Computing Society},\\n  year      = {2015},\\n  doi       = {10.1109/ASWEC.2015.32},\\n  url_Paper = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7365810},\\n  abstract  = {Compositional symbolic execution has been proposed as a way to \\n\\t\\tincrease the efficiency of symbolic execution. Essentially, \\n\\t\\twhen a function is symbolically executed, a \\\\emph{summary} of \\n\\t\\tthe path that was executed is stored. This summary records the \\n\\t\\tprecondition and postcondition of the path, and on subsequent \\n\\t\\tcalls that satisfy that precondition, the corresponding \\n\\t\\tpostcondition can be returned instead of executing the function\\n\\t\\tagain. However, using functions as the unit of summarisation \\n\\t\\tleaves the symbolic execution tool at the mercy of a program \\n\\t\\tdesigner, essentially resulting in an arbitrary summarisation \\n\\t\\tstrategy. In this paper, we explore the use of \\n\\t\\t\\\\emph{fine-grained} summaries, in which blocks \\\\emph{within} \\n\\t\\tfunctions are summarised. We propose three types of \\n\\t\\tsummarisation and demonstrate how to generate these. At such a \\n\\t\\tfine-grained level, symbolic execution of a path effectively \\n\\t\\tbecomes the concatenation of the summaries along that path. \\n\\t\\tUsing a prototype symbolic execution tool, we perform a \\n\\t\\tpreliminary experimental evaluation of our summary approaches, \\n\\t\\tdemonstrating that they can improve the speed of symbolic \\n\\t\\texecution by reducing the number of calls sent to the \\n\\t\\tunderlying constraint solver.},\\n  keywords  = {Symbolic execution},\\n}\\n\\n\",\"author_short\":[\"Lin, Y.\",\"Miller, T.\",\"Søndergaard, H.\"],\"key\":\"Lin-Mil-Son_ASWEC15\",\"id\":\"Lin-Mil-Son_ASWEC15\",\"bibbaseid\":\"lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015\",\"role\":\"author\",\"urls\":{\" paper\":\"http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7365810\"},\"keyword\":[\"Symbolic execution\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Philip\"],\"propositions\":[],\"lastnames\":[\"Dart\"],\"suffixes\":[]}],\"title\":\"A Characterization of Non-floundering Logic Programs\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Debray\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Hermenegildo\"],\"suffixes\":[]}],\"booktitle\":\"Logic Programming: Proceedings of the 1990 North American Conference\",\"pages\":\"661–680\",\"publisher\":\"MIT Press\",\"year\":\"1990\",\"abstract\":\"SLDNF resolution provides an operational semantics which (unlike many Prolog implementations of negation) is both computationally tractable and sound with respect to a declarative semantics. However, SLDNF is not complete, and it achieves soundness only by discarding certain queries to programs because they ``flounder.'' We present dataflow analyses that for a given normal logic program detects (1) whether naive Prolog-style handling of negation is sound and (2) whether SLDNF resolution avoids floundering. The analyses are presented in a language-independent framework of abstract interpretation based on denotational definitions. To our knowledge they are more precise than any of their kind. In particular we obtain a characterization of a class of non-floundering programs larger than any other that we know of.\",\"keywords\":\"Floundering analysis, Logic programming, Prolog\",\"bibtex\":\"@Inproceedings{Mar-Son-Dar_NACLP90,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPhilip Dart},\\n  title\\t    = {A Characterization of Non-floundering Logic Programs},\\n  editor    = {S. Debray and M. Hermenegildo},\\n  booktitle = {Logic Programming: \\n\\t\\tProceedings of the 1990 North American Conference},\\n  pages\\t    = {661--680},\\n  publisher = {MIT Press}, \\n  year\\t    = {1990},\\n  abstract  = {SLDNF resolution provides an operational semantics which\\n\\t\\t(unlike many Prolog implementations of negation) is both \\n\\t\\tcomputationally tractable and sound with respect to a \\n\\t\\tdeclarative semantics. However, SLDNF is not complete, and \\n\\t\\tit achieves soundness only by discarding certain queries to \\n\\t\\tprograms because they ``flounder.''\\n\\t\\tWe present dataflow analyses that for a given normal logic \\n\\t\\tprogram detects (1) whether naive Prolog-style handling of \\n\\t\\tnegation is sound and (2) whether SLDNF resolution avoids \\n\\t\\tfloundering. The analyses are presented in a \\n\\t\\tlanguage-independent framework of abstract interpretation based\\n\\t\\ton denotational definitions. To our knowledge they are more \\n\\t\\tprecise than any of their kind. In particular we obtain a \\n\\t\\tcharacterization of a class of non-floundering programs larger\\n\\t\\tthan any other that we know of.},\\n  keywords  = {Floundering analysis, Logic programming, Prolog},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\",\"Dart, P.\"],\"editor_short\":[\"Debray, S.\",\"Hermenegildo, M.\"],\"key\":\"Mar-Son-Dar_NACLP90\",\"id\":\"Mar-Son-Dar_NACLP90\",\"bibbaseid\":\"marriott-sndergaard-dart-acharacterizationofnonflounderinglogicprograms-1990\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Floundering analysis\",\"Logic programming\",\"Prolog\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Neil\",\"D.\"],\"propositions\":[],\"lastnames\":[\"Jones\"],\"suffixes\":[]}],\"title\":\"Denotational Abstract Interpretation of Logic Programs\",\"journal\":\"ACM Transactions on Programming Languages and Systems\",\"volume\":\"16\",\"number\":\"3\",\"pages\":\"607–648\",\"year\":\"1994\",\"doi\":\"10.1145/177492.177650\",\"abstract\":\"Logic programming languages are based on a principle of separation of ``logic'' and ``control.'' This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism (or proof procedure, viewing execution as theorem proving). While the separation is desirable from a semantical point of view, it does, however, make sound, efficient implementation of logic programming languages difficult. The lack of ``control information'' in programs calls for complex dataflow analysis techniques to guide execution. Since dataflow analysis furthermore finds extensive use in error-finding and transformation tools, there is a need for a simple and powerful theory of dataflow analysis of logic programs. The present paper offers such a theory, based on F. Nielson's extension of P. and R. Cousot's abstract interpretation. We present a denotational definition of the semantics of definite logic programs. This definition is of interest in its own right because of its compactness. Stepwise we develop the definition into a generic dataflow analysis which encompasses a large class of dataflow analyses based on the SLD execution model. We exemplify one instance of the definition by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution. We also discuss implementation issues and related work.\",\"keywords\":\"Abstract interpretation, Abstract domains, Groundness analysis, Logic programming\",\"bibtex\":\"@Article{Mar-Son-Jon_TOPLAS94,\\n  author    = {Kim Marriott and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tNeil D. Jones},\\n  title     = {Denotational Abstract Interpretation of Logic Programs},\\n  journal   = {ACM Transactions on Programming Languages and Systems},\\n  volume    = {16},\\n  number    = {3},\\n  pages     = {607--648},\\n  year      = {1994},\\n  doi       = {10.1145/177492.177650},\\n  abstract  = {Logic programming languages are based on a principle of \\n\\t\\tseparation of ``logic'' and ``control.'' This means that they\\n\\t\\tcan be given simple model-theoretic semantics without regard to\\n\\t\\tany particular execution mechanism (or proof procedure, viewing\\n\\t\\texecution as theorem proving). While the separation is desirable\\n\\t\\tfrom a semantical point of view, it does, however, make sound, \\n\\t\\tefficient implementation of logic programming languages \\n\\t\\tdifficult. The lack of ``control information'' in programs \\n\\t\\tcalls for complex dataflow analysis techniques to guide \\n\\t\\texecution. Since dataflow analysis furthermore finds extensive \\n\\t\\tuse in error-finding and transformation tools, there is a need \\n\\t\\tfor a simple and powerful theory of dataflow analysis of logic \\n\\t\\tprograms. The present paper offers such a theory, based on \\n\\t\\tF. Nielson's extension of P. and R. Cousot's abstract \\n\\t\\tinterpretation. We present a denotational definition of the \\n\\t\\tsemantics of definite logic programs. This definition is of \\n\\t\\tinterest in its own right because of its compactness.\\n\\t\\tStepwise we develop the definition into a generic dataflow \\n\\t\\tanalysis which encompasses a large class of dataflow analyses\\n\\t\\tbased on the SLD execution model. We exemplify one instance of\\n\\t\\tthe definition by developing a provably correct groundness \\n\\t\\tanalysis to predict how variables may be bound to ground terms \\n\\t\\tduring execution. We also discuss implementation issues and \\n\\t\\trelated work.},\\n  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\",\"Jones, N. D.\"],\"key\":\"Mar-Son-Jon_TOPLAS94\",\"id\":\"Mar-Son-Jon_TOPLAS94\",\"bibbaseid\":\"marriott-sndergaard-jones-denotationalabstractinterpretationoflogicprograms-1994\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Groundness analysis\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]},{\"firstnames\":[\"Roland\"],\"propositions\":[],\"lastnames\":[\"Yap\"],\"suffixes\":[]}],\"title\":\"Optimizing Compilation for CLP(R)\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Gupta\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the 17th Australian Computer Science Conference\",\"series\":\"Australian Computer Science Communications\",\"volume\":\"16\",\"number\":\"1\",\"pages\":\"551–560\",\"year\":\"1994\",\"abstract\":\"Constraint Logic Programming (CLP) is a recent innovation in programming language design. CLP languages extend logic programming by allowing constraints from different domains such as real numbers or Boolean functions. This gives considerable expressive power and flexibility and CLP programs have proven to be a high-level programming paradigm for applications based on interactive mathematical modelling. These advantages, however, are not without cost. Implementations of CLP languages must include expensive constraint solving algorithms tailored to the specific domains. Indeed, performance of the current generation of CLP compilers and interpreters is one of the main obstacles to the widespread use of CLP. Here we outline the design of a highly optimizing compiler for CLP($\\\\Re$), a CLP language which extends Prolog by allowing linear arithmetic constraints. This compiler is intended to overcome the efficiency problems of the current implementation technology. The main innovation in the compiler is a comprehensive suite of program optimizations and associated global analyses which determine applicability of each optimization. We describe these optimizations and report very promising results from preliminary experiments.\",\"keywords\":\"Constraint programming, Logic programming, Compilation, Static analysis\",\"bibtex\":\"@Inproceedings{Mar-Son-Stu-Yap_ACSC94,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey and \\n\\t\\tRoland Yap},\\n  title\\t    = {Optimizing Compilation for {CLP(R)}},\\n  editor    = {G. Gupta},\\n  booktitle = {Proceedings of the 17th Australian Computer Science Conference},\\n  series    = {Australian Computer Science Communications},\\n  volume    = {16},\\n  number    = {1},\\n  pages     = {551--560},\\n  year\\t    = {1994},\\n  abstract  = {Constraint Logic Programming (CLP) is a recent innovation in\\n\\t\\tprogramming language design. CLP languages extend logic\\n\\t\\tprogramming by allowing constraints from different domains\\n\\t\\tsuch as real numbers or Boolean functions. This gives\\n\\t\\tconsiderable expressive power and flexibility and CLP\\n\\t\\tprograms have proven to be a high-level programming\\n\\t\\tparadigm for applications based on interactive mathematical\\n\\t\\tmodelling. These advantages, however, are not without cost.\\n\\t\\tImplementations of CLP languages must include expensive\\n\\t\\tconstraint solving algorithms tailored to the specific\\n\\t\\tdomains. Indeed, performance of the current generation of\\n\\t\\tCLP compilers and interpreters is one of the main obstacles\\n\\t\\tto the widespread use of CLP. Here we outline the design\\n\\t\\tof a highly optimizing compiler for CLP($\\\\Re$), a CLP\\n\\t\\tlanguage which extends Prolog by allowing linear arithmetic\\n\\t\\tconstraints. This compiler is intended to overcome the\\n\\t\\tefficiency problems of the current implementation\\n\\t\\ttechnology. The main innovation in the compiler is a\\n\\t\\tcomprehensive suite of program optimizations and associated\\n\\t\\tglobal analyses which determine applicability of each\\n\\t\\toptimization. We describe these optimizations and report\\n\\t\\tvery promising results from preliminary experiments.},\\n  keywords  = {Constraint programming, Logic programming, Compilation, Static analysis},\\n}\\n\\t\\t\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\",\"Stuckey, P. J.\",\"Yap, R.\"],\"editor_short\":[\"Gupta, G.\"],\"key\":\"Mar-Son-Stu-Yap_ACSC94\",\"id\":\"Mar-Son-Stu-Yap_ACSC94\",\"bibbaseid\":\"marriott-sndergaard-stuckey-yap-optimizingcompilationforclpr-1994\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Compilation\",\"Static analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Abstract Interpretation of Logic Programs: The Denotational Approach\",\"editor\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Bossi\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Fifth Italian Conference on Logic Programming\",\"pages\":\"399–425\",\"organization\":\"Gruppo Ricercatori ed Utenti di Logic Programming, Padova, Italy\",\"year\":\"1990\",\"note\":\"Invited paper\",\"abstract\":\"Logic programming languages are based on a principle of separation of ``logic'' and ``control.'' This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism. While this is desirable from a semantical point of view, it does make sound, efficient implementation of logic programming languages difficult. The lack of ``control information'' in programs calls for complex dataflow analyses to guide execution. Since dataflow analysis also finds extensive use in error-finding and transformation tools, there is a need for a simple and powerful theory of dataflow analysis of logic programs. We offer such a theory, inspired by F. Nielson's extension of P. and R. Cousot's \\\\emphabstract interpretation. We then present a denotational definition of the semantics of definite logic programs. This definition is of interest in its own right because of its novel application of \\\\emphparametric substitutions which makes it very compact and yet transparent. Stepwise we develop the definition into a generic dataflow analysis which encompasses a large class of dataflow analyses based on the SLD execution model. We exemplify one instance of the definition by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution. We also discuss related work and other applications.\",\"keywords\":\"Abstract interpretation, Abstract domains, Groundness analysis, Logic programming\",\"bibtex\":\"@Inproceedings{Mar-Son_GULP90,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Abstract Interpretation of Logic Programs:\\n\\t\\t\\tThe Denotational Approach},\\n  editor    = {A. Bossi},\\n  booktitle = {Proceedings of the Fifth Italian Conference on Logic Programming},\\n  pages     = {399--425},\\n  organization = {Gruppo Ricercatori ed Utenti di Logic Programming,\\n\\t\\t\\tPadova, Italy}, \\n  year\\t    = {1990},\\n  note\\t    = {Invited paper},\\n  abstract  = {Logic programming languages are based on a principle of \\n\\t\\tseparation of ``logic'' and ``control.'' This means that \\n\\t\\tthey can be given simple model-theoretic semantics\\n\\t\\twithout regard to any particular execution mechanism.\\n\\t\\tWhile this is desirable from a semantical point of view, \\n\\t\\tit does make sound, efficient implementation of logic \\n\\t\\tprogramming languages difficult. The lack of ``control \\n\\t\\tinformation'' in programs calls for complex dataflow\\n\\t\\tanalyses to guide execution. Since dataflow analysis also \\n\\t\\tfinds extensive use in error-finding and transformation \\n\\t\\ttools, there is a need for a simple and powerful theory\\n\\t\\tof dataflow analysis of logic programs.\\n\\t\\tWe offer such a theory, inspired by F. Nielson's extension\\n\\t\\tof P. and R. Cousot's \\\\emph{abstract interpretation}.\\n\\t\\tWe then present a denotational definition of the semantics \\n \\t\\tof definite logic programs. This definition is of interest \\n\\t\\tin its own right because of its novel application of \\n\\t\\t\\\\emph{parametric substitutions} which makes it very compact\\n\\t\\tand yet transparent. Stepwise we develop the definition \\n\\t\\tinto a generic dataflow analysis which encompasses a large \\n\\t\\tclass of dataflow analyses based on the SLD execution model.\\n\\t\\tWe exemplify one instance of the definition by developing a \\n\\t\\tprovably correct groundness analysis to predict how \\n\\t\\tvariables may be bound to ground terms during execution.\\n\\t\\tWe also discuss related work and other applications.},\\n  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Bossi, A.\"],\"key\":\"Mar-Son_GULP90\",\"id\":\"Mar-Son_GULP90\",\"bibbaseid\":\"marriott-sndergaard-abstractinterpretationoflogicprogramsthedenotationalapproach-1990\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Groundness analysis\",\"Logic programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Prolog Program Transformation by Introduction of Difference Lists\",\"booktitle\":\"Proceedings of the International Computer Science Conference '88\",\"pages\":\"206–213\",\"publisher\":\"IEEE Computer Society\",\"location\":\"Hong Kong\",\"year\":\"1988\",\"keywords\":\"Program transformation, Logic programming, Prolog\",\"bibtex\":\"@Inproceedings{Mar-Son_ICSC88,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Prolog Program Transformation by Introduction of \\n\\t\\tDifference Lists},\\n  booktitle = {Proceedings of the International Computer Science \\n\\t\\tConference '88},\\n  pages     = {206--213},\\n  publisher = {IEEE Computer Society},\\n  location  = {Hong Kong},\\n  year      = {1988},\\n  keywords  = {Program transformation, Logic programming, Prolog},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_ICSC88\",\"id\":\"Mar-Son_ICSC88\",\"bibbaseid\":\"marriott-sndergaard-prologprogramtransformationbyintroductionofdifferencelists-1988\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program transformation\",\"Logic programming\",\"Prolog\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Bottom-Up Abstract Interpretation of Logic Programs\",\"editor\":[{\"firstnames\":[\"R.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Kowalski\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Bowen\"],\"suffixes\":[]}],\"booktitle\":\"Logic Programming: Proceedings of the Fifth International Conference and Symposium\",\"pages\":\"733–748\",\"publisher\":\"MIT Press\",\"year\":\"1988\",\"abstract\":\"Abstract interpretation is useful in the design and verification of dataflow analyses. Given a programming language and a fixpoint characterization of its semantics, abstract interpretation enables the explicit formulation of the relation between a dataflow analysis and the semantics. A key notion in this is that of a ``collecting'' semantics—an extension of the semantics that attaches information about run-time behaviour to program points. Different collecting semantics lead to different types of dataflow analysis. We present a novel collecting semantics for normal logic programs. It is based on a Fitting-style bottom-up semantics and forms a firm semantic base for bottom-up dataflow analyses. One such analysis, using descriptions similar to Sato and Tamaki's depth k abstractions, is detailed and shown to be sound with respect to the collecting semantics. Its use in program specialization and termination analysis is demonstrated.\",\"keywords\":\"Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Program transformation, Semantics, Termination analysis\",\"bibtex\":\"@Inproceedings{Mar-Son_ICSLP88,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Bottom-Up Abstract Interpretation of Logic Programs},\\n  editor    = {R. A. Kowalski and K. A. Bowen},\\n  booktitle = {Logic Programming: Proceedings of the Fifth International \\n\\t\\tConference and Symposium},\\n  pages\\t    = {733--748},\\n  publisher = {MIT Press}, \\n  year\\t    = {1988},\\n  abstract  = {Abstract interpretation is useful in the design and \\n\\t\\tverification of dataflow analyses. Given a programming\\n\\t\\tlanguage and a fixpoint characterization of its semantics,\\n\\t\\tabstract interpretation enables the explicit formulation\\n\\t\\tof the relation between a dataflow analysis and the \\n\\t\\tsemantics. A key notion in this is that of a ``collecting''\\n\\t\\tsemantics---an extension of the semantics that attaches\\n\\t\\tinformation about run-time behaviour to program points.\\n\\t \\tDifferent collecting semantics lead to different types of\\n\\t\\tdataflow analysis. We present a novel collecting semantics \\n\\t\\tfor normal logic programs. It is based on a Fitting-style \\n\\t\\tbottom-up semantics and forms a firm semantic base for\\n\\t\\tbottom-up dataflow analyses. One such analysis, using\\n\\t\\tdescriptions similar to Sato and Tamaki's depth k\\n\\t\\tabstractions, is detailed and shown to be sound with \\n\\t\\trespect to the collecting semantics. Its use in program\\n\\t\\tspecialization and termination analysis is demonstrated.},\\n  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Program transformation, Semantics, Termination analysis},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Kowalski, R. A.\",\"Bowen, K. A.\"],\"key\":\"Mar-Son_ICSLP88\",\"id\":\"Mar-Son_ICSLP88\",\"bibbaseid\":\"marriott-sndergaard-bottomupabstractinterpretationoflogicprograms-1988\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\",\"Many-valued logic\",\"Depth k analysis\",\"Program transformation\",\"Semantics\",\"Termination analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Semantics-Based Dataflow Analysis of Logic Programs\",\"editor\":[{\"firstnames\":[\"G.\",\"X.\"],\"propositions\":[],\"lastnames\":[\"Ritter\"],\"suffixes\":[]}],\"booktitle\":\"Information Processing 89\",\"pages\":\"601–606\",\"publisher\":\"North-Holland\",\"year\":\"1989\",\"abstract\":\"The increased acceptance of Prolog has motivated widespread interest in the semantics-based dataflow analysis of logic programs and a number of different approaches have been suggested. However, the relationships between these approaches are not clear. The present paper provides a unifying introduction to the approaches by giving novel denotational semantic definitions which capture their essence. In addition, the wide range of analysis tools supported by semantics-based dataflow analysis are discussed.\",\"keywords\":\"Logic programming, Prolog, Static analysis, Semantics\",\"bibtex\":\"@Inproceedings{Mar-Son_IFIP89,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Semantics-Based Dataflow Analysis of Logic Programs},\\n  editor    = {G. X. Ritter},\\n  booktitle = {Information Processing 89},\\n  pages     = {601--606},\\n  publisher = {North-Holland},\\n  year      = {1989},\\n  abstract  = {The increased acceptance of Prolog has motivated widespread \\n\\t \\tinterest in the semantics-based dataflow analysis of logic \\n\\t\\tprograms and a number of different approaches have been \\n\\t\\tsuggested. However, the relationships between these \\n\\t\\tapproaches are not clear. The present paper provides a \\n\\t\\tunifying introduction to the approaches by giving novel \\n\\t\\tdenotational semantic definitions which capture their \\n\\t\\tessence. In addition, the wide range of analysis tools \\n\\t\\tsupported by semantics-based dataflow analysis are discussed.},\\n  keywords  = {Logic programming, Prolog, Static analysis, Semantics},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Ritter, G. X.\"],\"key\":\"Mar-Son_IFIP89\",\"id\":\"Mar-Son_IFIP89\",\"bibbaseid\":\"marriott-sndergaard-semanticsbaseddataflowanalysisoflogicprograms-1989\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Logic programming\",\"Prolog\",\"Static analysis\",\"Semantics\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"On Propagation-Based Analysis of Logic Programs\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Michaylov\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Winsborough\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the ILPS 93 Workshop on Global Compilation, Vancouver, Canada\",\"pages\":\"47–65\",\"year\":\"1993\",\"abstract\":\"Notions such as ``reexecution'' and ``propagation'' have recently attracted attention in dataflow analysis of logic programs. Both techniques promise more accurate dataflow analysis without requiring more complex description domains. Propagation, however, has never been given a formal definition. It has therefore been difficult to discuss properties such as correctness, precision, and termination of propagation. We suggest a definition of propagation. Comparing propagation-based analysis with the more conventional approach based on abstract interpretation, we find that propagation involves a certain inherent loss of precision when dataflow analyses are based on description domains which are not ``downwards closed'' (including mode analysis). In the archetypical downwards closed case, groundness analysis, we contrast approaches using Boolean functions as descriptions with those using propagation or reexecution.\",\"keywords\":\"Abstract interpretation, Boolean logic, Logic programming, Mode analysis, Groundness analysis\",\"bibtex\":\"@Inproceedings{Mar-Son_ILPSworkshop93,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {On Propagation-Based Analysis of Logic Programs},\\n  editor    = {S. Michaylov and W. Winsborough},\\n  booktitle = {Proceedings of the ILPS 93 Workshop on Global Compilation,\\n\\t\\t\\tVancouver, Canada},\\n  pages     = {47--65},\\n  year\\t    = {1993},\\n  abstract  = {Notions such as ``reexecution'' and ``propagation'' have recently\\n\\t\\tattracted attention in dataflow analysis of logic programs. \\n\\t\\tBoth techniques promise more accurate dataflow analysis without \\n\\t\\trequiring more complex description domains. Propagation, \\n\\t\\thowever, has never been given a formal definition. It has \\n\\t\\ttherefore been difficult to discuss properties such as \\n\\t\\tcorrectness, precision, and termination of propagation. \\n\\t\\tWe suggest a definition of propagation. Comparing \\n\\t\\tpropagation-based analysis with the more conventional\\n\\t\\tapproach based on abstract interpretation, we find that \\n\\t\\tpropagation involves a certain inherent loss of precision \\n\\t\\twhen dataflow analyses are based on description domains\\n\\t\\twhich are not ``downwards closed'' (including mode analysis).\\n\\t\\tIn the archetypical downwards closed case, groundness \\n\\t\\tanalysis, we contrast approaches using Boolean functions as\\n\\t\\tdescriptions with those using propagation or reexecution.},\\n  keywords  = {Abstract interpretation, Boolean logic, Logic programming, Mode analysis, Groundness analysis},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Michaylov, S.\",\"Winsborough, W.\"],\"key\":\"Mar-Son_ILPSworkshop93\",\"id\":\"Mar-Son_ILPSworkshop93\",\"bibbaseid\":\"marriott-sndergaard-onpropagationbasedanalysisoflogicprograms-1993\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Boolean logic\",\"Logic programming\",\"Mode analysis\",\"Groundness analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Bottom-Up Dataflow Analysis of Normal Logic Programs\",\"journal\":\"Journal of Logic Programming\",\"volume\":\"13\",\"number\":\"2 & 3\",\"pages\":\"181–204\",\"year\":\"1992\",\"doi\":\"10.1016/0743-1066(92)90031-W\",\"abstract\":\"A theory of semantics-based dataflow analysis using a notion of ``insertion'' is presented. This notion relaxes the Galois connections used in P. and R. Cousot's theory of abstract interpretation. The aim is to obtain a firm basis for the development of dataflow analyses of normal logic programs. A dataflow analysis is viewed as a non-standard semantics that approximates the standard semantics by manipulating descriptions of data objects rather than the objects themselves. A Kleene logic-based semantics for normal logic programs is defined, similar to Fitting's $Φ_P$ semantics. This provides the needed semantic base for ``bottom-up'' dataflow analyses. Such analyses give information about the success and failure sets of a program. A major application of bottom-up analysis is therefore type inference. We detail a dataflow analysis using descriptions similar to Sato and Tamaki's depth $k$ abstractions and another using Marriott, Naish and Lassez's ``singleton'' abstractions. We show that both are sound with respect to our semantics and outline various uses of the analyses. Finally we justify our choice of semantics by showing that it is the most abstract of a number of possible semantics. This means that every analysis based on our semantics is correct with respect to these other semantics, including Kunen's semantics, SLDNF resolution, and the common (sound) Prolog semantics.\",\"keywords\":\"Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Semantics\",\"bibtex\":\"@Article{Mar-Son_JLP92,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Bottom-Up Dataflow Analysis of Normal Logic Programs},\\n  journal   = {Journal of Logic Programming},\\n  volume    = {13},\\n  number    = {2 \\\\& 3},\\n  pages\\t    = {181--204}, \\n  year\\t    = {1992},\\n  doi       = {10.1016/0743-1066(92)90031-W},\\n  abstract  = {A theory of semantics-based dataflow analysis using a notion of\\n\\t\\t``insertion'' is presented. This notion relaxes the Galois \\n\\t\\tconnections used in P. and R. Cousot's theory of abstract \\n\\t\\tinterpretation. The aim is to obtain a firm basis for the \\n\\t\\tdevelopment of dataflow analyses of normal logic programs.\\n\\t\\tA dataflow analysis is viewed as a non-standard semantics that\\n\\t\\tapproximates the standard semantics by manipulating descriptions\\n\\t\\tof data objects rather than the objects themselves. A Kleene \\n\\t\\tlogic-based semantics for normal logic programs is defined, \\n\\t\\tsimilar to Fitting's $\\\\Phi_P$ semantics. This provides the \\n\\t\\tneeded semantic base for ``bottom-up'' dataflow analyses. \\n\\t\\tSuch analyses give information about the success and failure \\n\\t\\tsets of a program. A major application of bottom-up analysis \\n\\t\\tis therefore type inference. We detail a dataflow analysis \\n\\t\\tusing descriptions similar to Sato and Tamaki's depth $k$ \\n\\t\\tabstractions and another using Marriott, Naish and Lassez's\\n\\t\\t``singleton'' abstractions. We show that both are sound with \\n\\t\\trespect to our semantics and outline various uses of the \\n\\t\\tanalyses. Finally we justify our choice of semantics by showing\\n\\t\\tthat it is the most abstract of a number of possible semantics.\\n\\t\\tThis means that every analysis based on our semantics is \\n\\t\\tcorrect with respect to these other semantics, including \\n\\t\\tKunen's semantics, SLDNF resolution, and the common (sound) \\n\\t\\tProlog semantics.},\\n  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Semantics},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_JLP92\",\"id\":\"Mar-Son_JLP92\",\"bibbaseid\":\"marriott-sndergaard-bottomupdataflowanalysisofnormallogicprograms-1992\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\",\"Many-valued logic\",\"Depth k analysis\",\"Semantics\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Precise and Efficient Groundness Analysis for Logic Programs\",\"journal\":\"ACM Letters on Programming Languages and Systems\",\"volume\":\"2\",\"number\":\"1–4\",\"pages\":\"181–196\",\"year\":\"1993\",\"doi\":\"10.1145/176454.176519\",\"abstract\":\"We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as ``approximations'' to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the \\\\emphpositive functions, is more suitable than others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call ``condensation.'' This property allows for rapid computation of groundness information.\",\"keywords\":\"Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis\",\"bibtex\":\"@Article{Mar-Son_LOPLAS93,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Precise and Efficient Groundness Analysis for Logic Programs},\\n  journal   = {ACM Letters on Programming Languages and Systems},\\n  volume    = {2},\\n  number    = {1--4},\\n  pages\\t    = {181--196},\\n  year\\t    = {1993},\\n  doi       = {10.1145/176454.176519},\\n  abstract  = {We show how precise groundness information can be extracted from\\n\\t\\tlogic programs. The idea is to use abstract interpretation with\\n\\t\\tBoolean functions as ``approximations'' to groundness \\n\\t\\tdependencies between variables. This idea is not new, and \\n\\t\\tdifferent classes of Boolean functions have been used. We argue,\\n\\t\\thowever, that one class, the \\\\emph{positive} functions, is more \\n\\t\\tsuitable than others. Positive Boolean functions have a certain\\n\\t\\tproperty which we (inspired by A. Langen) call ``condensation.''\\n\\t\\tThis property allows for rapid computation of groundness \\n\\t\\tinformation.},\\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_LOPLAS93\",\"id\":\"Mar-Son_LOPLAS93\",\"bibbaseid\":\"marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Logic programming\",\"Boolean logic\",\"Groundness analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Analysis of Constraint Logic Programs\",\"editor\":[{\"firstnames\":[\"S.\"],\"propositions\":[],\"lastnames\":[\"Debray\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Hermenegildo\"],\"suffixes\":[]}],\"booktitle\":\"Logic Programming: Proceedings of the 1990 North American Conference\",\"pages\":\"531–547\",\"publisher\":\"MIT Press\",\"year\":\"1990\",\"abstract\":\"Increasingly, compilers for logic programs are making use of information from dataflow analyses to aid in the generation of efficient target code. However, generating efficient target code from constraint logic programs is even more difficult than from logic programs. Thus we feel that good compilation of constraint logic programs will require sophisticated analysis of the source code. Here we present a simple framework for the abstract interpretation of constraint logic programs which is intended to serve as the basis for developing such analyses. We show the framework's practical usefulness by sketching two dataflow analyses that are based on it and indicating how they can be used to improve the code generated by a compiler.\",\"keywords\":\"Constraint programming, Logic programming, Abstract interpretation, Semantics, Compilation\",\"bibtex\":\"@Inproceedings{Mar-Son_NACLP90,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Analysis of Constraint Logic Programs},\\n  editor    = {S. Debray and M. Hermenegildo},\\n  booktitle = {Logic Programming: \\n\\t\\tProceedings of the 1990 North American Conference},\\n  pages\\t    = {531--547},\\n  publisher = {MIT Press}, \\n  year\\t    = {1990},\\n  abstract  = {Increasingly, compilers for logic programs are making use \\n\\t\\tof information from dataflow analyses to aid in the generation\\n\\t\\tof efficient target code. However, generating efficient target\\n\\t\\tcode from constraint logic programs is even more difficult than\\n\\t\\tfrom logic programs. Thus we feel that good compilation of\\n\\t\\tconstraint logic programs will require sophisticated analysis \\n\\t\\tof the source code. Here we present a simple framework for\\n\\t\\tthe abstract interpretation of constraint logic programs\\n\\t\\twhich is intended to serve as the basis for developing such \\n\\t\\tanalyses. We show the framework's practical usefulness by \\n\\t\\tsketching two dataflow analyses that are based on it\\n\\t\\tand indicating how they can be used to improve the code \\n\\t\\tgenerated by a compiler.},\\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Semantics, Compilation},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"editor_short\":[\"Debray, S.\",\"Hermenegildo, M.\"],\"key\":\"Mar-Son_NACLP90\",\"id\":\"Mar-Son_NACLP90\",\"bibbaseid\":\"marriott-sndergaard-analysisofconstraintlogicprograms-1990\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Constraint programming\",\"Logic programming\",\"Abstract interpretation\",\"Semantics\",\"Compilation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Difference-List Transformation for Prolog\",\"journal\":\"New Generation Computing\",\"volume\":\"11\",\"number\":\"2\",\"pages\":\"125–157\",\"year\":\"1993\",\"doi\":\"10.1007/BF03037156\",\"abstract\":\"Difference-lists are terms that represent lists. The use of difference-lists can speed up most list-processing programs considerably. Prolog programmers routinely use ``difference-list versions'' of programs, but very little investigation has taken place into difference-list transformation. Thus, to most programmers it is either unknown that the use of difference-lists is far from safe in all contexts, or else this fact is known but attributed to Prolog's infamous ``occur check problem.'' In this paper we study the transformation of list-processing programs into programs that use difference-lists. In particular we are concerned with finding circumstances under which the transformation is safe. We show that dataflow analysis can be used to determine whether the transformation is applicable to a given program, thereby allowing for automatic transformation. We prove that our transformation preserves strong operational equivalence.\",\"keywords\":\"Program transformation, Static analysis, Logic programming, Prolog\",\"bibtex\":\"@Article{Mar-Son_NGC93,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {Difference-List Transformation for {Prolog}},\\n  journal   = {New Generation Computing},\\n  volume    = {11},\\n  number    = {2},\\n  pages     = {125--157}, \\n  year\\t    = {1993},\\n  doi       = {10.1007/BF03037156},\\n  abstract  = {Difference-lists are terms that represent lists.\\n\\t\\tThe use of difference-lists can speed up most list-processing \\n\\t\\tprograms considerably. Prolog programmers routinely use \\n\\t\\t``difference-list versions'' of programs, but very little \\n\\t\\tinvestigation has taken place into difference-list \\n\\t\\ttransformation. Thus, to most programmers it is either \\n\\t\\tunknown that the use of difference-lists is far from safe in \\n\\t\\tall contexts, or else this fact is known but attributed to \\n\\t\\tProlog's infamous ``occur check problem.'' In this paper we \\n\\t\\tstudy the transformation of list-processing programs into \\n\\t\\tprograms that use difference-lists. In particular we are \\n\\t\\tconcerned with finding circumstances under which the \\n\\t\\ttransformation is safe. We show that dataflow analysis can \\n\\t\\tbe used to determine whether the transformation is applicable \\n\\t\\tto a given program, thereby allowing for automatic \\n\\t\\ttransformation. We prove that our transformation preserves \\n\\t\\tstrong operational equivalence.},\\n  keywords  = {Program transformation, Static analysis, Logic programming, Prolog},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_NGC93\",\"id\":\"Mar-Son_NGC93\",\"bibbaseid\":\"marriott-sndergaard-differencelisttransformationforprolog-1993\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Program transformation\",\"Static analysis\",\"Logic programming\",\"Prolog\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"On Prolog and the Occur Check Problem\",\"journal\":\"SIGPLAN Notices\",\"volume\":\"24\",\"number\":\"5\",\"pages\":\"76–82\",\"year\":\"1989\",\"doi\":\"10.1145/66068.66075\",\"abstract\":\"It is well known that omission of the occur check in unification leads to unsound Prolog systems. Nevertheless, most Prolog systems omit the occur check because this makes unification much faster and unsoundness allegedly seldom manifests itself. We revisit the occur check problem and point to two aspects that have previously received no attention. Firstly, ``unification without the occur check'' is ambiguous, and in practice, Prolog systems vary markedly in their reaction to programs having occur check problems. Secondly, even very simple program transformations are unsafe for pure Prolog when the occur check is omitted. We conclude that the occur check problem is important, and in particular, that the current effort to standardize Prolog should address it.\",\"keywords\":\"Logic programming, Prolog, Unification\",\"bibtex\":\"@Article{Mar-Son_occur89,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {On {Prolog} and the Occur Check Problem},\\n  journal   = {SIGPLAN Notices},\\n  volume    = {24},\\n  number    = {5},\\n  pages     = {76--82},\\n  year      = {1989},\\n  doi       = {10.1145/66068.66075},\\n  abstract  = {It is well known that omission of the occur check in \\n\\t\\tunification leads to unsound Prolog systems. Nevertheless,\\n\\t \\tmost Prolog systems omit the occur check because this\\n\\t\\tmakes unification much faster and unsoundness allegedly\\n\\t\\tseldom manifests itself. We revisit the occur check\\n\\t\\tproblem and point to two aspects that have previously \\n\\t\\treceived no attention. Firstly, ``unification without the\\n\\t\\toccur check'' is ambiguous, and in practice, Prolog systems\\n\\t\\tvary markedly in their reaction to programs having occur\\n\\t\\tcheck problems. Secondly, even very simple program\\n\\t\\ttransformations are unsafe for pure Prolog when the occur\\n\\t\\tcheck is omitted. We conclude that the occur check problem\\n\\t\\tis important, and in particular, that the current effort to\\n\\t\\tstandardize Prolog should address it.},\\n  keywords  = {Logic programming, Prolog, Unification},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_occur89\",\"id\":\"Mar-Son_occur89\",\"bibbaseid\":\"marriott-sndergaard-onprologandtheoccurcheckproblem-1989\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Logic programming\",\"Prolog\",\"Unification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"techreport\",\"type\":\"techreport\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"On Describing Success Patterns of Logic Programs\",\"number\":\"88/12\",\"institution\":\"Department of Computer Science, The University of Melbourne\",\"year\":\"1988\",\"abstract\":\"Sato and Tamaki's depth $k$ abstractions are reviewed, and their use as (finite) descriptions of (infinite) sets of expressions (terms and atomic formulas) is discussed. This leads to an investigation of other classes of expressions. A certain property of a class is identified as being sufficient for the existence of a Galois insertion from the class to the set of all expressions, and thus for abstract interpretation to be applicable. Sato and Tamaki's class does not have the property, but it is shown how it can be extended to a class having the property while still remaining finite.\",\"keywords\":\"Abstract interpretation, Abstract domains, Depth k analysis\",\"bibtex\":\"@Techreport{Mar-Son_success_patterns88,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {On Describing Success Patterns of Logic Programs},\\n  number    = {88/12},\\n  institution = {Department of Computer Science, The University of Melbourne},\\n  year      = {1988},\\n  abstract  = {Sato and Tamaki's depth $k$ abstractions are reviewed, and their\\n\\t\\tuse as (finite) descriptions of (infinite) sets of expressions\\n\\t\\t(terms and atomic formulas) is discussed. This leads to an\\n\\t\\tinvestigation of other classes of expressions. A certain\\n\\t\\tproperty of a class is identified as being sufficient for the\\n\\t\\texistence of a Galois insertion from the class to the set of\\n\\t\\tall expressions, and thus for abstract interpretation to be\\n\\t\\tapplicable. Sato and Tamaki's class does not have the property,\\n\\t\\tbut it is shown how it can be extended to a class having the\\n\\t\\tproperty while still remaining finite.},\\n  keywords  = {Abstract interpretation, Abstract domains, Depth k analysis},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_success_patterns88\",\"id\":\"Mar-Son_success_patterns88\",\"bibbaseid\":\"marriott-sndergaard-ondescribingsuccesspatternsoflogicprograms-1988\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Depth k analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"unpublished\",\"type\":\"unpublished\",\"author\":[{\"firstnames\":[\"Kim\"],\"propositions\":[],\"lastnames\":[\"Marriott\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Notes for a Tutorial on Abstract Interpretation of Logic Programs\",\"year\":\"1989\",\"note\":\"Tutorial Notes for the 1989 North American Conference on Logic Programming. Assocation for Logic Programming, 1989\",\"keywords\":\"Abstract interpretation, Abstract domains, Logic programming, Unification, Semantics, Groundness analysis\",\"bibtex\":\"@Unpublished{Mar-Son_tutorial89,\\n  author    = {Kim Marriott and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Notes for a Tutorial on Abstract Interpretation of Logic \\n\\t\\tPrograms},\\n  year      = {1989},\\n  note      = {Tutorial Notes for the 1989 North American Conference on \\n\\t\\tLogic Programming. Assocation for Logic Programming, 1989},\\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Unification, Semantics, Groundness analysis},\\n}\\n\\n\",\"author_short\":[\"Marriott, K.\",\"Søndergaard, H.\"],\"key\":\"Mar-Son_tutorial89\",\"id\":\"Mar-Son_tutorial89\",\"bibbaseid\":\"marriott-sndergaard-notesforatutorialonabstractinterpretationoflogicprograms-1989\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Logic programming\",\"Unification\",\"Semantics\",\"Groundness analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Antonette\"],\"propositions\":[],\"lastnames\":[\"Mendoza\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Anne\"],\"propositions\":[],\"lastnames\":[\"Venables\"],\"suffixes\":[]}],\"title\":\"Making Sense of Learning Management System's Quiz Analytics in Understanding Students' Learning Difficulties\",\"booktitle\":\"Proceedings of the 28th Annual Conference of the Australasian Association for Engineering Education (AAEE2017)\",\"pages\":\"112–119\",\"location\":\"Manly, New South Wales\",\"publisher\":\"Australasian Association for Engineering Education\",\"year\":\"2017\",\"keywords\":\"Education\",\"bibtex\":\"@Inproceedings{Men-Son-Ven_AAEE17,\\n  author    = {Antonette Mendoza and\\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tAnne Venables},\\n  title     = {Making Sense of Learning Management System's Quiz Analytics\\n        \\tin Understanding Students' Learning Difficulties},\\n  booktitle = {Proceedings of the 28th Annual Conference of the\\n        \\tAustralasian Association for Engineering Education (AAEE2017)},\\n  pages     = {112--119},\\n  location  = {Manly, New South Wales},\\n  publisher = {Australasian Association for Engineering Education},\\n  year      = {2017},\\n  keywords  = {Education},\\n}\\n\\n\",\"author_short\":[\"Mendoza, A.\",\"Søndergaard, H.\",\"Venables, A.\"],\"key\":\"Men-Son-Ven_AAEE17\",\"id\":\"Men-Son-Ven_AAEE17\",\"bibbaseid\":\"mendoza-sndergaard-venables-makingsenseoflearningmanagementsystemsquizanalyticsinunderstandingstudentslearningdifficulties-2017\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Alistair\"],\"propositions\":[],\"lastnames\":[\"Moffat\"],\"suffixes\":[]},{\"firstnames\":[\"Baden\"],\"propositions\":[],\"lastnames\":[\"Hughes\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Paul\"],\"propositions\":[],\"lastnames\":[\"Gruba\"],\"suffixes\":[]}],\"title\":\"Making Connections: First Year Transition for Computer Science and Software Engineering Students\",\"editor\":[{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Young\"],\"suffixes\":[]},{\"firstnames\":[\"D.\"],\"propositions\":[],\"lastnames\":[\"Tolhurst\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Seventh Australasian Computing Education Conference (ACE2005)\",\"series\":\"Conferences in Research and Practice in Information Technology\",\"volume\":\"42\",\"pages\":\"229–238\",\"year\":\"2005\",\"abstract\":\"During the last decade, an increasing emphasis has been placed on the need for carefully planned transition programs to help first-year students integrate into university. In this paper we critically examine our experiences in designing and running successive transition programs for Computer Science and Software Engineering students. Over the last three years we have trialled several models. At present, our program requires all entering students to be enrolled in a transition subject, ``Making Connections'', which runs for half a semester. The subject, led by designated academic staff, serves as a forum for students to learn about each other, the department and the university. The program includes a computer-based language and study skills assessment component, including self-assessment tasks. Students can extend the subject by taking academic skills workshops run by the university's student support services. We have found compulsion to be a useful facilitator of student engagement, and the addition of an objective assessment task has been beneficial.\",\"keywords\":\"Education, Student transition programs\",\"bibtex\":\"@InProceedings{Mof-Hug-Son-Gru_ACE05,\\n  author    = {Alistair Moffat and \\n\\t\\tBaden Hughes and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPaul Gruba},\\n  title     = {Making Connections: First Year Transition for Computer\\n\\t\\tScience and Software Engineering Students},\\n  editor    = {A. Young and D. Tolhurst},\\n  booktitle = {Proceedings of the Seventh Australasian Computing Education \\n\\t\\tConference (ACE2005)},\\n  series    = {Conferences in Research and Practice in Information Technology},\\n  volume    = {42},\\n  pages     = {229--238},\\n  year      = {2005},\\n  abstract  = {During the last decade, an increasing emphasis has been placed \\n\\t\\ton the need for carefully planned transition programs to help \\n\\t\\tfirst-year students integrate into university. In this paper \\n\\t\\twe critically examine our experiences in designing and running\\n\\t\\tsuccessive transition programs for Computer Science and \\n\\t\\tSoftware Engineering students. Over the last three years we \\n\\t\\thave trialled several models. At present, our program requires \\n\\t\\tall entering students to be enrolled in a transition subject,\\n\\t\\t``Making Connections'', which runs for half a semester. The\\n\\t\\tsubject, led by designated academic staff, serves as a forum \\n\\t\\tfor students to learn about each other, the department and the \\n\\t\\tuniversity. The program includes a computer-based language and\\n\\t\\tstudy skills assessment component, including self-assessment \\n\\t\\ttasks. Students can extend the subject by taking academic \\n\\t\\tskills workshops run by the university's student support \\n\\t\\tservices. We have found compulsion to be a useful facilitator \\n\\t\\tof student engagement, and the addition of an objective \\n\\t\\tassessment task has been beneficial.},\\n  keywords  = {Education, Student transition programs},\\n}\\n\\n\",\"author_short\":[\"Moffat, A.\",\"Hughes, B.\",\"Søndergaard, H.\",\"Gruba, P.\"],\"editor_short\":[\"Young, A.\",\"Tolhurst, D.\"],\"key\":\"Mof-Hug-Son-Gru_ACE05\",\"id\":\"Mof-Hug-Son-Gru_ACE05\",\"bibbaseid\":\"moffat-hughes-sndergaard-gruba-makingconnectionsfirstyeartransitionforcomputerscienceandsoftwareengineeringstudents-2005\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Student transition programs\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Lee\"],\"propositions\":[],\"lastnames\":[\"Naish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Benjamin\"],\"propositions\":[],\"lastnames\":[\"Horsfall\"],\"suffixes\":[]}],\"title\":\"Logic Programming: From Underspecification to Undefinedness\",\"editor\":[{\"firstnames\":[\"J.\"],\"propositions\":[],\"lastnames\":[\"Mestre\"],\"suffixes\":[]}],\"booktitle\":\"Theory of Computing 2012\",\"series\":\"Conferences in Research and Practice in Information Technology\",\"volume\":\"128\",\"pages\":\"49–58\",\"year\":\"2012\",\"url\":\"http://crpit.com/Vol128.html\",\"abstract\":\"The semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood, but also for \\\"undefined\\\". The three-valued semantics proposed by Fitting and by Kunen are closely related to what is computed by a logic program, the third truth value being associated with non-termination. A different three-valued semantics, proposed by Naish, shared much with those of Fitting and Kunen but incorporated allowances for programmer intent, the third truth value being associated with underspecification. Naish used an (apparently) novel ``arrow'' operator to relate the intended meaning of left and right sides of predicate definitions. In this paper we suggest that the additional truth values of Fitting/Kunen and Naish are best viewed as duals. We use Fitting's later four-valued approach to unify the two three-valued approaches. The additional truth value has very little affect on the Fitting three-valued semantics, though it can be useful when finding approximations to this semantics for program analysis. For the Naish semantics, the extra truth value allows intended interpretations to be more expressive, allowing us to verify and debug a larger class of programs. We also explain that the \\\"arrow\\\" operator of Naish (and our four-valued extension) is essentially the information ordering. This sheds new light on the relationships between specifications and programs, and successive executions states of a program.\",\"keywords\":\"Logic programming, Semantics, Many-valued logic\",\"bibtex\":\"@InProceedings{Nai-Son-Hor_CATS12,\\n  author    = {Lee Naish and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tBenjamin Horsfall},\\n  title     = {Logic Programming: From Underspecification to Undefinedness},\\n  editor    = {J. Mestre},\\n  booktitle = {Theory of Computing 2012},\\n  series    = {Conferences in Research and Practice in Information Technology},\\n  volume    = {128},\\n  pages     = {49--58},\\n  year      = {2012},\\n  url       = {http://crpit.com/Vol128.html},\\n  abstract  = {The semantics of logic programs was originally described in \\n\\t\\tterms of two-valued logic. Soon, however, it was realised that \\n\\t\\tthree-valued logic had some natural advantages, as it provides \\n\\t\\tdistinct values not only for truth and falsehood, but also for\\n\\t\\t\\\"undefined\\\". The three-valued semantics proposed by Fitting and\\n\\t\\tby Kunen are closely related to what is computed by a logic \\n\\t\\tprogram, the third truth value being associated with \\n\\t\\tnon-termination. A different three-valued semantics, proposed \\n\\t\\tby Naish, shared much with those of Fitting and Kunen but \\n\\t\\tincorporated allowances for programmer intent, the third truth \\n\\t\\tvalue being associated with underspecification. Naish used an \\n\\t\\t(apparently) novel ``arrow'' operator to relate the intended \\n\\t\\tmeaning of left and right sides of predicate definitions. In \\n\\t\\tthis paper we suggest that the additional truth values of\\n\\t\\tFitting/Kunen and Naish are best viewed as duals. We use \\n\\t\\tFitting's later four-valued approach to unify the two \\n\\t\\tthree-valued approaches. The additional truth value has very \\n\\t\\tlittle affect on the Fitting three-valued semantics, though it\\n\\t\\tcan be useful when finding approximations to this semantics for\\n\\t\\tprogram analysis. For the Naish semantics, the extra truth \\n\\t\\tvalue allows intended interpretations to be more expressive, \\n\\t\\tallowing us to verify and debug a larger class of programs. \\n\\t\\tWe also explain that the \\\"arrow\\\" operator of Naish (and our \\n\\t\\tfour-valued extension) is essentially the information ordering.\\n\\t\\tThis sheds new light on the relationships between \\n\\t\\tspecifications and programs, and successive executions states \\n\\t\\tof a program.},\\n  keywords  = {Logic programming, Semantics, Many-valued logic},\\n}\\n\\n\",\"author_short\":[\"Naish, L.\",\"Søndergaard, H.\",\"Horsfall, B.\"],\"editor_short\":[\"Mestre, J.\"],\"key\":\"Nai-Son-Hor_CATS12\",\"id\":\"Nai-Son-Hor_CATS12\",\"bibbaseid\":\"naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012\",\"role\":\"author\",\"urls\":{\"Paper\":\"http://crpit.com/Vol128.html\"},\"keyword\":[\"Logic programming\",\"Semantics\",\"Many-valued logic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Lee\"],\"propositions\":[],\"lastnames\":[\"Naish\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Truth versus Information in Logic Programming\",\"journal\":\"Theory and Practice of Logic Programming\",\"volume\":\"14\",\"number\":\"6\",\"pages\":\"803–840\",\"month\":\"november\",\"year\":\"2014\",\"url_paper\":\"http://journals.cambridge.org/repo_A89XyMV9\",\"doi\":\"10.1017/S1471068413000069\",\"abstract\":\"The semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood, but also for ``undefined''. The three-valued semantics proposed by Fitting and by Kunen are closely related to what is computed by a logic program, the third truth value being associated with non-termination. A different three-valued semantics, proposed by Naish, shared much with those of Fitting and Kunen but incorporated allowances for programmer intent, the third truth value being associated with underspecification. Naish used an (apparently) novel ``arrow'' operator to relate the intended meaning of left and right sides of predicate definitions. In this paper we suggest that the additional truth values of Fitting/Kunen and Naish are best viewed as duals. We use Belnap's four-valued logic, also used elsewhere by Fitting, to unify the two three-valued approaches. The truth values are arranged in a bilattice which supports the classical ordering on truth values as well as the ``information ordering''. We note that the ``arrow'' operator of Naish (and our four-valued extension) is essentially the information ordering, whereas the classical arrow denotes the truth ordering. This allows us to shed new light on many aspects of logic programming, including program analysis, type and mode systems, declarative debugging and the relationships between specifications and programs, and successive executions states of a program.\",\"keywords\":\"Logic programming, Semantics, Many-valued logic\",\"bibtex\":\"@article{Nai-Son_TPLP14,\\n  author    = {Lee Naish and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Truth versus Information in Logic Programming},\\n  journal   = {Theory and Practice of Logic Programming},\\n  volume    = {14},\\n  number    = {6},\\n  pages     = {803--840},\\n  month     = {november},\\n  year      = {2014},\\n  url_Paper = {http://journals.cambridge.org/repo_A89XyMV9},\\n  doi       = {10.1017/S1471068413000069},\\n  abstract  = {The semantics of logic programs was originally described in \\n\\t\\tterms of two-valued logic. Soon, however, it was realised that\\n\\t\\tthree-valued logic had some natural advantages, as it provides \\n\\t\\tdistinct values not only for truth and falsehood, but also for \\n\\t\\t``undefined''. The three-valued semantics proposed by Fitting \\n\\t\\tand by Kunen are closely related to what is computed by a \\n\\t\\tlogic program, the third truth value being associated with \\n\\t\\tnon-termination. A different three-valued semantics, proposed \\n\\t\\tby Naish, shared much with those of Fitting and Kunen but \\n\\t\\tincorporated allowances for programmer intent, the third truth \\n\\t\\tvalue being associated with underspecification. Naish used an \\n\\t\\t(apparently) novel ``arrow'' operator to relate the intended\\n\\t\\tmeaning of left and right sides of predicate definitions. In \\n\\t\\tthis paper we suggest that the additional truth values of \\n\\t\\tFitting/Kunen and Naish are best viewed as duals. We use \\n\\t\\tBelnap's four-valued logic, also used elsewhere by Fitting, \\n\\t\\tto unify the two three-valued approaches. The truth values are \\n\\t\\tarranged in a bilattice which supports the classical ordering \\n\\t\\ton truth values as well as the ``information ordering''. We \\n\\t\\tnote that the ``arrow'' operator of Naish (and our four-valued\\n\\t\\textension) is essentially the information ordering, whereas the\\n\\t\\tclassical arrow denotes the truth ordering. This allows us to \\n\\t\\tshed new light on many aspects of logic programming, including \\n\\t\\tprogram analysis, type and mode systems, declarative debugging \\n\\t\\tand the relationships between specifications and programs, and \\n\\t\\tsuccessive executions states of a program.},\\n  keywords  = {Logic programming, Semantics, Many-valued logic},\\n}\\n\\n\",\"author_short\":[\"Naish, L.\",\"Søndergaard, H.\"],\"key\":\"Nai-Son_TPLP14\",\"id\":\"Nai-Son_TPLP14\",\"bibbaseid\":\"naish-sndergaard-truthversusinformationinlogicprogramming-2014\",\"role\":\"author\",\"urls\":{\" paper\":\"http://journals.cambridge.org/repo_A89XyMV9\"},\"keyword\":[\"Logic programming\",\"Semantics\",\"Many-valued logic\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Jorge\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Navas\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code\",\"editor\":[{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Jhala\"],\"suffixes\":[]},{\"firstnames\":[\"A.\"],\"propositions\":[],\"lastnames\":[\"Igarashi\"],\"suffixes\":[]}],\"booktitle\":\"APLAS 2012: Proceedings of the 10th Asian Symposium on Programming Languages and Systems\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"7705\",\"pages\":\"115–130\",\"publisher\":\"Springer\",\"year\":\"2012\",\"doi\":\"10.1007/978-3-642-35182-2_9\",\"abstract\":\"Many compilers target common back-ends, thereby avoiding the need to implement the same analyses for many different source languages. This has led to interest in static analysis of LLVM code. In LLVM (and similar languages) most signedness information associated with variables has been compiled away. Current analyses of LLVM code tend to assume that either all values are signed or all are unsigned (except where the code specifies the signedness). We show how program analysis can simultaneously consider each bit-string to be both signed and unsigned, thus improving precision, and we implement the idea for the specific case of integer bounds analysis. Experimental evaluation shows that this provides higher precision at little extra cost. Our approach turns out to be beneficial even when all signedness information is available, such as when analysing C or Java code.\",\"keywords\":\"Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM\",\"bibtex\":\"@InProceedings{Nav-Sch-Son-Stu_APLAS12,\\n  author    = {Jorge A. Navas and \\n\\t\\tPeter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and\\n\\t\\tPeter J. Stuckey},\\n  title     = {Signedness-Agnostic Program Analysis: \\n\\t\\tPrecise Integer Bounds for Low-Level Code},\\n  editor    = {R. Jhala and A. Igarashi},\\n  booktitle = {APLAS 2012: Proceedings of the 10th Asian Symposium \\n        \\ton Programming Languages and Systems},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {7705},\\n  pages     = {115--130},\\n  publisher = {Springer},\\n  year      = {2012},\\n  doi       = {10.1007/978-3-642-35182-2_9},\\n  abstract  = {Many compilers target common back-ends, thereby \\n\\t\\tavoiding the need to implement the same analyses \\n\\t\\tfor many different source languages. This has led\\n\\t\\tto interest in static analysis of LLVM code. \\n\\t\\tIn LLVM (and similar languages) most signedness \\n\\t\\tinformation associated with variables has been \\n\\t\\tcompiled away. Current analyses of LLVM code tend\\n\\t\\tto assume that either all values are signed or all\\n\\t\\tare unsigned (except where the code specifies the \\n\\t\\tsignedness). We show how program analysis can \\n\\t\\tsimultaneously consider each bit-string to be both \\n\\t\\tsigned and unsigned, thus improving precision, \\n\\t\\tand we implement the idea for the specific case of \\n\\t\\tinteger bounds analysis. Experimental evaluation\\n\\t\\tshows that this provides higher precision at little\\n\\t\\textra cost. Our approach turns out to be beneficial\\n\\t\\teven when all signedness information is available,\\n\\t\\tsuch as when analysing C or Java code.},\\n  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},\\n}\\n\\n\",\"author_short\":[\"Navas, J. A.\",\"Schachte, P.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Jhala, R.\",\"Igarashi, A.\"],\"key\":\"Nav-Sch-Son-Stu_APLAS12\",\"id\":\"Nav-Sch-Son-Stu_APLAS12\",\"bibbaseid\":\"navas-schachte-sndergaard-stuckey-signednessagnosticprogramanalysispreciseintegerboundsforlowlevelcode-2012\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"Abstract interpretation\",\"Interval analysis\",\"Machine arithmetic\",\"C analysis\",\"LLVM\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Leigh\"],\"propositions\":[],\"lastnames\":[\"Whiting\"],\"suffixes\":[]},{\"firstnames\":[\"Kevin\"],\"propositions\":[],\"lastnames\":[\"Henshall\"],\"suffixes\":[]}],\"title\":\"Information Loss in Knowledge Compilation: A Comparison of Boolean Envelopes\",\"journal\":\"Artificial Intelligence\",\"volume\":\"174\",\"number\":\"9–10\",\"pages\":\"585–596\",\"year\":\"2010\",\"doi\":\"10.1016/j.artint.2010.03.003\",\"abstract\":\"Since Selman and Kautz's seminal work on the use of Horn approximation to speed up the querying of knowledge bases, there has been great interest in Boolean approximation for AI applications. There are several Boolean classes with desirable computational properties similar to those of the Horn class. The class of affine Boolean functions, for example, has been proposed as an interesting alternative to Horn for knowledge compilation. To investigate the trade-offs between precision and efficiency in knowledge compilation, we compare, analytically and empirically, four well-known Boolean classes, and their combinations, for ability to preserve information. We note that traditional evaluation which explores unit-clause consequences of random hard 3-CNF formulas does not tell the full story, and we complement that evaluation with experiments based on a variety of assumptions about queries and the underlying knowledge base.\",\"keywords\":\"Boolean logic, Boolean approximation, Knowledge compilation, Artificial intelligence\",\"bibtex\":\"@Article{Sch-Son-Whi-Hen_AIJ10,\\n  author    = {Peter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tLeigh Whiting and\\n\\t\\tKevin Henshall},\\n  title     = {Information Loss in Knowledge Compilation: \\n\\t\\tA Comparison of {Boolean} Envelopes},\\n  journal   = {Artificial Intelligence},\\n  volume    = {174},\\n  number    = {9--10},\\n  pages     = {585--596},\\n  year      = {2010},\\n  doi       = {10.1016/j.artint.2010.03.003},\\n  abstract  = {Since Selman and Kautz's seminal work on the use of Horn \\n\\t\\tapproximation to speed up the querying of knowledge bases, \\n\\t\\tthere has been great interest in Boolean approximation for \\n\\t\\tAI applications. There are several Boolean classes with \\n\\t\\tdesirable computational properties similar to those of the\\n\\t\\tHorn class. The class of affine Boolean functions, for example,\\n\\t\\thas been proposed as an interesting alternative to Horn for \\n\\t\\tknowledge compilation. To investigate the trade-offs between\\n\\t\\tprecision and efficiency in knowledge compilation, we compare, \\n\\t\\tanalytically and empirically, four well-known Boolean classes,\\n\\t\\tand their combinations, for ability to preserve information.\\n\\t\\tWe note that traditional evaluation which explores unit-clause\\n\\t\\tconsequences of random hard 3-CNF formulas does not tell the \\n\\t\\tfull story, and we complement that evaluation with experiments \\n\\t\\tbased on a variety of assumptions about queries and the \\n\\t\\tunderlying knowledge base.},\\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, Artificial intelligence},\\n}\\n\\n\",\"author_short\":[\"Schachte, P.\",\"Søndergaard, H.\",\"Whiting, L.\",\"Henshall, K.\"],\"key\":\"Sch-Son-Whi-Hen_AIJ10\",\"id\":\"Sch-Son-Whi-Hen_AIJ10\",\"bibbaseid\":\"schachte-sndergaard-whiting-henshall-informationlossinknowledgecompilationacomparisonofbooleanenvelopes-2010\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Boolean approximation\",\"Knowledge compilation\",\"Artificial intelligence\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Boolean Approximation Revisited\",\"editor\":[{\"firstnames\":[\"I.\"],\"propositions\":[],\"lastnames\":[\"Miguel\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Ruml\"],\"suffixes\":[]}],\"booktitle\":\"Abstraction, Reformulation and Approximation: Proceedings of SARA 2007\",\"series\":\"Lecture Notes in Artificial Intelligence\",\"volume\":\"4612\",\"pages\":\"329–343\",\"publisher\":\"Springer\",\"year\":\"2007\",\"doi\":\"10.1007/978-3-540-73580-9_26\",\"abstract\":\"Most work to date on Boolean approximation assumes that Boolean functions are represented by formulas in conjunctive normal form. That assumption is appropriate for the classical applications of Boolean approximation but potentially limits wider use. We revisit, in a lattice-theoretic setting, so-called envelopes and cores in propositional logic, identifying them with upper and lower closure operators, respectively. This leads to recursive representation-independent characterisations of Boolean approximation for a large class of classes. We show that Boolean development can be applied in a representation-independent setting to develop approximation algorithms for a broad range of Boolean classes, including Horn and Krom functions.\",\"keywords\":\"Boolean logic, Boolean approximation, Lattice theory\",\"bibtex\":\"@Inproceedings{Sch-Son_SARA07,\\n  author    = {Peter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Boolean Approximation Revisited},\\n  editor    = {I. Miguel and W. Ruml},\\n  booktitle = {Abstraction, Reformulation and Approximation:\\n         \\tProceedings of {SARA} 2007},\\n  series    = {Lecture Notes in Artificial Intelligence},\\n  volume    = {4612},\\n  pages     = {329--343},\\n  publisher = {Springer},\\n  year      = {2007},\\n  doi       = {10.1007/978-3-540-73580-9_26},\\n  abstract  = {Most work to date on Boolean approximation assumes that\\n\\t\\tBoolean functions are represented by formulas in\\n\\t\\tconjunctive normal form. That assumption is appropriate \\n\\t\\tfor the classical applications of Boolean approximation \\n\\t\\tbut potentially limits wider use. We revisit, in a \\n\\t\\tlattice-theoretic setting, so-called envelopes and cores\\n\\t\\tin propositional logic, identifying them with upper and\\n\\t\\tlower closure operators, respectively. This leads to \\n\\t\\trecursive representation-independent characterisations\\n\\t\\tof Boolean approximation for a large class of classes.\\n\\t\\tWe show that Boolean development can be applied in a \\n\\t\\trepresentation-independent setting to develop approximation\\n\\t\\talgorithms for a broad range of Boolean classes, including\\n\\t\\tHorn and Krom functions.},\\n  keywords  = {Boolean logic, Boolean approximation, Lattice theory},\\n}\\n\\n\",\"author_short\":[\"Schachte, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Miguel, I.\",\"Ruml, W.\"],\"key\":\"Sch-Son_SARA07\",\"id\":\"Sch-Son_SARA07\",\"bibbaseid\":\"schachte-sndergaard-booleanapproximationrevisited-2007\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Boolean approximation\",\"Lattice theory\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Schachte\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Closure Operators for ROBDDs\",\"editor\":[{\"firstnames\":[\"E.\",\"A.\"],\"propositions\":[],\"lastnames\":[\"Emerson\"],\"suffixes\":[]},{\"firstnames\":[\"K.\",\"S.\"],\"propositions\":[],\"lastnames\":[\"Namjoshi\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Seventh International Conference on Verification, Model Checking and Abstract Interpretation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"3855\",\"pages\":\"1–16\",\"publisher\":\"Springer\",\"year\":\"2006\",\"doi\":\"10.1007/11609773_1\",\"abstract\":\"Program analysis commonly makes use of Boolean functions to express information about run-time states. Many important classes of Boolean functions used this way, such as the monotone functions and the Boolean Horn functions, have simple semantic characterisations. They also have well-known syntactic characterisations in terms of Boolean formulae, say, in conjunctive normal form. Here we are concerned with characterisations using binary decision diagrams. Over the last decade, ROBDDs have become popular as representations of Boolean functions, mainly for their algorithmic properties. Assuming ROBDDs as representation, we address the following problems: Given a function $ψ$ and a class of functions $ļass$, how to find the strongest $φ ∈ ļass$ entailed by $ψ$ (when such a $φ$ is known to exist)? How to find the weakest $φ ∈ ļass$ that entails $ψ$? How to determine that a function $ψ$ belongs to a class $ļass$? Answers are important, not only for several program analyses, but for other areas of computer science, where Boolean approximation is used. We give, for many commonly used classes $ļass$ of Boolean functions, algorithms to approximate functions represented as ROBDDs, in the sense described above. The algorithms implement upper closure operators, familiar from abstract interpretation. They immediately lead to algorithms for deciding class membership.\",\"keywords\":\"Boolean logic, Boolean approximation, ROBDDs\",\"bibtex\":\"@Inproceedings{Sch-Son_VMCAI06,\\n  author    = {Peter Schachte and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Closure Operators for {ROBDDs}},\\n  editor    = {E. A. Emerson and K. S. Namjoshi},\\n  booktitle = {Proceedings of the Seventh International Conference on\\n        \\tVerification, Model Checking and Abstract Interpretation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {3855},\\n  pages     = {1--16},\\n  publisher = {Springer},\\n  year      = {2006},\\n  doi       = {10.1007/11609773_1},\\n  abstract  = {Program analysis commonly makes use of Boolean functions to \\n\\t\\texpress information about run-time states. Many important \\n\\t\\tclasses of Boolean functions used this way, such as the\\n\\t\\tmonotone functions and the Boolean Horn functions, have\\n\\t\\tsimple semantic characterisations. They also have well-known \\n\\t\\tsyntactic characterisations in terms of Boolean formulae, say,\\n\\t\\tin conjunctive normal form. Here we are concerned with \\n\\t\\tcharacterisations using binary decision diagrams. Over the \\n\\t\\tlast decade, ROBDDs have become popular as representations of \\n\\t\\tBoolean functions, mainly for their algorithmic properties.\\n\\t\\tAssuming ROBDDs as representation, we address the following \\n\\t\\tproblems: Given a function $\\\\psi$ and a class of functions \\n\\t\\t$\\\\class$, how to find the strongest $\\\\varphi \\\\in \\\\class$ \\n\\t\\tentailed by $\\\\psi$ (when such a $\\\\varphi$ is known to exist)?\\n\\t\\tHow to find the weakest $\\\\varphi \\\\in \\\\class$ that entails \\n\\t\\t$\\\\psi$? How to determine that a function $\\\\psi$ belongs to a \\n\\t\\tclass $\\\\class$? Answers are important, not only for several \\n\\t\\tprogram analyses, but for other areas of computer science, \\n\\t\\twhere Boolean approximation is used. We give, for many commonly\\n\\t\\tused classes $\\\\class$ of Boolean functions, algorithms to \\n\\t\\tapproximate functions represented as ROBDDs, in the sense \\n\\t\\tdescribed above. The algorithms implement upper closure \\n\\t\\toperators, familiar from abstract interpretation.  They \\n\\t\\timmediately lead to algorithms for deciding class membership.},\\n  keywords  = {Boolean logic, Boolean approximation, ROBDDs},\\n}\\n\\n\",\"author_short\":[\"Schachte, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Emerson, E. A.\",\"Namjoshi, K. S.\"],\"key\":\"Sch-Son_VMCAI06\",\"id\":\"Sch-Son_VMCAI06\",\"bibbaseid\":\"schachte-sndergaard-closureoperatorsforrobdds-2006\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Boolean logic\",\"Boolean approximation\",\"ROBDDs\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution)\",\"editor\":[{\"firstnames\":[\"G.\"],\"propositions\":[],\"lastnames\":[\"Keller\"],\"suffixes\":[]},{\"firstnames\":[\"M.\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]}],\"booktitle\":\"PEPM 2024: Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation\",\"pages\":\"1–13\",\"year\":\"2024\",\"doi\":\"10.1145/3635800.3637445\",\"abstract\":\"Forty years ago development started on Mix, a partial evaluator designed specifically for the purpose of self-application. The effort, led by Neil D. Jones at the University of Copenhagen, eventually demonstrated that non-trivial compilers could be generated automatically by applying a partial evaluator to itself. The possibility, in theory, of such self-application had been known for more than a decade, but remained unrealized by the start of 1984. We describe the genesis of Mix, including the research environment, the challenges, and the main insights that led to success. We emphasize the critical role played by program annotation as a pre-processing step, a process that became automated in the form of binding-time analysis.\",\"keywords\":\"Partial evaluation, Binding-time analysis, Compilation, History\",\"bibtex\":\"@inproceedings{Ses-Son_PEPM24,\\n  author    = {Peter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {The Genesis of {Mix}: Early Days of Self-Applicable \\n\\t\\tPartial Evaluation (Invited Contribution)},\\n  editor    = {G. Keller and M. Wang},\\n  booktitle = {PEPM 2024: Proceedings of the 2024 ACM SIGPLAN International\\n        \\tWorkshop on Partial Evaluation and Program Manipulation},\\n  pages     = {1--13},\\n  year      = {2024},\\n  doi       = {10.1145/3635800.3637445},\\n  abstract  = {Forty years ago development started on Mix, a partial evaluator\\n\\t\\tdesigned specifically for the purpose of self-application.\\n\\t\\tThe effort, led by Neil D. Jones at the University of \\n\\t\\tCopenhagen, eventually demonstrated that non-trivial compilers\\n\\t\\tcould be generated automatically by applying a partial \\n\\t\\tevaluator to itself. The possibility, in theory, of such \\n\\t\\tself-application had been known for more than a decade, but\\n\\t\\tremained unrealized by the start of 1984. We describe the \\n\\t\\tgenesis of Mix, including the research environment, the \\n\\t\\tchallenges, and the main insights that led to success. We \\n\\t\\temphasize the critical role played by program annotation as a\\n\\t\\tpre-processing step, a process that became automated in the \\n\\t\\tform of binding-time analysis.},\\n  keywords  = {Partial evaluation, Binding-time analysis, Compilation, History},\\n}\\n\\n\",\"author_short\":[\"Sestoft, P.\",\"Søndergaard, H.\"],\"editor_short\":[\"Keller, G.\",\"Wang, M.\"],\"key\":\"Ses-Son_PEPM24\",\"id\":\"Ses-Son_PEPM24\",\"bibbaseid\":\"sestoft-sndergaard-thegenesisofmixearlydaysofselfapplicablepartialevaluationinvitedcontribution-2024\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Binding-time analysis\",\"Compilation\",\"History\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"proceedings\",\"editor\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"PEPM '94: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation\",\"location\":\"Orlando, Florida\",\"year\":\"1994\",\"doi\":\"10.1007/BF01019002\",\"note\":\"Technical Report 94/9, Department of Computer Science, The University of Melbourne\",\"keywords\":\"Partial evaluation, Program transformation, Static analysis\",\"bibtex\":\"@Proceedings{Ses-Son_PEPM94,\\n  editor    = {Peter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title\\t    = {PEPM '94: Proceedings of the ACM SIGPLAN Workshop on Partial \\n\\t\\tEvaluation and Semantics-Based Program Manipulation},\\n  location  = {Orlando, Florida},\\n  year      = {1994},\\n  doi       = {10.1007/BF01019002},\\n  note\\t    = {Technical Report 94/9, Department of Computer Science, \\n\\t\\tThe University of Melbourne},\\n  keywords  = {Partial evaluation, Program transformation, Static analysis},\\n}\\n\\n\",\"editor_short\":[\"Sestoft, P.\",\"Søndergaard, H.\"],\"key\":\"Ses-Son_PEPM94\",\"id\":\"Ses-Son_PEPM94\",\"bibbaseid\":\"sestoft-sndergaard-pepm94proceedingsoftheacmsigplanworkshoponpartialevaluationandsemanticsbasedprogrammanipulation-1994\",\"role\":\"editor\",\"urls\":{},\"keyword\":[\"Partial evaluation\",\"Program transformation\",\"Static analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"A Bibliography on Partial Evaluation\",\"journal\":\"SIGPLAN Notices\",\"volume\":\"23\",\"number\":\"2\",\"pages\":\"19–27\",\"year\":\"1988\",\"doi\":\"10.1145/43908.43910\",\"abstract\":\"This note gives a short introduction to partial evaluation and an extensive, annotated bibliography to the field. The bibliography is restricted to cover public-domain literature in English.\",\"keywords\":\"Partial evaluation\",\"bibtex\":\"@Article{Ses-Son_pebibl88,\\n  author    = {Peter Sestoft and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {A Bibliography on Partial Evaluation},\\n  journal   = {SIGPLAN Notices},\\n  volume    = {23},\\n  number    = {2},\\n  pages     = {19--27},\\n  year      = {1988},\\n  doi       = {10.1145/43908.43910},\\n  abstract  = {This note gives a short introduction to partial evaluation \\n\\t\\tand an extensive, annotated bibliography to the field. \\n\\t\\tThe bibliography is restricted to cover public-domain \\n\\t\\tliterature in English.},\\n  keywords  = {Partial evaluation},\\n}\\n\\n\",\"author_short\":[\"Sestoft, P.\",\"Søndergaard, H.\"],\"key\":\"Ses-Son_pebibl88\",\"id\":\"Ses-Son_pebibl88\",\"bibbaseid\":\"sestoft-sndergaard-abibliographyonpartialevaluation-1988\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Partial evaluation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction\",\"editor\":[{\"firstnames\":[\"B.\"],\"propositions\":[],\"lastnames\":[\"Robinet\"],\"suffixes\":[]},{\"firstnames\":[\"R.\"],\"propositions\":[],\"lastnames\":[\"Wilhelm\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the European Symposium on Programming—ESOP 86\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"213\",\"pages\":\"327–338\",\"publisher\":\"Springer-Verlag\",\"year\":\"1986\",\"doi\":\"10.1007/3-540-16442-1_25\",\"abstract\":\"The occur check in Robinson unification is superfluous in most unifications that take place in practice. The present paper is concerned with the problem of determining circumstances under which the occur may safely be dispensed with. The method given draws on one outlined by David Plaisted. The framework, however, differs in that we systematically apply the abstract interpretation principle to logic programs. The aim is to give a clear presentation and to facilitate justification of the soundness of the method.\",\"keywords\":\"Abstract interpretation, Logic programming, Prolog, Unification\",\"bibtex\":\"@Inproceedings{Son_ESOP86,\\n  author    = {Harald S{\\\\o}ndergaard},\\n  title     = {An Application of Abstract Interpretation of Logic Programs:\\n\\t\\tOccur Check Reduction},\\n  editor    = {B. Robinet and R. Wilhelm},\\n  booktitle = {Proceedings of the European Symposium on Programming---ESOP 86},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {213},\\n  pages     = {327--338},\\n  publisher = {Springer-Verlag},\\n  year      = {1986},\\n  doi       = {10.1007/3-540-16442-1_25},\\n  abstract  = {The occur check in Robinson unification is superfluous in most \\n\\t\\tunifications that take place in practice. The present paper is \\n\\t\\tconcerned with the problem of determining circumstances under \\n\\t\\twhich the occur may safely be dispensed with. The method given \\n\\t\\tdraws on one outlined by David Plaisted. The framework, \\n\\t\\thowever, differs in that we systematically apply the abstract \\n\\t\\tinterpretation principle to logic programs. The aim is to give\\n\\t\\ta clear presentation and to facilitate justification of the \\n\\t\\tsoundness of the method.},\\n  keywords  = {Abstract interpretation, Logic programming, Prolog, Unification},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\"],\"editor_short\":[\"Robinet, B.\",\"Wilhelm, R.\"],\"key\":\"Son_ESOP86\",\"id\":\"Son_ESOP86\",\"bibbaseid\":\"sndergaard-anapplicationofabstractinterpretationoflogicprogramsoccurcheckreduction-1986\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Logic programming\",\"Prolog\",\"Unification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"phdthesis\",\"type\":\"phdthesis\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Semantics-Based Analysis and Transformation of Logic Programs\",\"school\":\"University of Copenhagen, Denmark\",\"year\":\"1989\",\"note\":\"Also available as: Technical Report 89/21, Department of Computer Science, The University of Melbourne, 1990, DIKU Report 89/22, Department of Computer Science, University of Copenhagen, 1990, and Technical Report #12, Key Center for Knowledge Based Systems, RMIT and the University of Melbourne, 1990\",\"abstract\":\"Dataflow analysis is an essential component of many programming tools. One use of dataflow information is to identify errors in a program, as done by program ``debuggers'' and type checkers. Another is in compilers and other program transformers, where the analysis may guide various optimisations. The correctness of a programming tool's dataflow analysis component is usually of paramount importance. The theory of abstract interpretation, originally developed by P. and R. Cousot aims at providing a framework for the development of correct analysis tools. In this theory, dataflow analysis is viewed as ``non-standard'' semantics, and abstract interpretation prescribes certain relations between standard and non-standard semantics, in order to guarantee the correctness of the non-standard semantics with respect to the standard semantics. The increasing acceptance of Prolog as a practical programming language has motivated widespread interest in dataflow analysis of logic programs and especially in abstract interpretation. Logic programmming languages are attractive from a semantical point of view, but dataflow analysis of logic programs is more complex than that of more traditional programming languages, since dataflow is bi-directional (owing to unification) and control flow is in terms of backtracking. The present thesis is concerned with semantics-based dataflow analysis of logic programs. We first set up a theory for dataflow analysis which is basically that of abstract interpretation as introduced by P. and R. Cousot. We do, however, relax the classical theory of abstract interpretation somewhat, by giving up the demand for (unique) \\\\emphbest approximations. Two different kinds of analysis of logic programs are then identified: a \\\\emphbottom-up analysis yields an approximation to the success set (and possibly the failure set) of a program, whereas a \\\\emphtop-down analysis yields an approximation to the call patterns that would appear during an execution based on SLD resolution. We investigate some of the uses of the two kinds of analysis. In the bottom-up case, we pay special attention to (bottom-up) type inference and its use in program specialisation. In the top-down case, we present a generic ``dataflow semantics'' that encompasses many useful dataflow analyses. As an instance of the generic semantics, a groundness analysis is detailed, and a series of other applications are mentioned. We finally present a transformation technique, based on top-down analysis, for introducing difference-lists in a list-manipulating program, without changing the program's semantics. This may lead to substantial improvement in a program's execution time.\",\"keywords\":\"Abstract interpretation, Abstract domains, Logic programming, Semantics, Many-valued logic, Unification, Groundness analysis, Program transformation\",\"bibtex\":\"@Phdthesis{Son_phd89,\\n  author    = {Harald S{\\\\o}ndergaard},\\n  title\\t    = {Semantics-Based Analysis and Transformation of Logic Programs},\\n  school    = {University of Copenhagen, Denmark},\\n  year\\t    = {1989},\\n  note\\t    = {Also available as: Technical Report 89/21,\\n\\t\\tDepartment of Computer Science, \\n\\t\\tThe University of Melbourne, 1990,\\n\\t\\tDIKU Report 89/22, Department of Computer Science, \\n\\t\\tUniversity of Copenhagen, 1990,\\n\\t\\tand Technical Report \\\\#12,\\n\\t\\tKey Center for Knowledge Based Systems,\\n\\t\\tRMIT and the University of Melbourne, 1990},\\n  abstract  = {Dataflow analysis is an essential component of many programming \\n\\t\\ttools. One use of dataflow information is to identify errors in\\n\\t\\ta program, as done by program ``debuggers'' and type checkers.\\n\\t\\tAnother is in compilers and other program transformers, where \\n\\t\\tthe analysis may guide various optimisations.\\n\\n\\t\\tThe correctness of a programming tool's dataflow analysis \\n\\t\\tcomponent is usually of paramount importance. The theory of \\n\\t\\tabstract interpretation, originally developed by P. and R. \\n\\t\\tCousot aims at providing a framework for the development of \\n\\t\\tcorrect analysis tools. In this theory, dataflow analysis is \\n\\t\\tviewed as ``non-standard'' semantics, and abstract \\n\\t\\tinterpretation prescribes certain relations between standard\\n\\t\\tand non-standard semantics, in order to guarantee the \\n\\t\\tcorrectness of the non-standard semantics with respect to the \\n\\t\\tstandard semantics.\\n\\n\\t\\tThe increasing acceptance of Prolog as a practical programming \\n\\t\\tlanguage has motivated widespread interest in dataflow analysis\\n\\t\\tof logic programs and especially in abstract interpretation.\\n\\t\\tLogic programmming languages are attractive from a semantical \\n\\t\\tpoint of view, but dataflow analysis of logic programs is more \\n\\t\\tcomplex than that of more traditional programming languages, \\n\\t\\tsince dataflow is bi-directional (owing to unification) and \\n\\t\\tcontrol flow is in terms of backtracking.\\n\\n\\t\\tThe present thesis is concerned with semantics-based dataflow \\n\\t\\tanalysis of logic programs. We first set up a theory for \\n\\t\\tdataflow analysis which is basically that of abstract \\n\\t\\tinterpretation as introduced by P. and R. Cousot. We do, \\n\\t\\thowever, relax the classical theory of abstract interpretation\\n\\t\\tsomewhat, by giving up the demand for (unique) \\\\emph{best} \\n\\t\\tapproximations.\\n\\n\\t\\tTwo different kinds of analysis of logic programs are then \\n\\t\\tidentified: a \\\\emph{bottom-up} analysis yields an approximation\\n\\t\\tto the success set (and possibly the failure set) of a program,\\n\\t\\twhereas a \\\\emph{top-down} analysis yields an approximation to \\n\\t\\tthe call patterns that would appear during an execution based \\n\\t\\ton SLD resolution. We investigate some of the uses of the two \\n\\t\\tkinds of analysis. In the bottom-up case, we pay special \\n\\t\\tattention to (bottom-up) type inference and its use in program \\n\\t\\tspecialisation. In the top-down case, we present a generic \\n\\t\\t``dataflow semantics'' that encompasses many useful dataflow \\n\\t\\tanalyses. As an instance of the generic semantics, a groundness\\n\\t\\tanalysis is detailed, and a series of other applications are \\n\\t\\tmentioned.\\n\\n\\t\\tWe finally present a transformation technique, based on \\n\\t\\ttop-down analysis, for introducing difference-lists in a \\n\\t\\tlist-manipulating program, without changing the program's \\n\\t\\tsemantics. This may lead to substantial improvement in a \\n\\t\\tprogram's execution time.},\\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, \\n\\t  \\tSemantics, Many-valued logic, Unification, Groundness analysis,\\n\\t\\tProgram transformation},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\"],\"key\":\"Son_phd89\",\"id\":\"Son_phd89\",\"bibbaseid\":\"sndergaard-semanticsbasedanalysisandtransformationoflogicprograms-1989\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract interpretation\",\"Abstract domains\",\"Logic programming\",\"Semantics\",\"Many-valued logic\",\"Unification\",\"Groundness analysis\",\"Program transformation\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Immediate Fixpoints and Their Use in Groundness Analysis\",\"editor\":[{\"firstnames\":[\"V.\"],\"propositions\":[],\"lastnames\":[\"Chandru\"],\"suffixes\":[]},{\"firstnames\":[\"V.\"],\"propositions\":[],\"lastnames\":[\"Vinay\"],\"suffixes\":[]}],\"booktitle\":\"Foundations of Software Technology and Theoretical Computer Science\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1180\",\"pages\":\"359–370\",\"publisher\":\"Springer\",\"year\":\"1996\",\"doi\":\"10.1007/3-540-62034-6_63\",\"abstract\":\"A theorem by Schröder says that for a certain natural class of functions $F : B → B$ defined on a Boolean lattice $B$, $F(x) = F(F(F(x)))$ for all $x ∈ B$. An immediate corollary is that if such a function is monotonic then it is also idempotent, that is, $F(x) = F(F(x))$. We show how this corollary can be extended to recognize cases where recursive definitions can immediately be replaced by an equivalent closed form, that is, they can be solved without Kleene iteration. Our result applies more generally to distributive lattices. It has applications for example in the abstract interpretation of declarative programs and deductive databases. We exemplify this by showing how to accelerate simple cases of strictness analysis for first-order functional programs and, perhaps more successfully, groundness analysis for logic programs.\",\"keywords\":\"Fixed points, Logic programming, Groundness analysis, Lattice theory\",\"bibtex\":\"@Inproceedings{Son_FSTTCS96,\\n  author    = {Harald S{\\\\o}ndergaard},\\n  title     = {Immediate Fixpoints and Their Use in Groundness Analysis},\\n  editor    = {V. Chandru and V. Vinay},\\n  booktitle = {Foundations of Software Technology and \\n\\t\\tTheoretical Computer Science},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1180},\\n  pages     = {359--370},\\n  publisher = {Springer},\\n  year      = {1996},\\n  doi       = {10.1007/3-540-62034-6_63},\\n  abstract  = {A theorem by Schr{\\\\\\\"o}der says that for a certain natural \\n\\t\\tclass of functions $F : B \\\\rightarrow B$ defined on a Boolean \\n\\t\\tlattice $B$, $F(x) = F(F(F(x)))$ for all $x \\\\in B$.\\n\\t\\tAn immediate corollary is that if such a function is monotonic \\n\\t\\tthen it is also idempotent, that is, $F(x) = F(F(x))$.\\n\\t\\tWe show how this corollary can be extended to recognize cases\\n\\t\\twhere recursive definitions can immediately be replaced by an \\n\\t\\tequivalent closed form, that is, they can be solved without \\n\\t\\tKleene iteration. Our result applies more generally to \\n\\t\\tdistributive lattices. It has applications for example in the \\n\\t\\tabstract interpretation of declarative programs and deductive \\n\\t\\tdatabases. We exemplify this by showing how to accelerate \\n\\t\\tsimple cases of strictness analysis for first-order functional \\n\\t\\tprograms and, perhaps more successfully, groundness analysis \\n\\t\\tfor logic programs.},\\n  keywords  = {Fixed points, Logic programming, Groundness analysis, Lattice theory},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\"],\"editor_short\":[\"Chandru, V.\",\"Vinay, V.\"],\"key\":\"Son_FSTTCS96\",\"id\":\"Son_FSTTCS96\",\"bibbaseid\":\"sndergaard-immediatefixpointsandtheiruseingroundnessanalysis-1996\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Fixed points\",\"Logic programming\",\"Groundness analysis\",\"Lattice theory\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"proceedings\",\"editor\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Principles and Practice of Declarative Programming\",\"publisher\":\"ACM Press\",\"year\":\"2001\",\"keywords\":\"PPDP 2001, logic programming, functional programming\",\"bibtex\":\"@Proceedings{Son_PPDP01,\\n  editor    = {Harald S{\\\\o}ndergaard},\\n  title     = {Principles and Practice of Declarative Programming},\\n  publisher = {ACM Press},\\n  year      = {2001},\\n  keywords  = {PPDP 2001, logic programming, functional programming},\\n}\\n\\n\",\"editor_short\":[\"Søndergaard, H.\"],\"key\":\"Son_PPDP01\",\"id\":\"Son_PPDP01\",\"bibbaseid\":\"sndergaard-principlesandpracticeofdeclarativeprogramming-2001\",\"role\":\"editor\",\"urls\":{},\"keyword\":[\"PPDP 2001\",\"logic programming\",\"functional programming\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Learning From and With Peers: The Different Roles of Student Peer Reviewing\",\"booktitle\":\"Proceedings of the 14th Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education\",\"pages\":\"31–35\",\"publisher\":\"Association for Computing Machinery\",\"address\":\"New York, NY\",\"year\":\"2009\",\"location\":\"Paris, France\",\"doi\":\"10.1145/3263191\",\"abstract\":\"There are many different approaches to student peer assessment. In this paper I lay out the pedagogical philosophy behind my own use of student peer reviews. These should not only be seen as adding to the amount of formative feedback in a class, nor are they only about the development of certain higher-order cognitive skills. Properly aligned with an overall assessment strategy, peer reviewing can help build a stronger learning community. I describe such a strategy and my experience using PRAZE, an online tool for student peer reviewing, as well as students' response to the tool and its use.\",\"keywords\":\"Education, Peer review\",\"bibtex\":\"@InProceedings{Son_ITiCSE09,\\n  author    = {Harald S{\\\\o}ndergaard},\\n  title     = {Learning From and With Peers:\\n\\t\\tThe Different Roles of Student Peer Reviewing},\\n  booktitle = {Proceedings of the 14th Annual SIGCSE/SIGCUE Conference on\\n\\t\\tInnovation and Technology in Computer Science Education},\\n  pages     = {31--35},\\n  publisher = {Association for Computing Machinery},\\n  address   = {New York, NY},\\n  year      = {2009},\\n  location  = {Paris, France},\\n  doi       = {10.1145/3263191},\\n  abstract  = {There are many different approaches to student peer assessment.\\n\\t\\tIn this paper I lay out the pedagogical philosophy behind my \\n\\t\\town use of student peer reviews. These should not only be \\n\\t\\tseen as adding to the amount of formative feedback in a class,\\n\\t\\tnor are they only about the development of certain higher-order\\n\\t\\tcognitive skills. Properly aligned with an overall assessment\\n\\t\\tstrategy, peer reviewing can help build a stronger learning \\n\\t\\tcommunity. I describe such a strategy and my experience using\\n\\t\\tPRAZE, an online tool for student peer reviewing, as well as \\n\\t\\tstudents' response to the tool and its use.},\\n  keywords  = {Education, Peer review},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\"],\"key\":\"Son_ITiCSE09\",\"id\":\"Son_ITiCSE09\",\"bibbaseid\":\"sndergaard-learningfromandwithpeersthedifferentrolesofstudentpeerreviewing-2009\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Peer review\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"String Abstract Domains and Their Combination\",\"editor\":[{\"firstnames\":[\"E.\"],\"propositions\":[],\"lastnames\":[\"De Angelis\"],\"suffixes\":[]},{\"firstnames\":[\"W.\"],\"propositions\":[],\"lastnames\":[\"Vanhoof\"],\"suffixes\":[]}],\"booktitle\":\"Logic-Based Program Synthesis and Transformation\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"13290\",\"pages\":\"1–15\",\"publisher\":\"Springer\",\"year\":\"2022\",\"doi\":\"10.1007/978-3-030-98869-2_1\",\"abstract\":\"We survey recent developments in string static analysis, with an emphasis on how string abstract domains can be combined. The paper has formed the basis for an invited presentation given to LOPSTR 2021 and PPDP 2021.\",\"keywords\":\"Abstract domains, String analysis\",\"bibtex\":\"@InProceedings{Son_LOPSTR21,\\n  author    = {Harald S{\\\\o}ndergaard},\\n  title     = {String Abstract Domains and Their Combination},\\n  editor    = {E. {De Angelis} and W. Vanhoof},\\n  booktitle = {Logic-Based Program Synthesis and Transformation},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {13290},\\n  pages     = {1--15},\\n  publisher = {Springer},\\n  year      = {2022},\\n  doi       = {10.1007/978-3-030-98869-2_1},\\n  abstract  = {We survey recent developments in string static analysis, with\\n\\t\\tan emphasis on how string abstract domains can be combined.\\n\\t\\tThe paper has formed the basis for an invited presentation\\n\\t\\tgiven to LOPSTR 2021 and PPDP 2021.},\\n  keywords  = {Abstract domains, String analysis},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\"],\"editor_short\":[\"De Angelis, E.\",\"Vanhoof, W.\"],\"key\":\"Son_LOPSTR21\",\"id\":\"Son_LOPSTR21\",\"bibbaseid\":\"sndergaard-stringabstractdomainsandtheircombination-2022\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Abstract domains\",\"String analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"proceedings\",\"type\":\"proceedings\",\"editor\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Roger\"],\"propositions\":[],\"lastnames\":[\"Hadgraft\"],\"suffixes\":[]}],\"title\":\"Proceedings of the 18th Conference of the Australasian Association for Engineering Education\",\"publisher\":\"Department of Computer Science and Software Engineering, The University of Melbourne, Vic 3010, Australia\",\"month\":\"December\",\"year\":\"2007\",\"isbn\":\"978–0–9757172–1–9\",\"note\":\"Published on CD-ROM and online\",\"keywords\":\"Education\",\"bibtex\":\"@Proceedings{Son-Had_AAEE07,\\n  editor    = {Harald S{\\\\o}ndergaard and \\n\\t\\tRoger Hadgraft},\\n  title     = {Proceedings of the 18th Conference of the \\n\\t\\tAustralasian Association for Engineering Education},\\n  publisher = {Department of Computer Science and Software Engineering,\\n\\t\\tThe University of Melbourne, Vic 3010, Australia},\\n  month     = {December},\\n  year      = {2007},\\n  isbn      = {978--0--9757172--1--9},\\n  note      = {Published on CD-ROM and online},\\n  keywords  = {Education},\\n}\\n\\n\",\"editor_short\":[\"Søndergaard, H.\",\"Hadgraft, R.\"],\"key\":\"Son-Had_AAEE07\",\"id\":\"Son-Had_AAEE07\",\"bibbaseid\":\"sndergaard-hadgraft-proceedingsofthe18thconferenceoftheaustralasianassociationforengineeringeducation-2007\",\"role\":\"editor\",\"urls\":{},\"keyword\":[\"Education\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Raoul\"],\"propositions\":[],\"lastnames\":[\"Mulder\"],\"suffixes\":[]}],\"title\":\"Collaborative Learning through Formative Peer Review: Pedagogy, Programs and Potential\",\"journal\":\"Computer Science Education\",\"volume\":\"22\",\"number\":\"4\",\"pages\":\"343–367\",\"year\":\"2012\",\"doi\":\"10.1080/08993408.2012.728041\",\"abstract\":\"We examine student peer review, with an emphasis on formative practice and collaborative learning, rather than peer grading. Opportunities to engage students in such formative peer assessment are growing, as a range of online tools become available to manage and simplify the process of administering student peer review. We consider whether pedagogical requirements for student peer review are likely to be discipline-specific, taking computer science and software engineering as an example. We then summarise what attributes are important for a modern generic peer review tool, and classify tools according to four prevalent emphases, using currently available, mature tools to illustrate each. We conclude by identifying some gaps in current understanding of formative peer review, and discuss how online tools for student peer review can help create opportunities to answer some of these questions.\",\"keywords\":\"Education, Peer review\",\"bibtex\":\"@article{Son-Mul_CSE12,\\n  author    = {Harald S{\\\\o}ndergaard and \\n\\t\\tRaoul Mulder},\\n  title     = {Collaborative Learning through Formative Peer Review:\\n\\t\\tPedagogy, Programs and Potential},\\n  journal   = {Computer Science Education},\\n  volume    = {22},\\n  number    = {4},\\n  pages     = {343--367},\\n  year      = {2012},\\n  doi       = {10.1080/08993408.2012.728041},\\n  abstract  = {We examine student peer review, with an emphasis on \\n\\t\\tformative practice and collaborative learning, rather \\n\\t\\tthan peer grading. Opportunities to engage students in \\n\\t\\tsuch formative peer assessment are growing, as a range \\n\\t\\tof online tools become available to manage and simplify \\n\\t\\tthe process of administering student peer review. \\n\\t\\tWe consider whether pedagogical requirements for student\\n\\t\\tpeer review are likely to be discipline-specific, taking\\n\\t\\tcomputer science and software engineering as an example.\\n\\t\\tWe then summarise what attributes are important for a \\n\\t\\tmodern generic peer review tool, and classify tools \\n\\t\\taccording to four prevalent emphases, using currently \\n\\t\\tavailable, mature tools to illustrate each. We conclude \\n\\t\\tby identifying some gaps in current understanding of \\n\\t\\tformative peer review, and discuss how online tools for \\n\\t\\tstudent peer review can help create opportunities to \\n\\t\\tanswer some of these questions.},\\n  keywords  = {Education, Peer review},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\",\"Mulder, R.\"],\"key\":\"Son-Mul_CSE12\",\"id\":\"Son-Mul_CSE12\",\"bibbaseid\":\"sndergaard-mulder-collaborativelearningthroughformativepeerreviewpedagogyprogramsandpotential-2012\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Peer review\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]}],\"title\":\"Referential Transparency, Definiteness and Unfoldability\",\"journal\":\"Acta Informatica\",\"volume\":\"27\",\"number\":\"6\",\"pages\":\"505–517\",\"year\":\"1990\",\"note\":\"Reviewed in Computing Reviews 32(3): 144–145, 1991\",\"doi\":\"10.1007/BF00277387\",\"abstract\":\"The term ``referential transparency'' is frequently used to indicate that a programming language has certain useful properties. We observe, however, that the formal and informal definitions given in the literature are not equivalent and we investigate their relationships. To this end, we study the definitions in the context of a simple expression language and show that in the presence of non-determinism, the differences are manifest. We propose a definition of ``referential transparency'', based on Quine's, as well as of the related notions: definiteness and unfoldability. We demonstrate that these notions are useful to characterize programming languages.\",\"keywords\":\"Programming language concepts, Nondeterminism, Semantics\",\"bibtex\":\"@Article{Son-Ses_ACTA90,\\n  author    = {Harald S{\\\\o}ndergaard and \\n\\t\\tPeter Sestoft},\\n  title\\t    = {Referential Transparency, Definiteness and Unfoldability},\\n  journal   = {Acta Informatica},\\n  volume    = {27},\\n  number    = {6},\\n  pages\\t    = {505--517},\\n  year\\t    = {1990},\\n  note\\t    = {Reviewed in Computing Reviews 32(3): 144--145, 1991},\\n  doi       = {10.1007/BF00277387},\\n  abstract  = {The term ``referential transparency'' is frequently used\\n\\t\\tto indicate that a programming language has certain useful\\n\\t\\tproperties. We observe, however, that the formal and\\n\\t\\tinformal definitions given in the literature are not\\n\\t\\tequivalent and we investigate their relationships.\\n\\t\\tTo this end, we study the definitions in the context of\\n\\t\\ta simple expression language and show that in the presence\\n\\t\\tof non-determinism, the differences are manifest. We \\n\\t\\tpropose a definition of ``referential transparency'', based\\n\\t\\ton Quine's, as well as of the related notions: definiteness\\n\\t\\tand unfoldability. We demonstrate that these notions are\\n\\t\\tuseful to characterize programming languages.},\\n  keywords  = {Programming language concepts, Nondeterminism, Semantics},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\",\"Sestoft, P.\"],\"key\":\"Son-Ses_ACTA90\",\"id\":\"Son-Ses_ACTA90\",\"bibbaseid\":\"sndergaard-sestoft-referentialtransparencydefinitenessandunfoldability-1990\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Programming language concepts\",\"Nondeterminism\",\"Semantics\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\"],\"propositions\":[],\"lastnames\":[\"Sestoft\"],\"suffixes\":[]}],\"title\":\"Non-Determinism in Functional Languages\",\"journal\":\"The Computer Journal\",\"volume\":\"35\",\"number\":\"5\",\"pages\":\"514–523\",\"year\":\"1992\",\"doi\":\"10.1093/comjnl/35.5.514\",\"abstract\":\"The introduction of a non-deterministic operator in even a very simple functional programming language gives rise to a plethora of semantic questions. These questions are not only concerned with the choice operator itself. A surprisingly large number of different parameter passing mechanisms are made possible by the introduction of bounded non-determinism. The diversity of semantic possibilities is examined systematically using denotational definitions based on mathematical structures called powerdomains. This results in an improved understanding of the different kinds of non-determinism and the properties of different kinds of non-deterministic languages.\",\"keywords\":\"Programming language concepts, Nondeterminism, Functional programming, Semantics\",\"bibtex\":\"@Article{Son-Ses_CJ92,\\n  author    = {Harald S{\\\\o}ndergaard and \\n\\t\\tPeter Sestoft},\\n  title     = {Non-Determinism in Functional Languages},\\n  journal   = {The Computer Journal},\\n  volume    = {35},\\n  number    = {5},\\n  pages\\t    = {514--523},\\n  year\\t    = {1992},\\n  doi       = {10.1093/comjnl/35.5.514},\\n  abstract  = {The introduction of a non-deterministic operator in even a\\n\\t\\tvery simple functional programming language gives rise to\\n\\t\\ta plethora of semantic questions. These questions are not \\n\\t\\tonly concerned with the choice operator itself. A\\n\\t\\tsurprisingly large number of different parameter passing\\n\\t\\tmechanisms are made possible by the introduction of bounded\\n\\t\\tnon-determinism. The diversity of semantic possibilities\\n\\t\\tis examined systematically using denotational definitions\\n\\t\\tbased on mathematical structures called powerdomains. This\\n\\t\\tresults in an improved understanding of the different kinds\\n\\t\\tof non-determinism and the properties of different kinds of\\n\\t\\tnon-deterministic languages.},\\n  keywords  = {Programming language concepts, Nondeterminism, Functional programming, Semantics},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\",\"Sestoft, P.\"],\"key\":\"Son-Ses_CJ92\",\"id\":\"Son-Ses_CJ92\",\"bibbaseid\":\"sndergaard-sestoft-nondeterminisminfunctionallanguages-1992\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Programming language concepts\",\"Nondeterminism\",\"Functional programming\",\"Semantics\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Doreen\"],\"propositions\":[],\"lastnames\":[\"Thomas\"],\"suffixes\":[]}],\"title\":\"Effective Feedback to Small and Large Classes\",\"booktitle\":\"Proceedings of the 2004 ASEE/IEEE Frontiers in Education Conference (FIE2004)\",\"pages\":\"F1E-9–F1E-14\",\"location\":\"Savannah GA\",\"month\":\"oct\",\"year\":\"2004\",\"doi\":\"10.1109/FIE.2004.1408573\",\"abstract\":\"Educational experts appear to be in broad agreement when it comes to the importance of feedback for effective learning. Students benefit from plenty of opportunity and encouragement to express their understanding, and from informed, supportive, possibly challenging, feedback. At the same time, we observe that many students at our university do not find that they receive helpful feedback. One in three Engineering students disagree or strongly disagree with the Quality of Teaching questionnaire's ``I received helpful feedback on how I was going'' in the individual course, and most other disciplines find themselves in a similar situation. For the university as a whole, student responses to this question are clearly less positive than to other questions on quality of teaching, intellectual stimulation, staff interest, workload, and so on, and this state of affairs seems quite common in the Australian context. We discuss best practice in feedback provision, partly based on our interviews with students and staff. We have been particularly interested in identifying cost-effective ways of providing informed and constructive feedback to large classes. Feedback is often understood, by Engineering students and staff alike, simply as comments on submitted work—typically written assignments. We argue in favour of a broader concept that covers a multitude of ways for a student to develop deep learning through conversation, including questions and answers provided by others, team work, study groups, and formative teacher-provided feedback during an assessment task. We emphasise the coaching role of the teacher, and feedback designed to encourage students to monitor own learning. Large classes pose particular logistic problems. We identify staff development as a crucial factor for consistent, effective feedback, and point to web-based feedback provision as a workable solution to some logistic problems. We briefly discuss the role of information technology more broadly, both for learning enhancement and for automated feedback provision.\",\"keywords\":\"Education\",\"bibtex\":\"@InProceedings{Son-Tho_FIE04,\\n  author    = {Harald S{\\\\o}ndergaard and \\n\\t\\tDoreen Thomas},\\n  title     = {Effective Feedback to Small and Large Classes},\\n  booktitle = {Proceedings of the 2004 ASEE/IEEE Frontiers in\\n\\t\\tEducation Conference (FIE2004)},\\n  pages     = {F1E-9--F1E-14},\\n  location  = {Savannah GA},\\n  month     = {oct},\\n  year      = {2004},\\n  doi       = {10.1109/FIE.2004.1408573},\\n  abstract  = {Educational experts appear to be in broad agreement when it \\n\\t\\tcomes to the importance of feedback for effective learning.  \\n\\t\\tStudents benefit from plenty of opportunity and encouragement \\n\\t\\tto express their understanding, and from informed, supportive, \\n\\t\\tpossibly challenging, feedback. At the same time, we observe \\n\\t\\tthat many students at our university do not find that they \\n\\t\\treceive helpful feedback. One in three Engineering students \\n\\t\\tdisagree or strongly disagree with the Quality of Teaching \\n\\t\\tquestionnaire's ``I received helpful feedback on how I was \\n\\t\\tgoing'' in the individual course, and most other disciplines \\n\\t\\tfind themselves in a similar situation. For the university as \\n\\t\\ta whole, student responses to this question are clearly less \\n\\t\\tpositive than to other questions on quality of teaching,\\n\\t\\tintellectual stimulation, staff interest, workload, and so on,\\n\\t\\tand this state of affairs seems quite common in the Australian\\n\\t\\tcontext. We discuss best practice in feedback provision, partly\\n\\t\\tbased on our interviews with students and staff. We have been \\n\\t\\tparticularly interested in identifying cost-effective ways of \\n\\t\\tproviding informed and constructive feedback to large classes.\\n\\t\\tFeedback is often understood, by Engineering students and staff\\n\\t\\talike, simply as comments on submitted work---typically written\\n\\t\\tassignments. We argue in favour of a broader concept that \\n\\t\\tcovers a multitude of ways for a student to develop deep \\n\\t\\tlearning through conversation, including questions and answers\\n\\t\\tprovided by others, team work, study groups, and formative\\n\\t\\tteacher-provided feedback during an assessment task. We \\n\\t\\temphasise the coaching role of the teacher, and feedback \\n\\t\\tdesigned to encourage students to monitor own learning. Large \\n\\t\\tclasses pose particular logistic problems. We identify staff \\n\\t\\tdevelopment as a crucial factor for consistent, effective \\n\\t\\tfeedback, and point to web-based feedback provision as a \\n\\t\\tworkable solution to some logistic problems. We briefly discuss\\n\\t\\tthe role of information technology more broadly, both for \\n\\t\\tlearning enhancement and for automated feedback provision.},\\n  keywords  = {Education},\\n}\\n\\n\",\"author_short\":[\"Søndergaard, H.\",\"Thomas, D.\"],\"key\":\"Son-Tho_FIE04\",\"id\":\"Son-Tho_FIE04\",\"bibbaseid\":\"sndergaard-thomas-effectivefeedbacktosmallandlargeclasses-2004\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Chris\"],\"propositions\":[],\"lastnames\":[\"Speirs\"],\"suffixes\":[]},{\"firstnames\":[\"Zoltan\"],\"propositions\":[],\"lastnames\":[\"Somogyi\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]}],\"title\":\"Termination Analysis for Mercury\",\"editor\":[{\"firstnames\":[\"P.\"],\"propositions\":[],\"lastnames\":[\"Van Hentenryck\"],\"suffixes\":[]}],\"booktitle\":\"Static Analysis: Proceedings of the Fourth International Symposium\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"1302\",\"pages\":\"157–171\",\"publisher\":\"Springer\",\"year\":\"1997\",\"doi\":\"10.1007/bfb0032740\",\"abstract\":\"Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, the practical significance of much of this work is hard to judge, since experimental evaluations rarely get published. Here we describe and evaluate a termination analyzer for Mercury, a strongly typed and moded logic-functional programming language. Mercury's high degree of referential transparency and the guaranteed availability of reliable mode information simplify termination analysis. Our analyzer uses a variant of a method developed by Plümer. It deals with full Mercury, including modules and I/O. In spite of these obstacles, it produces state-of-the-art termination information, while having a negligible impact on the running time of the compiler of which it is part, even for large programs.\",\"keywords\":\"Logic programming, Mercury, Termination analysis\",\"bibtex\":\"@Inproceedings{Spe-Som-Son_SAS97,\\n  author    = {Chris Speirs and \\n\\t\\tZoltan Somogyi and \\n\\t\\tHarald S{\\\\o}ndergaard},\\n  title     = {Termination Analysis for {Mercury}},\\n  editor    = {P. {Van Hentenryck}},\\n  booktitle = {Static Analysis: \\n\\t\\tProceedings of the Fourth International Symposium},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {1302},\\n  pages     = {157--171},\\n  publisher = {Springer},\\n  year      = {1997},\\n  doi       = {10.1007/bfb0032740},\\n  abstract  = {Since the late eighties, much progress has been made in the \\n\\t\\ttheory of termination analysis for logic programs. However, the\\n\\t\\tpractical significance of much of this work is hard to judge, \\n\\t\\tsince experimental evaluations rarely get published. Here we \\n\\t\\tdescribe and evaluate a termination analyzer for Mercury, a \\n\\t\\tstrongly typed and moded logic-functional programming language.\\n\\t\\tMercury's high degree of referential transparency and the \\n\\t\\tguaranteed availability of reliable mode information simplify \\n\\t\\ttermination analysis. Our analyzer uses a variant of a method \\n\\t\\tdeveloped by Pl{\\\\\\\"u}mer. It deals with full Mercury, including \\n\\t\\tmodules and I/O. In spite of these obstacles, it produces \\n\\t\\tstate-of-the-art termination information, while having a \\n\\t\\tnegligible impact on the running time of the compiler of which\\n\\t\\tit is part, even for large programs.},\\n  keywords  = {Logic programming, Mercury, Termination analysis},\\n}\\n\\n\",\"author_short\":[\"Speirs, C.\",\"Somogyi, Z.\",\"Søndergaard, H.\"],\"editor_short\":[\"Van Hentenryck, P.\"],\"key\":\"Spe-Som-Son_SAS97\",\"id\":\"Spe-Som-Son_SAS97\",\"bibbaseid\":\"speirs-somogyi-sndergaard-terminationanalysisformercury-1997\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Logic programming\",\"Mercury\",\"Termination analysis\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Linda\"],\"propositions\":[],\"lastnames\":[\"Stern\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Lee\"],\"propositions\":[],\"lastnames\":[\"Naish\"],\"suffixes\":[]}],\"title\":\"A Strategy for Managing Content Complexity in Algorithm Animation\",\"editor\":[{\"firstnames\":[\"B.\"],\"propositions\":[],\"lastnames\":[\"Manaris\"],\"suffixes\":[]}],\"booktitle\":\"Proceedings of the Fourth Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education\",\"pages\":\"127–130\",\"publisher\":\"Association for Computing Machinery\",\"address\":\"New York, NY\",\"year\":\"1999\",\"location\":\"Cracow, Poland\",\"doi\":\"10.1145/305786.305891\",\"abstract\":\"Computer animation is an excellent medium for capturing the dynamic nature of data structure manipulations, and can be used to advantage in the teaching of algorithms and data structures. A major educational issue is the necessity of providing a means for the student to manage the complexity of the material. We have addressed this issue in a multimedia teaching tool called ``Algorithms in Action'' by allowing students to view an algorithm at varying levels of detail. Starting with a high level pseudocode description of the algorithm, with accompanying high level animation and textual explanation, students can expand sections of the pseudocode to expose more detail. Animation and explanation are controlled in coordinate fashion, becoming correspondingly more detailed as the pseudocode is expanded. Student feedback suggests that the availability of multiple levels detail and the facility for the user to control the level of detail being viewed is an effective way to manage content complexity.\",\"keywords\":\"Education, Algorithm visualisation, Web-based learning\",\"bibtex\":\"@InProceedings{Ste-Son-Nai_ITiCSE99,\\n  author    = {Linda Stern and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tLee Naish},\\n  title     = {A Strategy for Managing Content Complexity in\\n\\t\\tAlgorithm Animation},\\n  editor    = {B. Manaris},\\n  booktitle = {Proceedings of the Fourth Annual SIGCSE/SIGCUE Conference on\\n\\t\\tInnovation and Technology in Computer Science Education},\\n  pages     = {127--130},\\n  publisher = {Association for Computing Machinery},\\n  address   = {New York, NY},\\n  year      = {1999},\\n  location  = {Cracow, Poland},\\n  doi       = {10.1145/305786.305891},\\n  abstract  = {Computer animation is an excellent medium for capturing \\n\\t\\tthe dynamic nature of data structure manipulations, and \\n\\t\\tcan be used to advantage in the teaching of algorithms \\n\\t\\tand data structures. A major educational issue is the \\n\\t\\tnecessity of providing a means for the student to manage \\n\\t\\tthe complexity of the material. We have addressed this\\n\\t\\tissue in a multimedia teaching tool called ``Algorithms in\\n\\t\\tAction'' by allowing students to view an algorithm at \\n\\t\\tvarying levels of detail. Starting with a high level \\n\\t\\tpseudocode description of the algorithm, with accompanying \\n\\t\\thigh level animation and textual explanation, students can \\n\\t\\texpand sections of the pseudocode to expose more detail.\\n\\t\\tAnimation and explanation are controlled in coordinate\\n\\t\\tfashion, becoming correspondingly more detailed as the \\n\\t\\tpseudocode is expanded. Student feedback suggests that the\\n\\t\\tavailability of multiple levels detail and the facility\\n\\t\\tfor the user to control the level of detail being viewed\\n\\t\\tis an effective way to manage content complexity.},\\n  keywords  = {Education, Algorithm visualisation, Web-based learning},\\n}\\n\\n\",\"author_short\":[\"Stern, L.\",\"Søndergaard, H.\",\"Naish, L.\"],\"editor_short\":[\"Manaris, B.\"],\"key\":\"Ste-Son-Nai_ITiCSE99\",\"id\":\"Ste-Son-Nai_ITiCSE99\",\"bibbaseid\":\"stern-sndergaard-naish-astrategyformanagingcontentcomplexityinalgorithmanimation-1999\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"Education\",\"Algorithm visualisation\",\"Web-based learning\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"inproceedings\",\"type\":\"inproceedings\",\"author\":[{\"firstnames\":[\"Wenxi\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"A Bit-Vector Solver with Word-Level Propagation\",\"editor\":[{\"firstnames\":[\"C.-G.\"],\"propositions\":[],\"lastnames\":[\"Quimper\"],\"suffixes\":[]}],\"booktitle\":\"Integration of AI and OR Techniques in Constraint Programming: Proceedings of the 13th International Conference\",\"series\":\"Lecture Notes in Computer Science\",\"volume\":\"9676\",\"pages\":\"374–391\",\"publisher\":\"Springer International Publishing\",\"year\":\"2016\",\"isbn\":\"978-3-319-33953-5\",\"doi\":\"10.1007/978-3-319-33954-2_27\",\"abstract\":\"Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have proposed an interesting approach to bit-vector constraint propagation on the word level. Each of the operations except comparison are constant time, assuming the bit-vector fits in a machine word. In contrast, bit-vector SMT solvers usually solve bit-vector problems by bit-blasting, that is, mapping the resulting operations to conjunctive normal form clauses, and using SAT technology to solve them. This also means generating intermediate variables which can be an advantage, as these can be searched on and learnt about. Since each approach has advantages it is important to see whether we can benefit from these advantages by using a word-level propagation approach with learning. In this paper we describe an approach to bit-vector solving using word-level propagation with learning. We provide alternative word-level propagators to Michel and Van Hentenryck, and give the first empirical evaluation of their approach that we are aware of. We show that, with careful engineering, a word-level propagation based approach can compete with (or complement) bit-blasting.\",\"keywords\":\"SMT solving, Constraint propagation, Program verification\",\"bibtex\":\"@inproceedings{Wan-Son-Stu_CPAIOR16,\\n  author    = {Wenxi Wang and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {A Bit-Vector Solver with Word-Level Propagation},\\n  editor    = {C.-G. Quimper},\\n  booktitle = {Integration of AI and OR Techniques in Constraint Programming:\\n                Proceedings of the 13th International Conference},\\n  series    = {Lecture Notes in Computer Science},\\n  volume    = {9676},\\n  pages     = {374--391},\\n  publisher = {Springer International Publishing},\\n  year      = {2016},\\n  isbn      = {978-3-319-33953-5},\\n  doi       = {10.1007/978-3-319-33954-2_27},\\n  abstract  = {Reasoning with bit-vectors arises in a variety of \\n\\t\\tapplications in verification and cryptography. \\n\\t\\tMichel and Van Hentenryck have proposed an interesting \\n\\t\\tapproach to bit-vector constraint propagation on the \\n\\t\\tword level. Each of the operations except comparison \\n\\t\\tare constant time, assuming the bit-vector fits in a \\n\\t\\tmachine word. In contrast, bit-vector SMT solvers \\n\\t\\tusually solve bit-vector problems by bit-blasting, \\n\\t\\tthat is, mapping the resulting operations to conjunctive \\n\\t\\tnormal form clauses, and using SAT technology to solve \\n\\t\\tthem. This also means generating intermediate variables \\n\\t\\twhich can be an advantage, as these can be searched on \\n\\t\\tand learnt about. Since each approach has advantages \\n\\t\\tit is important to see whether we can benefit from \\n\\t\\tthese advantages by using a word-level propagation \\n\\t\\tapproach with learning. In this paper we describe an \\n\\t\\tapproach to bit-vector solving using word-level \\n\\t\\tpropagation with learning. We provide alternative \\n\\t\\tword-level propagators to Michel and Van Hentenryck, \\n\\t\\tand give the first empirical evaluation of their approach\\n\\t\\tthat we are aware of. We show that, with careful \\n\\t\\tengineering, a word-level propagation based approach \\n\\t\\tcan compete with (or complement) bit-blasting.},\\n  keywords  = {SMT solving, Constraint propagation, Program verification},\\n}\\n\\n\",\"author_short\":[\"Wang, W.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"editor_short\":[\"Quimper, C.\"],\"key\":\"Wan-Son-Stu_CPAIOR16\",\"id\":\"Wan-Son-Stu_CPAIOR16\",\"bibbaseid\":\"wang-sndergaard-stuckey-abitvectorsolverwithwordlevelpropagation-2016\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"SMT solving\",\"Constraint propagation\",\"Program verification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"},{\"bibtype\":\"article\",\"type\":\"article\",\"author\":[{\"firstnames\":[\"Wenxi\"],\"propositions\":[],\"lastnames\":[\"Wang\"],\"suffixes\":[]},{\"firstnames\":[\"Harald\"],\"propositions\":[],\"lastnames\":[\"Søndergaard\"],\"suffixes\":[]},{\"firstnames\":[\"Peter\",\"J.\"],\"propositions\":[],\"lastnames\":[\"Stuckey\"],\"suffixes\":[]}],\"title\":\"Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation\",\"journal\":\"Journal of Automated Reasoning\",\"volume\":\"63\",\"number\":\"3\",\"pages\":\"723–762\",\"year\":\"2019\",\"doi\":\"10.1007/s10817-018-9493-1\",\"abstract\":\"We develop an idea originally proposed by Michel and Van Hentenryck of how to perform bit-vector constraint propagation on the word level. Most operations are propagated in constant time, assuming the bit-vector fits in a machine word. In contrast, bit-vector SMT solvers usually solve bit-vector problems by (ultimately) bit-blasting, that is, mapping the resulting operations to conjunctive normal form clauses, and using SAT technology to solve them. Bit-blasting generates intermediate variables which can be an advantage, as these can be searched on and learnt about. As each approach has advantages, it makes sense to try to combine them. In this paper, we describe an approach to bit-vector solving using word-level propagation with learning. We have designed alternative word-level propagators to Michel and Van Hentenryck's, and evaluated different variants of the approach. We have also experimented with different approaches to learning and back-jumping in the solver. Based on the insights gained, we have built a portfolio solver, Wombit, which essentially extends the STP bit-vector solver. Using machine learning techniques, the solver makes a judicious up-front decision about whether to use word-level propagation or fall back on bit-blasting.\",\"keywords\":\"SMT solving, Constraint propagation, Program verification\",\"bibtex\":\"@article{Wan-Son-Stu_JAR19,\\n  author    = {Wenxi Wang and \\n\\t\\tHarald S{\\\\o}ndergaard and \\n\\t\\tPeter J. Stuckey},\\n  title     = {Wombit: A Portfolio Bit-Vector Solver Using Word-Level \\n\\t\\tPropagation},\\n  journal   = {Journal of Automated Reasoning},\\n  volume    = {63},\\n  number    = {3},\\n  pages     = {723--762},\\n  year      = {2019},\\n  doi       = {10.1007/s10817-018-9493-1},\\n  abstract  = {We develop an idea originally proposed by Michel and Van \\n\\t\\tHentenryck of how to perform bit-vector constraint propagation \\n\\t\\ton the word level. Most operations are propagated in constant \\n\\t\\ttime, assuming the bit-vector fits in a machine word.\\n\\t\\tIn contrast, bit-vector SMT solvers usually solve bit-vector \\n\\t\\tproblems by (ultimately) bit-blasting, that is, mapping the \\n\\t\\tresulting operations to conjunctive normal form clauses, and \\n\\t\\tusing SAT technology to solve them. Bit-blasting generates \\n\\t\\tintermediate variables which can be an advantage, as these can \\n\\t\\tbe searched on and learnt about. As each approach has \\n\\t\\tadvantages, it makes sense to try to combine them. In this \\n\\t\\tpaper, we describe an approach to bit-vector solving using\\n\\t\\tword-level propagation with learning. We have designed \\n\\t\\talternative word-level propagators to Michel and Van \\n\\t\\tHentenryck's, and evaluated different variants of the approach.\\n\\t\\tWe have also experimented with different approaches to learning\\n\\t\\tand back-jumping in the solver. Based on the insights gained, \\n\\t\\twe have built a portfolio solver, Wombit, which essentially \\n\\t\\textends the STP bit-vector solver. Using machine learning \\n\\t\\ttechniques, the solver makes a judicious up-front decision \\n\\t\\tabout whether to use word-level propagation or fall back on \\n\\t\\tbit-blasting.},\\n  keywords  = {SMT solving, Constraint propagation, Program verification},\\n}\\n\\n\",\"author_short\":[\"Wang, W.\",\"Søndergaard, H.\",\"Stuckey, P. J.\"],\"key\":\"Wan-Son-Stu_JAR19\",\"id\":\"Wan-Son-Stu_JAR19\",\"bibbaseid\":\"wang-sndergaard-stuckey-wombitaportfoliobitvectorsolverusingwordlevelpropagation-2019\",\"role\":\"author\",\"urls\":{},\"keyword\":[\"SMT solving\",\"Constraint propagation\",\"Program verification\"],\"metadata\":{\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\"html\":\"\"}],\n      metadata: {\"owner\":\"søndergaard, h\",\"authorlinks\":{\"søndergaard, h\":\"https://people.eng.unimelb.edu.au/harald/\"}},\n      ownerID: \"xRGNR7myrRQ8QKMfY\"\n    };\n  </script>\n\n  <script type=\"text/javascript\">\n  var site$;\n  if (typeof $ != 'undefined') {\n    console.log('existing jquery: storing and then restoring');\n    site$ = $;\n    $ = null;\n  }\n  </script>\n\n  <script src=\"https://ajax.googleapis.com/ajax/libs/jquery/2.2.4/jquery.min.js\">\n  </script>\n  <script type=\"text/javascript\">\n  if (site$) {\n    console.log('existing jquery: avoiding conflict and restoring');\n    bb$ = $.noConflict(true);\n    $ = site$;\n  } else {\n    bb$ = $;\n  }\n  </script>\n\n  <script src=\"//bibbase.org/js/bibbase.min.js\"\n          type=\"text/javascript\">\n  </script>\n\n  <script type=\"text/javascript\"\n          src=\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML\">\n  </script>\n  <script type=\"text/x-mathjax-config\">\n    MathJax.Hub.Config({tex2jax: {inlineMath: [['$','$'], ['\\\\(','\\\\)']]},\n                        skipTags: [\"body\"],\n                        processClass: \"bibbase_paper\"});\n  </script>\n\n  <style>\n  @media print {\n    .dontprint {\n        display: none !important;\n    }\n\n  .bibbase_group {\n    background-color: #E0E0E0;\n    font-style: italic;\n    font-size: larger;\n    text-shadow: 0px 0px 3px #FFFFFF;\n    border-radius: 4px 4px 4px 4px;\n    -moz-border-radius: 4px 4px 4px 4px;\n    -webkit-border-radius: 4px;\n    padding: 5px 40px 5px;\n    margin-top: 10px;\n    margin-bottom: 5px;\n    cursor: pointer;\n  }\n\n  .bibbase_paper {\n    margin-bottom: 5px;\n  }\n\n  }\n  </style>\n\n  \n  <div style=\"float: right; margin-right: 10px; margin-top: 10px; text-align: right; font-size: 12px\">\n    generated by\n    <a href=\"//bibbase.org\"\n       onclick=\"trackOutboundLink('bibbase', 'logo clicked', window.location.href, '//bibbase.org'); return false;\">\n      <img src=\"//bibbase.org/img/logo.svg\"\n           style=\"vertical-align: middle; margin-left: 3px; height: 16px;\"/\n           alt=\"bibbase.org\"\n           title=\"BibBase – The easiest way to maintain your publications page.\"\n        ></a>\n    \n  </div>\n  \n\n  <div id=\"bibbase_header\" class=\"dontprint\" style=\"\">\n\n    <ul class=\"nav nav-pills\" style=\"margin: 0px;\">\n\n      <li class=\"dropdown\" id=\"groupby_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\">\n          Group by\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li class=\"groupby year\"><a onclick=\"groupby('year')\">\n            Year</a>\n        </li>\n        <li class=\"groupby author\"><a onclick=\"groupby('author_short')\">\n            Author</a>\n        </li>\n        <li class=\"groupby type\"><a onclick=\"groupby('type')\">\n            Type</a>\n        </li>\n        <li class=\"groupby keyword\"><a onclick=\"groupby('keyword')\">\n            Keyword</a>\n        </li>\n        <li class=\"groupby downloads\"><a onclick=\"groupby('downloads')\">\n            Downloads</a>\n        </li>\n      </ul>\n      </li>\n\n\n      <li class=\"dropdown\" id=\"menu_dropdown\">\n      <a class=\"dropdown-toggle\"\n         data-toggle=\"dropdown\"\n         href=\"#\" alt=\"controls\">\n          <i class=\"fa fa-reorder\" alt=\"controls\"></i>\n          <b class=\"caret\"></b>\n      </a>\n      <ul class=\"dropdown-menu\">\n        <li>\n          <a onclick=\"toggleAll()\">\n            <i class=\"fa fa-chevron-down fa-fw\"></i> Expand/Collapse All\n          </a>\n        </li>\n        <li>\n          <a download=\"bibbase.bib\" href=\"data:text/bibtex;base64,@inproceedings{Ala-Mil-Son_ASWEC15,
  author    = {Eman Alatawi and 
		Tim Miller and 
		Harald S{\o}ndergaard},
  title     = {Using Metamorphic Testing to Improve Dynamic Symbolic Execution},
  booktitle = {Proceedings of the 24th Australasian Software Engineering
                Conference (ASWEC 2015)},
  pages     = {38--47},
  publisher = {IEEE Computing Society},
  year      = {2015},
  doi       = {10.1109/ASWEC.2015.16},
  abstract  = {Dynamic symbolic execution (DSE) is an approach for automatically
		generating test inputs from source code using constraint 
		information. It is used in \emph{fuzzing}: the execution of 
		tests while monitoring for generic properties such as buffer 
		overflows and other security violations. Limitations of DSE for
		fuzzing are two-fold: (1) only generic properties are checked: 
		many deviations from specified behaviour are not found; and 
		(2) many programs are not entirely amenable to DSE because they
		give rise to hard constraints, so that some parts of a program 
		remain uncovered. In this paper, we discuss how to mitigate 
		these problems using \emph{metamorphic testing} (MT). 
		Metamorphic testing uses domain-specific properties about 
		program behaviour, relating pairs of inputs to pairs of outputs.
		From a given test suite, \emph{follow-up tests inputs} are 
		generated, and their outputs are compared to outputs from the 
		original tests, using \emph{metamorphic relations}. Our 
		hypothesis is that using metamorphic testing increases the 
		ability of a DSE test suite to find faults, and that the 
		follow-up tests execute some previously-uncovered segments. 
		We have experimented with seven small but non-trivial libraries,
		comparing DSE test suites with DSE+MT test suites, demonstrating
		that DSE+MT test suites improve coverage marginally, but find 
		more faults.},
  keywords  = {Symbolic execution, Testing},
}



@inproceedings{Ala-Mil-Son_ASWEC18,
  author    = {Eman Alatawi and 
		Tim Miller and 
		Harald S{\o}ndergaard},
  title     = {Symbolic Execution with Invariant Inlay:
                Evaluating the Potential},
  booktitle = {Proceedings of the 25th Australasian Software Engineering
                Conference (ASWEC 2018)},
  pages     = {26--30},
  publisher = {IEEE Computing Society},
  year      = {2018},
  doi       = {10.1109/ASWEC.2018.00012},
  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve},
  abstract  = {Dynamic symbolic execution (DSE) is a non-standard execution 
		mechanism which, loosely, executes a program symbolically and, 
		simultaneously, on concrete input. DSE is attractive because of
		several uses in software engineering, including the generation
		of test data suites with large coverage relative to test suite
		size. However, DSE struggles in the face of execution path 
		explosion, and is often unable to cover certain kinds of 
		difficult-to-reach program points. Invariant inlay is a 
		technique that aims to improve a DSE tool by interspersing code
		with invariants, generated automatically using off-the-shelf 
		tools for static program analysis. To capitalise fully on a 
		static analyzer, invariant inlay first applies certain 
		testability transformations to the program source. In this 
		paper we account for how we have evaluated the idea 
		experimentally, in order to determine its usefulness for
		programs with complex control flow.},
  keywords  = {Symbolic execution, Static analysis},
}



@inproceedings{Ala-Mil-Son_MET16,
  author    = {Eman Alatawi and 
		Tim Miller and 
		Harald S{\o}ndergaard},
  title     = {Generating Source Inputs for Metamorphic Testing
                Using Dynamic Symbolic Execution},
  booktitle = {MET'16: Proceedings of the First International Workshop on
                Metamorphic Testing},
  pages     = {19--25},
  publisher = {ACM},
  year      = {2016},
  doi       = {10.1145/2896971.2896980},
  isbn      = {978-1-4503-4163-9},
  abstract  = {Metamorphic testing uses domain-specific properties about
                a program's intended behaviour to alleviate the oracle
                problem. From a given set of source test inputs, a set of
                follow-up test inputs are generated which have some
                relation to the source inputs, and their outputs are
                compared to outputs from the source tests, using
                metamorphic relations.  We evaluate the use of an
                automated test input generation technique called dynamic
                symbolic execution (DSE) to generate the source test
                inputs for metamorphic testing. We investigate whether
                DSE increases source-code coverage and fault finding
                effectiveness of metamorphic testing compared to the use
                of random testing, and whether the use of metamorphic
                relations as a supportive technique improves the test
                inputs generated by DSE. Our results show that DSE
                improves the coverage and fault detection rate of
                metamorphic testing compared to random testing using
                significantly smaller test suites, and the use of
                metamorphic relations increases code coverage of both
                DSE and random tests considerably, but the improvement
                in the fault detection rate may be marginal and depends
                on the used metamorphic relations.},
  keywords  = {Symbolic execution, Testing},
}



@inproceedings{Ala-Son-Mil_ASE17,
  author    = {Eman Alatawi and 
		Harald S{\o}ndergaard and
		Tim Miller},
  title     = {Leveraging Abstract Interpretation for Efficient Dynamic 
		Symbolic Execution},
  editor    = {G. Rosu and  M. {Di Penta} and T. N. Nguyen},
  booktitle = {Proceedings of the 32nd ACM/IEEE International Conference on 
		Automated Software Engineering},
  pages     = {619--624},
  publisher = {IEEE Computing Society},
  year      = {2017},
  doi       = {10.1109/ASE.2017.8115672},
  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve},
  abstract  = {Dynamic Symbolic Execution (DSE) is a technique to automatically
		generate test inputs by executing the program simultaneously 
		with concrete and symbolic values. A key challenge in DSE is 
		scalability, as executing all feasible program paths is not 
		possible, owing to the possibly exponential or infinite number 
		of program paths. Loops, in particular those where the number 
		of iterations depends on an input of the program, are a source 
		of path explosion. They cause problems because DSE maintains 
		symbolic values that capture only the data dependencies on
		symbolic inputs. This ignores control dependencies, including 
		loop dependencies that depend indirectly on the inputs. We 
		propose a method to increase the coverage achieved by DSE in 
		the presence of input-data dependent loops and loop dependent 
		branches. We combine DSE with abstract interpretation to find 
		indirect control dependencies, including loop and branch 
		indirect dependencies. Preliminary results show that this 
		results in better coverage, within considerably less time 
		compared to standard DSE.},
  keywords  = {Symbolic execution, Static analysis, Abstract interpretation},
}



@inproceedings{Ama-And-Gan-Sch-Son-Stu_CPAIOR19,
  author    = {Roberto Amadini and 
		Mak Andrlon and 
		Graeme Gange and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Constraint Programming for Dynamic Symbolic Execution of
                {JavaScript}},
  editor    = {L.-M. Rousseau and K. Stergiou},
  booktitle = {Integration of Constraint Programming, Artificial Intelligence,
		and Operations Research: Proceedings of the 16th International
		Conference (CPAIOR 2019)},
  series    = {Lecture Notes in Computer Science},
  volume    = {11494}, 
  pages     = {1--19},
  year      = {2019},
  doi       = {10.1007/978-3-030-19212-9_1},
  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve},
  abstract  = {Dynamic Symbolic Execution (DSE) combines concrete and symbolic 
		execution, usually for the purpose of generating good test 
		suites automatically.  It relies on constraint solvers to solve
		path conditions and to generate new inputs to explore. DSE 
		tools usually make use of SMT solvers for constraint solving.
		In this paper, we show that constraint programming (CP) is a
		powerful alternative or complementary technique for DSE.
		Specifically, we apply CP techniques for DSE of JavaScript, the
		de facto standard for web programming. We capture the JavaScript
		semantics with MiniZinc and integrate this approach into a tool
		we call \textsc{Aratha}. We use \textsc{G-Strings}, a CP solver
		equipped with string variables, for solving path conditions, 
		and we compare the performance of this approach against 
		state-of-the-art SMT solvers. Experimental results, in terms of
		both speed and coverage, show the benefits of our approach,
		thus opening new research vistas for using CP techniques in 
		the service of program analysis.},
  keywords  = {Symbolic execution, Constraint programming, String solvers, JavaScript},
}



@Article{Ama-Gan-Gau-Jor-Sch-Son-Stu-Zha_FI18,
  author    = {Roberto Amadini and 
		Graeme Gange and 
		Fran{\c{c}}ois Gauthier and
		Alexander Jordan and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey and
		Chenyi Zhang},
  title     = {Reference Abstract Domains and Applications to String Analysis},
  journal   = {Fundamenta Informaticae},
  volume    = {158},
  number    = {4},
  pages     = {297--326},
  year      = {2018},
  doi       = {10.3233/FI-2018-1650},
  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve},
  abstract  = {Abstract interpretation is a well established theory that 
		supports reasoning about the run-time behaviour of programs.
		It achieves tractable reasoning by considering abstractions of
		run-time states, rather than the states themselves. The chosen
		set of abstractions is referred to as the abstract domain.
		We develop a novel framework for combining (a possibly large 
		number of) abstract domains. It achieves the effect of the 
		so-called reduced product without requiring a quadratic number
		of functions to translate information among abstract domains. A
		central notion is a reference domain, a medium for information
		exchange. Our approach suggests a novel and simpler way to 
		manage the integration of large numbers of abstract domains.
		We instantiate our framework in the context of string analysis.
		Browser-embedded dynamic programming languages such as 
		JavaScript and PHP encourage the use of strings as a universal
		data type for both code and data values. The ensuing 
		vulnerabilities have made string analysis a focus of much
		recent research. String analysis tends to combine many 
		elementary string abstract domains, each designed to capture 
		a specific aspect of strings. For this instance the set of 
		regular languages, while too expensive to use directly for 
		analysis, provides an attractive reference domain, enabling 
		the efficient simulation of reduced products of multiple
		string abstract domains.},
  keywords  = {String analysis, Abstract interpretation},
}



@inproceedings{Ama-Gan-Sch-Son-Stu_DIPL20,
  author    = {Roberto Amadini and 
		Graeme Gange and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey}, 
  title     = {Abstract Interpretation, Symbolic Execution and Constraints},
  editor    = {F. S. {de Boer} and J. Mauro},
  booktitle = {Recent Developments in the Design and Implementation of 
		Programming Languages},
  series    = {OpenAccess Series in Informatics},
  volume    = {86}, 
  pages     = {7:1--7:19},
  publisher = {Schloss Dagstuhl-Leibniz-Zentrum f{\"u}r Informatik},
  year      = {2020},
  doi       = {10.4230/OASIcs.Gabbrielli.2020.7},
  url_Paper = {https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf},
  abstract  = {Abstract interpretation is a static analysis framework for 
		sound over-approximation of all possible runtime states of 
		a program. Symbolic execution is a framework for reachability
		analysis which tries to explore all possible execution paths 
		of a program. A shared feature between abstract interpretation
		and symbolic execution is that each---implicitly or 
		explicitly---maintains constraints during execution, 
		in the form of invariants or path conditions.
		We investigate the relations between the worlds of abstract 
		interpretation, symbolic execution and constraint solving, 
		to expose potential synergies.},
  keywords  = {Constraint programming, Symbolic execution, Abstract interpretation},
}



@inproceedings{Ama-Gan-Sch-Son-Stu_ECAI20,
  author    = {Roberto Amadini and 
		Graeme Gange and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey}, 
  title     = {String Constraint Solving: Past, Present and Future},
  editor    = {G. {De Giacomo} and others},
  booktitle = {Proceedings of the 24th European Conference on 
		Artificial Intelligence},
  pages     = {2875--2876},
  publisher = {IOS Press},
  year      = {2020},
  doi       = {10.3233/FAIA200431},
  url_Paper = {https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431},
  abstract  = {String constraint solving is an important emerging field, 
		given the ubiquity of strings over different fields such as
		formal analysis, automated testing, database query processing,
		and cybersecurity. This paper highlights the current 
		state-of-the-art for string constraint solving, and 
		identifies future challenges in this field.},
  keywords  = {String solvers},
}



@inproceedings{Ama-Gan-Sch-Son-Stu_LOPSTR20,
  author    = {Roberto Amadini and 
		Graeme Gange and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey}, 
  title     = {Algorithm Selection for Dynamic Symbolic Execution: 
		A Preliminary Study},
  editor    = {M. Fern{\'a}ndez},
  booktitle = {Logic-Based Program Synthesis and Transformation},
  series    = {Lecture Notes in Computer Science},
  volume    = {12561}, 
  pages     = {192--209},
  year      = {2020},
  doi       = {10.1007/978-3-030-68446-4_10},
  abstract  = {Given a portfolio of algorithms, the goal of Algorithm Selection
		(\textsf{AS}) is to select the best algorithm(s) for a new, 
		unseen problem instance. Dynamic Symbolic Execution 
		(\textsf{DSE}) brings together concrete and symbolic execution 
		to maximise the program coverage. \textsf{DSE} uses a 
		constraint solver to solve the path conditions and generate 
		new inputs to explore. In this paper we join these lines of 
		research by introducing a model that combines \textsf{DSE} and
		\textsf{AS} approaches. The proposed \textsf{AS/DSE} model is 
		a generic and flexible framework enabling the \dse engine to 
		solve the path conditions it collects with a portfolio of 
		different solvers, by exploiting and extending the well-known
		\textsf{AS} techniques that have been developed over the last 
		decade. In this way, one can increase the coverage and 
		sometimes even outperform the aggregate coverage achievable 
		by running simultaneously all the solvers of the portfolio.},
  keywords  = {Symbolic execution},
}



@InProceedings{Ama-Jor-Gan-Gau-Sch-Son-Stu-Zha_TACAS17,
  author    = {Roberto Amadini and 
		Alexander Jordan and 
		Graeme Gange and 
		Fran{\c{c}}ois Gauthier and
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey and
		Chenyi Zhang},
  title     = {Combining String Abstract Domains for {JavaScript} Analysis: 
		An Evaluation},
  editor    = {A. Legay and T. Margaria},
  booktitle = {TACAS 2017: Proceedings of the 23rd International
		Conference on Tools and Algorithms for the Construction 
		and Analysis of Systems},
  series    = {Lecture Notes in Computer Science},
  volume    = {10205},
  pages     = {41--57},
  publisher = {Springer},
  year      = {2017},
  doi       = {10.1007/978-3-662-54577-5_3},
  abstract  = {Strings play a central role in JavaScript and similar scripting
		languages. Owing to dynamic features such as the eval function
		and dynamic property access, precise string analysis is a 
		prerequisite for automated reasoning about practically any 
		kind of runtime property. Although the literature presents 
		a considerable number of abstract domains for capturing and 
		representing specific aspect of strings, we are not aware of 
		tools that allow flexible combination of string abstract 
		domains. Indeed, support for string analysis is often confined
		to a single, dedicated string domain. In this paper we 
		describe a framework that allows us to combine multiple string
		abstract domains for the analysis of JavaScript programs. 
		It is implemented as an extension of SAFE, an open-source 
		static analysis tool. We investigate different combinations 
		of abstract domains that capture various aspects of strings.
		Our evaluation suggests that a combination of few, simple 
		abstract domains suffice to outperform the precision of 
		state-of-the-art static analysis tools for JavaScript.},
  keywords  = {String solvers, Abstract domains, Abstract interpretation, JavaScript},
}



@Inproceedings{And-Sch-Son-Stu_ARITH19,
  author    = {Mak Andrlon and
		Peter Schachte and
		Harald S{\o}ndergaard and
		Peter J. Stuckey},
  title     = {Optimal Bounds for Floating-Point Addition in Constant Time},
  editor    = {N. Takagi and S. Boldo and M. Langhammer},
  booktitle = {Proceedings of the 26th IEEE Symposium on Computer Arithmetic 
		(ARITH 2019)},
  pages     = {159--166},
  publisher = {IEEE Conf. Publ.},
  year      = {2019},
  doi       = {10.1109/arith.2019.00038},
  abstract  = {Reasoning about floating-point numbers is notoriously difficult,
		owing to the lack of convenient algebraic properties such as 
		associativity. This poses a substantial challenge for program 
		analysis and verification tools which rely on precise 
		floating-point constraint solving. Currently, interval methods 
		in this domain often exhibit slow convergence even on simple 
		examples. We present a new theorem supporting efficient 
		computation of exact bounds of the intersection of a rectangle 
		with the preimage of an interval under floating-point addition,
		in any radix or rounding mode. We thus give an efficient method
		of deducing optimal bounds on the components of an addition, 
		solving the convergence problem.},
  keywords  = {Constraint solving, Machine arithmetic},
}



@Inproceedings{Arm-Mar-Sch-Son_SAS94,
  author    = {Tania Armstrong and 
		Kim Marriott and 
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {{Boolean} Functions for Dependency Analysis:
		Algebraic Properties and Efficient Representation},
  editor    = {B. {Le Charlier}},
  booktitle = {Static Analysis: Proceedings of the First International 
		Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {864},
  pages     = {266--280},
  publisher = {Springer-Verlag},
  year      = {1994},
  doi       = {10.1007/3-540-58485-4_46},
  abstract  = {Many analyses for logic programming languages use Boolean 
		functions to express dependencies between variables or argument
		positions. Examples include groundness analysis, arguably the 
		most important analysis for logic programs, finiteness analysis 
	      	and functional dependency analysis. We identify two classes of 
		Boolean functions that have been used: positive and definite 
		functions, and we systematically investigate these classes and 
		their efficient implementation for dependency analyses. We 
		provide syntactic characterizations and study their algebraic 
		properties. In particular, we show that both classes are closed
		under existential quantification. We investigate representations
		for these classes based on: reduced ordered binary decision 
		diagrams (ROBDDs), disjunctive normal form, conjunctive normal 
		form, Blake canonical form, dual Blake canonical form, and a 
		form specific to definite functions. We give an  empirical 
		comparison of these different representations for groundness 
		analysis.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}



@Article{Arm-Mar-Sch-Son_SCP98,
  author   = {Tania Armstrong and 
		Kim Marriott and 
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title	   = {Two Classes of {Boolean} Functions for Dependency Analysis},
  journal  = {Science of Computer Programming},
  volume   = {31},
  number   = {1},
  pages    = {3--45},
  year	   = {1998},
  doi       = {10.1016/S0167-6423(96)00039-1},
  abstract = {Many static analyses for declarative programming/database 
		languages use Boolean functions to express dependencies 
		among variables or argument positions. Examples include 
		groundness analysis, arguably the most important analysis for 
		logic programs, finiteness analysis and functional dependency 
		analysis for databases. We identify two classes of Boolean 
		functions that have been used: positive and definite functions,
		and we systematically investigate these classes and their 
		efficient implementation for dependency analyses. On the 
		theoretical side we provide syntactic characterizations and
		study the expressiveness and algebraic properties of the 
		classes. In particular, we show that both are closed under 
		existential quantification. On the practical side we 
		investigate various representations for the classes based on 
		reduced ordered binary decision diagrams (ROBDDs), disjunctive 
		normal form, conjunctive normal form, Blake canonical form, 
		dual Blake canonical form, and a form specific to definite 
		functions. We compare the resulting implementations of 
		groundness analyzers based on the representations for precision
		and efficiency.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}



@Inproceedings{Bai-Crn-Ram-Son_ICDT97,
  author    = {James Bailey and 
		Lobel Crnogorac and 
		Kotagiri Ramamohanarao and 
		Harald S{\o}ndergaard},
  title     = {Abstract Interpretation of Active Rules and Its Use in
		Termination Analysis},
  editor    = {F. Afrati and P. Kolaitis},
  booktitle = {Database Theory---ICDT'97},
  series    = {Lecture Notes in Computer Science},
  volume    = {1186},
  pages     = {188--202},
  publisher = {Springer},
  year      = {1997},
  doi       = {10.1007/3-540-62222-5_45},
  abstract  = {The behaviour of rules in an active database system can be
		difficult to predict, and much work has been devoted to the
		development of automatic support for reasoning about properties
		such as confluence and termination. We show how abstract 
		interpretation can provide a generic framework for analysis of
		active rules. Abstract interpretation is a well-understood, 
		semantics-based method for static analysis. Its advantage, 
		apart from generality, lies in the separation of concerns: 
		Once the underlying semantics has been captured formally, a 
		variety of analyses can be derived, almost for free, as 
		\emph{approximations} to the semantics. Moreover, powerful 
		general theorems enable simple proofs of global correctness 
		and uniform termination of specific analyses. We outline these
		ideas and present, as an example application, a new method for 
		termination analysis. In terms of precision, the method 
		compares favourably with previous solutions to the problem.
		This is because the method investigates the flow of data 
		rather than just the syntax of conditions and actions.},
  keywords  = {Termination analysis, Abstract interpretation, Active databases},
}



@inproceedings{Bak-Son_ACSC93,
  author    = {Naomi Baker and 
		Harald S{\o}ndergaard},
  title     = {Definiteness Analysis for {CLP(R)}},
  editor    = {G. Gupta and G. Mohay and R. Topor},
  booktitle = {Proceedings of the Sixteenth Australian Computer Science 
		Conference},
  series    = {Australian Computer Science Communications},
  volume    = {15},
  number    = {1},
  pages     = {321--332},
  year      = {1993},
  abstract  = {Constraint logic programming (CLP) languages generalise
		logic programming languages, amalgamating logic programming
		and constraint programming.  Combining the best of two
		worlds, they provide powerful tools for wide classes
		of problems.  As with logic programming languages, code
		optimization by compilers is an important issue in the
		implementation of CLP languages.  A compiler needs
		sophisticated global information, collected by dataflow
		analyses, to generate competitive code.
		One kind of useful dataflow information concerns the point
		at which variables become definite, that is, constrained
		to take a unique value.  In this paper we present a very
		precise dataflow analysis to determine definiteness, and we
		discuss its applications.  By separating the two concerns:
		correctness and implementation techniques, abstract
		interpretation enables us to develop a sophisticated
		dataflow analysis in a straightforward manner, in fact in
		a framework where the correctness of the analysis is easily
		established---a feature which is uncommon when complex
		analyses are developed in an ad hoc way.
		We use a class of Boolean functions, the positive functions,
		to represent the definiteness relationship between variables.
		A Boolean function is interpreted as expressing a relation
		which holds not simply at the given point in an evaluation,
		but in fact during the rest of the evaluation branch.
		The nature of variables in a CLP language makes this
		treatment both possible and natural.},
  keywords  = {Constraint logic programming, Boolean logic, Abstract interpretation},
}



@Proceedings{Bow-Son_LOPSTR24,
  editor    = {Juliana Bowles and Harald S{\o}ndergaard},
  title     = {Logic-Based Program Synthesis and Transformation:
		Proceedings of the 34th International Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {14919},
  publisher = {Springer},
  year      = {2024},
  doi       = {10.1007/978-3-031-71294-4},
  keywords  = {Program transformation, Program synthesis, Program analysis, Inversion, Specification, Logic-based methods, Logic programming},
}



@Inproceedings{Cha-Ste-Son-Had_REES09,
  author    = {Rosemary Chang and
		Linda Stern and
		Harald S{\o}ndergaard and
		Roger Hadgraft},
  title     = {Places for Learning Engineering: 
		A Preliminary Report on Informal Learning Spaces},
  booktitle = {Proceedings of the 2009 Research in Engineering Education 
		Symposium},
  location  = {Palm Cove, Queensland},
  year      = {2009},
  keywords  = {Education},
}



@Inproceedings{Cod-Gen-Son-Stu_ICLP01,
  author    = {Michael Codish and 
		Samir Genaim and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Higher-Precision Groundness Analysis},
  editor    = {P. Codognet},
  booktitle = {Logic Programming: Proceedings of the 17th International 
		Conference},
  series    = {Lecture Notes in Computer Science},
  volume    = {2237},
  pages     = {135--149},
  publisher = {Springer},
  year      = {2001},
  doi       = {10.1007/3-540-45635-x_17},
  abstract  = {Groundness analysis of logic programs using Pos-based abstract
		interpretation is one of the clear success stories of the last
		decade in the area of logic program analysis. In this work we
		identify two problems with the Pos domain, the multiplicity and
		sign problems, that arise independently in groundness and 
		uniqueness analysis. We describe how these problems can be 
		solved using an analysis based on a domain Size for inferring 
		term size relations.  However this solution has its own 
		shortcomings because it involves a widening operator which leads
		to a loss of Pos information. Inspired by Pos, Size and the
		Lsign domain for abstract linear arithmetic constraints we
		introduce a new domain Lpos, and show how it can be used for
		groundness and uniqueness analysis. The idea is to use the sign
		information of Lsign to improve the widening of Size so that
		it does not lose Pos information. We prove that the resulting 
		analyses using Lpos are uniformly more precise than those using
		Pos.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}



@Article{Cod-Son-Stu_TOPLAS99,
  author   = {Michael Codish and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title    = {Sharing and Groundness Dependencies in Logic Programs},
  journal  = {ACM Transactions on Programming Languages and Systems},
  volume   = {21},
  number   = {5},
  pages    = {948--976},
  year     = {1999},
  doi      = {10.1145/330249.330252},
  abstract = {We investigate Jacobs and Langen's \textsf{Sharing} domain, 
		introduced for the analysis of variable sharing in logic 
		programs, and show that it is isomorphic to Marriott and 
		S{\o}ndergaard's \textsf{Pos} domain, introduced for the 
		analysis of groundness dependencies.  Our key idea
		is to view the sets of variables in a \textsf{Sharing} 
		domain element as the models of a corresponding Boolean 
		function.  This leads to a recasting of sharing analysis 
		in terms of the property of ``not being affected by the 
		binding of a \emph{single} variable.''  Such an
		``unaffectedness dependency'' analysis has close 
		connections with groundness dependency analysis using 
		positive Boolean functions.  This new view improves our 
		understanding of sharing analysis, and leads to an elegant
		expression of its combination with groundness dependency
		analysis based on the reduced product of \textsf{Sharing} 
		and \textsf{Pos}.  It also opens up new avenues for the 
		efficient implementation of sharing analysis, for example 
		using reduced order binary decision diagrams, as well as
		efficient implementation of the reduced product, using 
		domain factorizations.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}



@Incollection{Cod-Son_JonesFest02,
  author    = {Michael Codish and 
		Harald S{\o}ndergaard},
  title     = {Meta-Circular Abstract Interpretation in {Prolog}},
  editor    = {T. Mogensen and D. Schmidt and I. H. Sudborough},
  booktitle = {The Essence of Computation: Complexity, Analysis, Transformation},
  series    = {Lecture Notes in Computer Science},
  volume    = {2566},
  pages     = {109--134},
  publisher = {Springer},
  year      = {2002},
  doi       = {10.1007/3-540-36377-7_6},
  abstract  = {We give an introduction to the meta-circular approach to the
		abstract interpretation of logic programs.  This approach is
		particularly useful for prototyping and for introductory 
		classes on abstract interpretation.  Using interpreters, 
		students can immediately write, adapt, and experiment with 
		interpreters and working dataflow analysers.  We use a simple
		meta-circular interpreter, based on a ``non-ground $T_P$'' 
		semantics, as a generic analysis engine.  Instantiating the
		engine is a matter of providing an appropriate domain of
		approximations, together with definitions of ``abstract'' 
		unification and disjunction.  Small changes of the interpreter
		let us vary both what can be ``observed'' by an analyser, and
		how fixed point computation is done.  Amongst the dataflow 
		analyses used to exemplify this approach are a parity analysis,
		groundness dependency analysis, call patterns, depth-$k$ 
		analysis, and a ``pattern'' analysis to establish most specific
		generalisations of calls and success sets.},
  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Prolog},
}



@Inproceedings{Cod-Son_PLILP98,
  author    = {Michael Codish and 
		Harald S{\o}ndergaard},
  title     = {The {Boolean} Logic of Set Sharing Analysis},
  editor    = {C. Palamidessi and H. Glaser and K. Meinke},
  booktitle = {Principles of Declarative Programming},
  series    = {Lecture Notes in Computer Science},
  volume    = {1490},
  pages     = {89--101},
  publisher = {Springer},
  year      = {1998},
  doi       = {10.1007/bfb0056609},
  abstract  = {We show that Jacobs and Langen's domain for set-sharing 
		analysis is isomorphic to the domain of positive Boolean 
		functions, introduced by Marriott and S{\o}ndergaard for 
		groundness dependency analysis. Viewing a set-sharing 
		description as a minterm representation of a Boolean 
		function leads to re-casting sharing analysis as an
		instantiation dependency analysis. The key idea is to 
		view the sets of variables in a sharing domain element 
		as the models of a Boolean function. In this way, sharing 
		sets are precisely dual negated positive Boolean functions. 
		This new view improves our understanding of sharing 
		analysis considerably and opens up new avenues for the
		efficient implementation of this kind of analysis, for 
		example using ROBDDs. To this end we express Jacobs and 
		Langen's abstract operations for set sharing in logical form.},
  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},
}



@inproceedings{Cor-Gan-Nav-Sch-Son-Stu_LOPSTR14,
  author    = {J. Robert M. Cornish and 
		Graeme Gange and 
		Jorge Navas and
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Analyzing Array Manipulating Programs by Program Transformation},
  editor    = {M. Proietti and H. Seki},
  booktitle = {Logic-Based Program Synthesis and Transformation:
                Proceedings of the 24th International Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {8981},
  pages     = {3--20},
  publisher = {Springer International},
  year      = {2015},
  doi       = {10.1007/978-3-319-17822-6_1},
  abstract  = {We explore a transformational approach to the problem 
		of verifying simple array-manipulating programs.  
		Traditionally, verification of such programs requires 
		intricate analysis machinery to reason with universally
		quantified statements about symbolic array segments, 
		such as ``every data item stored in the segment A[i] 
		to A[j] is equal to the corresponding item stored in the
		segment B[i] to B[j].'' We define a simple abstract 
		machine which allows for set-valued variables and we 
		show how to translate programs with array operations to
		array-free code for this machine.  For the purpose of 
		program analysis, the translated program remains faithful
		to the semantics of array manipulation.  Based on our 
		implementation in LLVM, we evaluate the approach with
		respect to its ability to extract useful invariants and 
		the cost in terms of code size.},
  keywords  = {Program transformation, Static analysis, Array analysis},
}



@Inproceedings{Cre-Mar-Son_AI90,
  author    = {Roberto Cremonini and 
		Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {A General Theory for Abstraction},
  editor    = {C. P. Tsang},
  booktitle = {AI '90: Proceedings of the Fourth Australian Joint Conference on 
			Artificial Intelligence}, 
  pages     = {121--134},
  publisher = {World Scientific Publ.},
  year	    = {1990},
  abstract  = {Abstraction is the process of mapping one representation of 
		a problem into another representation so as to simplify 
		reasoning while preserving the essence of the problem.
		It has been investigated in many different areas of computer
		science. In artificial intelligence, abstraction is used in
		automated theorem proving, problem solving, planning, common
		sense reasoning and qualitative reasoning. In dataflow 
		analysis of programs, it has been formalized in the theory 
		of abstract interpretation. However, the possible 
		connections between research on abstraction in artificial 
		intelligence and dataflow analysis have gone unnoticed until
		now. This paper investigates these connections and
		provides a general theory of abstraction for artificial 
		intelligence. In particular, we present a method for 
		building an ``optimal'' abstraction and give general 
		sufficient conditions for the abstraction to be ``safe.''
		The usefulness and generality of our theory is illustrated 
		with a number of example applications and by comparisons 
		with related work.},
  keywords  = {Abstract interpretation, Artificial intelligence},
}



@Inproceedings{Crn-Kel-Son_SAS96,
  author    = {Lobel Crnogorac and 
		Andrew Kelly and 
		Harald S{\o}ndergaard},
  title     = {A Comparison of Three Occur-Check Analysers},
  editor    = {R. Cousot and D. A. Schmidt},
  booktitle = {Static Analysis: Proceedings of the Third International 
		Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {1145},
  pages     = {159--173},
  publisher = {Springer},
  year      = {1996},
  doi       = {10.1007/3-540-61739-6_40},
  abstract  = {A well known problem with many Prolog interpreters and compilers
		is the lack of occur-check in the implementation of the 
		unification algorithm. This means that such systems are unsound
		with respect to first-order predicate logic. Static analysis 
		offers an appealing approach to the problem of occur-check 
		reduction, that is, the safe omission of occur-checks in 
		unification. We compare, for the first time, three static 
		methods that have been suggested for occur-check reduction, 
		two based on assigning ``modes'' to programs and one which 
		uses abstract interpretation. In each case, the analysis or 
		some essential part of it had not been implemented so far.
		Of the mode-based methods, one is due to Chadha and Plaisted
		and the other is due to Apt and Pellegrini. The method using 
		abstract interpretation is based on earlier work by Plaisted, 
		S{\o}ndergaard and others who have developed groundness and 
		sharing analyses for logic programs. The conclusion is that a 
		truly global analysis based on abstract interpretation leads 
		to markedly higher precision and hence fewer occur-checks at 
		run-time. Given the potential run-time speedups, a precise 
		analysis would be well worth the extra time.},
  keywords  = {Abstract interpretation, Groundness analysis, Sharing analysis, Unification, Prolog, Compilation},
}



@inproceedings{Dav-Pea-Stu-Son_AAMAS15,
  author    = {Toby O. Davies and 
		Adrian R. Pearce and
                Peter J. Stuckey and 
		Harald S{\o}ndergaard},
  title     = {Optimisation and Relaxation for Planning in the Situation
                Calculus},
  editor    = {R. H. Bordini and E. Elkind and G. Weiss and P. Yolum},
  booktitle = {Proceedings of the 14th International Conference
                on Autonomous Agents and Multiagent Systems (AAMAS 2015)},
  pages     = {1141--1149},
  publisher = {IFAAMAS},
  year      = {2015},  
  url_Paper = {http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf},
  abstract  = {The situation calculus can express rich agent behaviours and 
		goals and facilitates the reduction of complex planning 
		problems to theorem proving. However, in many planning 
		problems, solution quality is critically important, and the 
		achievable quality is not necessarily known in advance.
		Existing \textsc{Golog} implementations merely search for a 
		\emph{legal} plan, typically relying on depth-first search to 
		find an execution. We illustrate where existing strategies 
		will not terminate when quality is considered, and to overcome
		this limitation we formally introduce the notion of \emph{cost}
		to simplify the search for a solution. The main contribution is
		a new class of relaxations of the planning problem, termed 
		\emph{precondition relaxations}, based on Lagrangian relaxation.
		We show how this facilitates optimisation of a restricted class
		of \textsc{Golog} programs for which plan existence (under a 
		cost budget) is decidable. It allows for tractably computing 
		relaxations to the planning problem and leads to a general, 
		\emph{blackbox}, approach to optimally solving multi-agent 
		planning problems without explicit reference to the semantics 
		of interleaved concurrency.},
  keywords  = {Planning, Artificial intelligence},
}



@inproceedings{Dav-Pea-Stu-Son_ICAPS14,
  author    = {Toby O. Davies and 
		Adrian R. Pearce and
                Peter J. Stuckey and 
		Harald S{\o}ndergaard},
  title     = {Fragment-Based Planning Using Column Generation},
  editor    = {S. Chien and M. Do and A. Fern and W. Ruml},
  booktitle = {Proceedings of the 24th International Conference
                on Automated Planning and Scheduling},
  pages     = {83--91},
  publisher = {AAAI},
  year      = {2014},  
  url_Paper = {www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015},
  doi       = {10.1609/icaps.v24i1.13628},
  abstract  = {We introduce a novel algorithm for temporal planning in 
		\textsc{Golog} using shared resources, and describe the 
		Bulk Freight Rail Scheduling Problem, a motivating example
		of such a temporal domain. We use the framework of column 
		generation to tackle complex resource constrained temporal 
		planning problems that are beyond the scope of current planning
		technology by combining: the global view of a linear programming
		relaxation of the problem; the strength of search in finding 
		action sequences; and the domain knowledge that can be encoded 
		in a \textsc{Golog} program. We show that our approach 
		significantly outperforms state-of-the-art temporal planning 
		and constraint programming approaches in this domain, in 
		addition to existing temporal \textsc{Golog} implementations.
		We also apply our algorithm to a temporal variant of 
		blocks-world where our decomposition speeds proof of optimality
		significantly compared to other anytime algorithms. We discuss 
		the potential of the underlying algorithm being applicable to
		STRIPS planning, with further work.},
  keywords  = {Planning, Artificial intelligence},
}



@Inproceedings{Dav-Sch-Som-Son_MSPC12,
  author    = {Matthew Davis and 
		Peter Schachte and 
		Zoltan Somogyi and
		Harald S{\o}ndergaard},
  title     = {Towards Region Based Memory Management for {Go}},
  booktitle = {Proceedings of the 2012 ACM Workshop on Memory Systems 
		Performance and Correctness (MSPC 2012)},
  pages     = {58--67},
  publisher = {ACM Press},
  year      = {2012},
  doi       = {10.1145/2247684.2247695},
  abstract  = {Region-based memory management aims to lower the cost of 
		deallocation through bulk processing: instead of 
		recovering the memory of each object separately, it
		recovers the memory of a region containing many objects.
		It relies on static analysis to determinethe set of 
		memory regions needed by a program, the program points at
		which each region should be created and removed, and, for
		each memory allocation, the region that should supply the
		memory.  The concurrent language Go has features that pose
		interesting challenges for this analysis.  We present a 
		novel design for region-based memory management for Go,
		combining static analysis, to guide region creation, and
		lightweight runtime bookkeeping, to help control 
		reclamation.  The main advantage of our approach is that
		it greatly limits the amount of re-work that must be done
		after eachchange to the program source code, making our
		approach more practical than existing RBMM systems.  Our
		prototype implementation covers most of the sequential
		fragment of Go, and preliminary results are encouraging.},
  keywords  = {Memory management, Go},
}



@Inproceedings{Dav-Sch-Som-Son_MSPC13,
  author    = {Matthew Davis and 
		Peter Schachte and 
		Zoltan Somogyi and
		Harald S{\o}ndergaard},
  title     = {A Low Overhead Method for Recovering Unused Memory 
		Inside Regions},
  booktitle = {Proceedings of the 2013 ACM Workshop on Memory Systems 
		Performance and Correctness (MSPC 2013)},
  publisher = {ACM Press},
  year      = {2013},
  doi       = {10.1145/2492408.2492415},
  abstract  = {Automating memory management improves both resource safety
		and programmer productivity.  One approach, region-based
		memory management (RBMM), applies compile-time reasoning
		to identify points in a program at which memory can be 
		safely reclaimed.  The main advantage of RBMM over 
		traditional garbage collection (GC) is the avoidance of 
		expensive runtime analysis, which makes reclaiming memory
		much faster.  On the other hand, GC requires no static 
		analysis, and, operating at runtime, can have 
		significantly more accurate information about object 
		lifetimes.  In this paper we propose a hybrid system
		that seeks to combine the advantages of both methods
		while avoiding the overheads that previous hybrid systems
		incurred.  Our system can also reclaim array segments 
		whose elements are no longer reachable.},
  keywords  = {Memory management, Compilation, Go},
}



@InProceedings{Far-Jef-Son_ITiCSE22,
  author    = {Matthew Farrugia-Roberts and
		Bryn Jeffries and
		Harald S{\o}ndergaard},
  title     = {Programming to Learn:
		Logic and Computation from a Programming Perspective},
  booktitle = {Proceedings of the 27th Annual Conference on Innovation and 
		Technology in Computer Science Education},
  pages     = {311--317},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY},
  year      = {2022},
  doi       = {10.1145/3502718.3524814},
  abstract  = {Programming problems are commonly used as a learning and 
		assessment activity for learning to program. We believe
		that programming problems can be effective for broader 
		learning goals. In our large-enrolment course, we have 
		designed special programming problems relevant to logic, 
		discrete mathematics, and the theory of computation, and 
		we have used them for formative and summative assessment.
		In this report, we reflect on our experience. We aim to 
		leverage our students' programming backgrounds by offering
		a code-based formalism for our mathematical syllabus.
		We find we can translate many traditional questions into 
		programming problems of a special kind---calling for 
		`programs' as simple as a single expression, such as a 
		formula or automaton represented in code. A web-based 
		platform enables self-paced learning with rapid contextual
		corrective feedback, and helps us scale summative 
		assessment to the size of our cohort. We identify several 
		barriers arising with our approach and discuss how we have
		attempted to negate them. We highlight the potential of 
		programming problems as a digital learning activity even 
		beyond a logic and computation course.},
  keywords  = {Education, Web-based learning},
}



@InProceedings{Far-Jef-Son_TFPIE21,
  author    = {Matthew Farrugia-Roberts and
		Bryn Jeffries and
		Harald S{\o}ndergaard},
  title     = {Teaching Simple Constructive Proofs with {Haskell} Programs},
  editor    = {P. Achten and E. Machkasova},
  booktitle = {Trends in Functional Programming in Education (TFPIE)},
  series    = {Electronic Proceedings in Theoretical Computer Science},
  volume    = {363},
  pages     = {54--73},
  year      = {2022},
  url_Paper       = {https://arxiv.org/abs/2208.04699v1},
  doi       = {10.4204/EPTCS.363.4},
  abstract  = {In recent years we have explored using Haskell alongside a
		traditional mathematical formalism in our large-enrolment 
		university course on topics including logic and formal 
		languages, aiming to offer our students a programming 
		perspective on these mathematical topics. We have found it 
		possible to offer almost all formative and summative 
		assessment through an interactive learning platform, using 
		Haskell as a lingua franca for digital exercises across our 
		broad syllabus. One of the hardest exercises to convert 
		into this format are traditional written proofs conveying 
		constructive arguments. In this paper we reflect on the 
		digitisation of this kind of exercise. We share many examples
		of Haskell exercises designed to target similar skills to 
		written proof exercises across topics in propositional logic 
		and formal languages, discussing various aspects of the design 
		of such exercises. We also catalogue a sample of student 
		responses to such exercises. This discussion contributes to 
		our broader exploration of programming problems as a flexible
		digital medium for learning and assessment.},
  keywords  = {Education, Web-based learning, Haskell},
}



@InProceedings{Gab-Gly-Son_LOPSTR98,
  author    = {Tihomir Gabri{\'c} and 
		Kevin Glynn and 
		Harald S{\o}ndergaard},
  title     = {Strictness Analysis as Finite-Domain Constraint Solving},
  editor    = {P. Flener},
  booktitle = {Logic-Based Program Synthesis and Transformation},
  series    = {Lecture Notes in Computer Science},
  volume    = {1559},
  pages     = {255--270},
  publisher = {Springer},
  address   = {Berlin, Germany},
  year      = {1999},
  doi       = {10.1007/3-540-48958-4_14},
  abstract  = {It has become popular to express dataflow analyses in logical 
		form. In this paper we investigate a new approach to the 
		analysis of functional programs, based on synthesis of 
		constraint logic programs. We sketch how the language Toupie,
		originally designed with logic program analysis as one 
		objective, lends itself also to sophisticated strictness 
		analysis. Strictness analysis is straightforward in the 
		simplest case, that of analysing a first-order functional 
		language using just two strictness values, namely divergence 
		and ``don't know''. Mycroft's classical translation immediately
		yields perfectly valid Boolean constraint logic programs, 
		which, when run, provide the desired strictness information.
		However, more sophisticated analysis requires more complex 
		domains of strictness values. We recast Wadler's classical 
		analysis over a $2n$-point domain as finite-domain 
		constraint solving. This approach has several advantages.
		First, the translation is relatively simple. We translate a 
		recursive function definition into one or two constraint 
		program clauses, in a manner which naturally extends Mycroft's
		translation for the 2-point case, where the classical approach
		translate the definition of an $n$-place function over lists 
		into $4^n$ mutually recursive equations. Second, the resulting 
		program produces \emph{relational} information, allowing for 
		example to ask which combinations of properties of input will 
		produce a given output. Third, the approach allows us to 
		leverage from established technology, for solving finite-domain 
		constraints, as well as for finding fixed points. Finally, the
		use of (disjunctive) constraints can yield a higher precision 
		in the analysis of some programs.},
  keywords  = {Strictness analysis, Abstract interpretation, Abstract domains, Functional programming, Constraint programming},
}



@article{Gan-Hor-Nai-Son_TCAD14,
  author    = {Graeme Gange and 
		Benjamin Horsfall and 
		Lee Naish and
                Harald S{\o}ndergaard},
  title     = {Four-Valued Reasoning and Cyclic Circuits},
  journal   = {IEEE Transactions on Computer-Aided Design of Integrated
                Circuits and Systems},
  volume    = {33},
  number    = {7},
  pages     = {1003--1016},
  month     = {july},
  year      = {2014},
  url_Paper = {http://dx.doi.org/10.1109/TCAD.2014.2304176},
  doi       = {10.1109/TCAD.2014.2304176},
  abstract  = {Allowing cycles in a logic circuit can be advantageous,
		for example, by reducing the number of gates required to 
		implement a given Boolean function, or set of functions.
		However, a cyclic circuit may easily be ill-behaved.
		For instance it may have some output wire oscillate 
		instead of reaching a steady state.  Propositional 
		three-valued logic has long been used in tests for
		well-behaviour of cyclic circuits: a symbolic evaluation 
		method known as ternary analysis provides one criterion 
		for well-behaviour under certain assumptions about wire 
		and gate delay.  We revisit ternary analysis and argue 
		for the use of four truth values.  The fourth truth 
		value allows for the distinction of ``undefined'' and
		``underspecified'' behaviour.  Ability to under-specify 
		behaviour is useful, because, in a quest for smaller 
		circuits, an implementor can capitalize on degrees of 
		freedom offered in the specification.  Moreover, a fourth
		truth value is attractive because, rather than complicating
		(ternary) circuit analysis, it introduces a pleasant 
		symmetry, in the form of contra-duality, as well as 
		providing a convenient framework for manipulating
		specifications.  We use this symmetry to provide fixed 
		point results that clarify how two-, three-, and four-valued
		analyses are related, and to explain some observations about
		ternary analysis.},
  keywords  = {Fixed points, Many-valued logic, Logic circuits, Circuit synthesis},
}



@article{Gan-Ma-Nav-Sch-Son-Stu_TOPLAS21,
  author    = {Graeme Gange and
                Zequn Ma and
                Jorge A. Navas and
                Peter Schachte and
                Harald S{\o}ndergaard and
                Peter J. Stuckey},
  title     = {A Fresh Look at {Zones} and {Octagons}},
  journal   = {ACM Transactions on Programming Languages and Systems},
  volume    = {43},
  number    = {3},
  pages     = {11:1--11:51},
  year      = {2021},
  doi       = {10.1145/3457885},
  abstract  = {Zones and Octagons are popular abstract domains for 
		static program analysis. They enable the automated 
		discovery of simple numerical relations that hold 
		between pairs of program variables. Both domains 
		are well understood mathematically but the detailed 
		implementation of static analyses based on these 
		domains poses many interesting algorithmic challenges. 
		In this paper we study the two abstract domains, their 
		implementation and use. Utilizing improved data 
		structures and algorithms for the manipulation of 
		graphs that represent difference-bound constraints, 
		we present fast implementations of both abstract domains, 
		built around a common infrastructure. We compare the 
		performance of these implementations against alternative 
		approaches offering the same analysis precision. We 
		quantify the differences in performance by measuring 
		their speed and precision on standard benchmarks. We 
		also assess, in the context of software verification, 
		the extent to which the improved precision translates 
		to better verification outcomes. Experiments demonstrate 
		that our new implementations improve the state-of-the-art 
		for both Zones and Octagons significantly.},
  keywords  = {Abstract domains, Abstract interpretation, Static analysis},
}



@InProceedings{Gan-Nav-Sch-Son-Stu_APLAS19,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Dissecting Widening: Separating Termination from Information},
  editor    = {A. W. Lin},
  booktitle = {Proceedings of the 17th Asian Symposium on Programming 
		Languages and Systems},
  series    = {Lecture Notes in Computer Science},
  volume    = {11893},
  pages     = {95--114},
  publisher = {Springer},
  year      = {2019},
  doi       = {10.1007/978-3-030-34175-6_6},
  abstract  = {Widening ensures or accelerates convergence of a program 
		analysis, and sometimes contributes a guarantee of soundness 
		that would otherwise be absent. In this paper we propose a 
		generalised view of widening, in which widening operates on 
		values that are not necessarily elements of the given abstract
		domain, although they must be in a correspondence, the details
		of which we spell out. We show that the new view generalizes 
		the traditional view, and that at least three distinct 
		advantages flow from the generalization. First, it gives a 
		handle on ``compositional safety'', the problem of creating 
		widening operators for product domains. Second, it adds a 
		degree of flexibility, allowing us to define variants of 
		widening, such as delayed widening, without resorting to 
		intrusive surgery on an underlying fixpoint engine.  Third, 
		it adds a degree of robustness, by making it difficult for
		an analysis implementor to make certain subtle (syntactic vs 
		semantic) category mistakes. The paper supports these claims 
		with examples. Our proposal has been implemented in a 
		state-of-the-art abstract interpreter, and we briefly report 
		on the changes that the revised view necessitated.},
  keywords  = {Fixed points, Abstract domains, Abstract interpretation, Widening},
}



@misc{Gan-Nav-Sch-Son-Stu_ArXiv14,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Partial-Order Approach to Array Content Analysis},
  note      = {ArXiv preprint {https://arxiv.org/abs/1408.1754}},
  year      = {2014},
  doi       = {10.48550/arxiv.1408.1754},
  abstract  = {We present a parametric abstract domain for array content 
		analysis. The method maintains invariants for contiguous 
		regions of the array, similar to the methods of Gopan, Reps 
		and Sagiv, and of Halbwachs and Peron. However, it introduces 
		a novel concept of an array content graph, avoiding the need 
		for an up-front factorial partitioning step. The resulting 
		analysis can be used with arbitrary numeric relational 
		abstract domains; we evaluate the domain on a range of 
		array manipulating program fragments.},
  keywords  = {Abstract domains, Array analysis},
}



@inproceedings{Gan-Nav-Sch-Son-Stu_NFM15,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Tool for Intersecting Context-Free Grammars and Its
                Applications},
  editor    = {K. Havelund and G. Holzmann and R. Joshi},
  booktitle = {NASA Formal Methods:
                Proceedings of the Seventh International Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {9058},
  pages     = {422--428},
  publisher = {Springer},
  year      = {2015},
  doi       = {10.1007/978-3-319-17524-9},
  abstract  = {This paper describes a tool for intersecting context-free
		grammars. Since this problem is undecidable the tool 
		follows a refinement-based approach and implements a 
		novel refinement which is complete for regularly 
		separable grammars. We show its effectiveness for safety
		verification of recursive multi-threaded programs.},
  keywords  = {String analysis, Formal languages, Program verification},
}



@InProceedings{Gan-Nav-Sch-Son-Stu_SAS13,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter Schachte and
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Abstract Interpretation over Non-Lattice Abstract Domains},
  editor    = {F. Logozzo and M. F{\"a}hndrich},
  booktitle = {Static Analysis},
  series    = {Lecture Notes in Computer Science},
  volume    = {7935},
  pages     = {6--24},
  publisher = {Springer},
  year      = {2013},
  doi       = {10.1007/978-3-642-38856-9_3},
  abstract  = {The classical theoretical framework for static analysis of
		programs is abstract interpretation. Much of the power and 
		elegance of that framework rests on the assumption that an 
		abstract domain is a lattice. Nonetheless, and for good reason,
		the literature on program analysis provides many examples of 
		non-lattice domains, including non-convex numeric domains. 
		The lack of domain structure, however, has negative 
		consequences, both for the precision of program analysis and 
		for the termination of standard Kleene iteration. In this paper 
		we explore these consequences and present general remedies.},
  keywords  = {Fixed points, Abstract domains, Lattice theory},
}



@inproceedings{Gan-Nav-Sch-Son-Stu_SAS16,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Exploiting Sparsity in Difference-Bound Matrices},
  editor    = {X. Rival},
  booktitle = {Static Analysis:
                Proceedings of the 23rd International Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {9837},
  pages     = {189--211},
  publisher = {Springer},
  year      = {2016},
  doi       = {10.1007/978-3-662-53413-7},
  abstract  = {Relational numeric abstract domains are very important in 
		program analysis. Common domains, such as Zones and Octagons, 
		are usually conceptualised with weighted digraphs and 
		implemented using difference-bound matrices (DBMs). 
		Unfortunately, though conceptually simple, direct 
		implementations of graph-based domains tend to perform
		poorly in practice, and are impractical for analyzing large 
		code-bases. We propose new DBM algorithms that exploit 
		sparsity and closed operands. In particular, a new 
		representation which we call split normal form reduces graph
		density on typical abstract states. We compare the resulting 
		implementation with several existing DBM-based abstract 
		domains, and show that we can substantially reduce the time
		to perform full DBM analysis, without sacrificing precision.},
  keywords  = {Abstract domains, Abstract interpretation, Static analysis},
}



@InProceedings{Gan-Nav-Sch-Son-Stu_SAS21,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter Schachte and
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Disjunctive Interval Analysis},
  editor    = {C. Dr{\u{a}}goi and S. Mukherjee and K. Namjoshi},
  booktitle = {Static Analysis},
  series    = {Lecture Notes in Computer Science},
  volume    = {12913},
  pages     = {144--165},
  publisher = {Springer},
  year      = {2021},
  doi       = {10.1007/978-3-030-88806-0_7},
  abstract  = {We revisit disjunctive interval analysis based on the 
		Boxes abstract domain. We propose the use of what we call 
		range decision diagrams (RDDs) to implement Boxes, and we 
		provide algorithms for the necessary RDD operations.  
		RDDs tend to be more compact than the linear decision
		diagrams (LDDs) that have traditionally been used for Boxes.
		Representing information more directly, RDDs also allow for 
		the implementation of more accurate abstract operations.
		This comes at no cost in terms of analysis efficiency,
		whether LDDs utilise dynamic variable ordering or not.
		RDD and LDD implementations are available in the Crab analyzer,
		and our experiments confirm that RDDs are well suited for
		disjunctive interval analysis.},
  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Interval analysis},
}



@article{Gan-Nav-Sch-Son-Stu_TCS16,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Complete Refinement Procedure for Regular Separability
                of Context-Free Languages},
  journal   = {Theoretical Computer Science},
  volume    = {625},
  pages     = {1--24},
  month     = {April},
  year      = {2016},
  doi       = {10.1016/j.tcs.2016.01.026},
  abstract  = {Often, when analyzing the behaviour of systems modelled 
		as context-free languages, we wish to know if two 
		languages overlap.  To this end, we present a class of 
		semi-decision procedures for regular separability of 
		context-free languages, based on counter-example guided 
		abstraction refinement.  We propose two effective
		instances of this approach, one that is complete but 
		relatively expensive, and one that is inexpensive and 
		sound, but for which we do not have a completeness proof.
		The complete method will prove disjointness whenever the 
		input languages are regularly separable. Both methods 
		will terminate whenever the input languages overlap. 
		We provide an experimental evaluation of these procedures,
		and demonstrate their practicality on a range of 
		verification and language-theoretic instances.},
  keywords  = {String analysis, Formal languages, Program verification},
}



@article{Gan-Nav-Sch-Son-Stu_TOPLAS15,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and 
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Interval Analysis and Machine Arithmetic: 
                Why Signedness Ignorance Is Bliss},
  journal   = {ACM Transactions on Programming Languages and Systems},
  volume    = {37},
  number    = {1},
  pages     = {1:1--1:35},
  month     = {january},
  year      = {2015},
  doi       = {http://dx.doi.org/10.1145/2651360},
  abstract  = {The most commonly used integer types have fixed bit-width,
		making it possible for computations to ``wrap around'',
		and many programs depend on this behaviour.  Yet much 
		work to date on program analysis and verification of 
		integer computations treats integers as having infinite 
		precision, and most analyses that do respect fixed width
		lose precision when overflow is possible.  We present a 
		novel integer interval abstract domain that correctly 
		handles wrap-around.  The analysis is signedness agnostic.
		By treating integers as strings of bits, only considering
		signedness for operations that treat them differently, 
		we produce precise, correct results at a modest cost in 
		execution time.},
  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},
}



@Article{Gan-Nav-Sch-Son-Stu_TPLP13,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter Schachte and
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Failure Tabled Constraint Logic Programming by Interpolation},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {13},
  number    = {4--5},
  pages     = {593--607},
  year      = {2013},
  doi       = {10.1017/S1471068413000379},
  abstract  = {We present a new execution strategy for constraint logic
		programs called \emph{Failure Tabled CLP}. Similarly to
		\emph{Tabled CLP} our strategy records certain derivations
		in order to prune further derivations. However, our method
		only learns from \emph{failed derivations}. This allows us
		to compute \emph{interpolants} rather than 
		\emph{constraint projection} for generation of 
		\emph{reuse conditions}. As a result, our technique can
		be used where projection is too expensive or does not 
		exist. Our experiments indicate that Failure Tabling can
		speed up the execution of programs with many redundant 
		failed derivations as well as achieve termination in the
		presence of infinite executions.},
  keywords  = {Logic programming, Interpolants},
}



@article{Gan-Nav-Sch-Son-Stu_TPLP15,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Horn Clauses As an Intermediate Representation for 
                Program Analysis and Transformation},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {15},
  number    = {4--5},
  pages     = {526--542},
  year      = {2015},
  doi       = {http://dx.doi.org/10.1017/S1471068415000204},
  abstract  = {Many recent analyses for conventional imperative programs 
		begin by transforming programs into logic programs, 
		capitalising on existing LP analyses and simple LP 
		semantics.  We propose using logic programs as an 
		intermediate program representation throughout the 
		compilation process.  With restrictions ensuring 
		determinism and single-modedness, a logic program can 
		easily be transformed to machine language or other 
		low-level language, while maintaining the simple semantics
  		that makes it suitable as a language for program analysis
		and transformation.  We present a simple LP language that
		enforces determinism and single-modedness, and show that
		it makes a convenient program representation for analysis
		and transformation.},
  keywords  = {Static analysis, Intermediate representations, Horn clauses, Logic programming},
}



@inproceedings{Gan-Nav-Sch-Son-Stu_VMCAI15,
  author    = {Graeme Gange and 
		Jorge Navas and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {An Abstract Domain of Uninterpreted Functions},
  editor    = {B. Jobstmann and K. R. M. Leino},
  booktitle = {Verification, Model Checking and Abstract Interpretation:
                Proceedings of the 17th International Conference},
  series    = {Lecture Notes in Computer Science},
  volume    = {9583},
  pages     = {85--103},
  publisher = {Springer},
  year      = {2016},
  isbn      = {978-3-662-49121-8},
  doi       = {10.1007/978-3-662-49122-5},
  abstract  = {We revisit relational static analysis of numeric variables.
		Such analyses face two difficulties. First, even inexpensive 
		relational domains scale too poorly to be practical for large 
		code-bases. Second, to remain tractable they have extremely 
		coarse handling of non-linear relations. In this paper, we 
		introduce the subterm domain, a weakly relational abstract 
		domain for inferring equivalences amongst sub-expressions,
		based on the theory of uninterpreted functions. This provides 
		an extremely cheap approach for enriching non-relational 
		domains with relational information, and enhances precision 
		of both relational and non-relational domains in the presence
		of non-linear operations. We evaluate the idea in the context 
		of the software verification tool SeaHorn.},
  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Program verification},
}



@InProceedings{Gan-Nav-Stu-Son-Sch_TACAS13,
  author    = {Graeme Gange and 
		Jorge A. Navas and 
		Peter J. Stuckey and 
		Harald S{\o}ndergaard and 
		Peter Schachte},
  title     = {Unbounded Model-Checking with Interpolation for Regular
                Language Constraints},
  editor    = {N. Piterman and S. Smolka},
  booktitle = {TACAS 2013: Proceedings of the 19th International
		Conference on Tools and Algorithms for the Construction 
		and Analysis of Systems},
  series    = {Lecture Notes in Computer Science},
  volume    = {7795},
  pages     = {277--291},
  publisher = {Springer},
  year      = {2013},
  doi       = {10.1007/978-3-642-36742-7_20},
  abstract  = {We present a decision procedure for the problem of, 
		given a set of regular expressions $R_1, \ldots, R_n$,
		determining whether $R = R_1 \cap \cdots \cap R_n$ is 
		empty.  Our solver, \sys{revenant}, finitely unrolls 
		automata for $R_1, \ldots, R_n$, encoding each as a 
		set of propositional constraints.  If a SAT solver 
		determines satisfiability then $R$ is non-empty. Otherwise
		our solver uses unbounded model checking techniques 
		to extract an interpolant from the bounded proof.  
		This interpolant serves as an overapproximation of $R$.  
		If the solver reaches a fixed-point with the constraints
		remaining unsatisfiable, it has proven $R$ to be empty.
		Otherwise, it increases the unrolling depth and repeats.
		We compare \textsc{revenant} with other state-of-the-art 
		string solvers.  Evaluation suggests that it behaves
		better for constraints that express the intersection of
		sets of regular languages, a case of interest in the 
		context of verification.},
  keywords  = {Static analysis, Formal languages, Model checking, Interpolants, String constraints},
}



@InProceedings{Gan-Son-Stu-Sch_CADE13,
  author    = {Graeme Gange and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey and 
		Peter Schachte},
  title     = {Solving Difference Constraints over Modular Arithmetic},
  editor    = {M. P. Bonacina},
  booktitle = {CADE 2013: Proceedings of the 24th International
		Conference on Automated Deduction},
  series    = {Lecture Notes in Artificial Intelligence},
  volume    = {7898},
  pages     = {215--230},
  publisher = {Springer},
  year      = {2013},
  doi       = {10.1007/978-3-642-38574-2_15},
  abstract  = {Difference logic is commonly used in program verification 
		and analysis. In the context of fixed-precision integers,
		as used in assembly languages for example, the use of 
		classical difference logic is unsound. We study the problem
		of deciding difference constraints in the context of modular
		arithmetic and show that it is strongly NP-complete. We 
		discuss the applicability of the Bellman-Ford algorithm and 
		related shortest-distance algorithms to the context of modular
		arithmetic. We explore two approaches, namely a complete 
		method implemented using SMT technology and an incomplete 
		fixpoint-based method, and the two are experimentally 
		evaluated. The incomplete method performs considerably 
		faster while maintaining acceptable accuracy on a range
		of instances.},
  keywords  = {Constraint solving, Program verification, Static analysis, Machine arithmetic, Fixed points},
}



@article{Gan-Son-Stu_TODAES14,
  author    = {Graeme Gange and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Synthesizing Optimal Switching Lattices},
  journal   = {ACM Transactions on Design Automation of Electronic Systems},
  volume    = {20},
  number    = {1},
  pages     = {6:1--6:14},
  month     = {november},
  year      = {2014},
  doi       = {10.1145/2661632},
  abstract  = {The use of nanoscale technologies to create electronic devices 
		has revived interest in the use of regular structures for 
		defining complex logic functions. One such structure is the 
		switching lattice, a two-dimensional lattice of four-terminal 
		switches. We show how to directly construct switching lattices 
		of polynomial size from arbitrary logic functions; we also show
		how to synthesize minimal-sized lattices by translating the 
		problem to the satisfiability problem for a restricted class of
		quantified Boolean formulas. The synthesis method is an anytime
		algorithm which uses modern SAT solving technology and 
		dichotomic search. It improves considerably on an earlier 
		proposal for creating switching lattices for arbitrary logic 
		functions.},
  keywords  = {Boolean logic, Logic circuits, Circuit synthesis},
}



@Techreport{Garcia_TR95,
  author      = {Maria {Garc{\'\i}a de la Banda} and 
		Kim Marriott and
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title       = {Improved Analysis of Logic Programs Using a Differential
		Approach},
  number      = {95/15},
  institution = {Department of Computer Science, The University of Melbourne},
  year        = {1995},
  abstract    = {Abstract interpretation based program analysis has proven
		very useful in compilation of constraint and logic programming
		languages. Unfortunately, existing theoretical frameworks are 
		inherently imprecise. This is because of the way the frameworks
		handle call and return from an atom evaluation---in effect the 
		same information may be added twice, leading to a loss of 
		precision in many description domains. For this reason some 
		implementations use seemingly \emph{ad hoc} tricks. Here we 
		formalize these tricks and suggest three methods for overcoming
		this loss of precision. Experimental and theoretical results 
		indicate that use of these methods leads to more accurate and 
		faster analyses for little extra implementation effort.},
  keywords  = {Abstract interpretation, Logic programming},
}



@article{Gar-Mar-Stu-Son_JLP98,
  author    = {Maria {Garc{\'\i}a de la Banda} and 
		Kim Marriott and
		Peter J. Stuckey and 
		Harald S{\o}ndergaard},
  title     = {Differential Methods in Logic Program Analysis},
  journal   = {Journal of Logic Programming},
  volume    = {35},
  number    = {1},
  pages     = {1--37},
  year      = {1998},
  doi       = {10.1016/s0743-1066(97)10002-4},
  abstract  = {Program analysis based on abstract interpretation has proven
		very useful in compilation of constraint and logic programming
		languages. Unfortunately, the traditional goal-dependent 
		framework is inherently imprecise. This is because it handles 
		call and return in such a way that dataflow information may be 
		re-asserted unnecessarily, leading to a loss of precision for
		many description domains. For a few specific domains, the 
		literature contains proposals to overcome the problem, and some
		implementations use various unpublished tricks that sometimes 
		avoid the precision loss. The purpose of this paper is to map 
		the landscape of goal-dependent, goal-independent, and combined
		approaches to generic analysis of logic programs. This includes
		formalising existing methods and tricks in a way that is 
		independent of specific description domains. Moreover, we 
		suggest new methods for overcoming the loss of 
		precision---altogether eight different semantics are 
		considered and compared. We provide theoretical results 
		determining the relative accuracy of the approaches. These 
		show that two of our new semantics are uniformally more 
		accurate than existing approaches. Experiments that we have 
		performed (for two description domains) with implementations 
		of the eight different approaches enable a discussion of their
		relative runtime performances. We discuss the expected effect 
		on other domains as well and conclude that our new methods 
		can be trusted to yield significantly more accurate analysis 
		for a small extra implementation effort, without compromising 
		the efficiency of analysis.},
  keywords  = {Abstract interpretation, Logic programming, Sharing analysis},
}



@Inproceedings{Gly-Son_ACSC99,
  author    = {Kevin Glynn and 
		Harald S{\o}ndergaard},
  title     = {Immediate Fixpoints for Strictness Analysis},
  editor    = {J. Edwards},
  booktitle = {Proceedings of the 22nd Australasian Computer Science 
		Conference},
  series    = {Australian Computer Science Communications},
  volume    = {21},
  number    = {1},
  year      = {1999},
  pages     = {336--347},
  publisher = {Springer},
  abstract  = {This paper is concerned with the problem of finding fixpoints
                without resorting to Kleene iteration. In many cases, a simple
		syntactic test suffices to establish that a closed form can be 
		found without iteration. For example, if the function $F$, 
		whose fixpoint we want to determine, is idempotent, then its 
		least fixpoint is simply the instantiation $F(0)$, where $0$ 
		is the least element of the lattice. In many cases, idempotence
		can be gleaned easily from $F$'s definition. In other cases, 
		simple symbolic manipulation of a recursive definition may 
		reveal shortcuts to a closed form. We explore such cases and 
		show how the faster fixpoint calculation can have applications
		in strictness analysis.},
  keywords  = {Fixed points, Strictness analysis, Functional programming},
}



@Inproceedings{Gly-Stu-Sul-Son_ICFP02,
  author    = {Kevin Glynn and 
		Peter J. Stuckey and 
		Martin Sulzmann and
		Harald S{\o}ndergaard},
  title     = {Exception Analysis for Non-Strict Languages},
  booktitle = {Proceedings of the 2002 ACM SIGPLAN International Conference on
        	Functional Programming},
  pages     = {98--109},
  publisher = {ACM Press},
  year      = {2002},
  doi       = {10.1145/581478.581488},
  abstract  = {In this paper we present the first exception analysis
		for a non-strict language. We augment a simply-typed 
		functional language with exceptions, and show that we 
		can define a type-based inference system to detect 
		uncaught exceptions. We have implemented this exception
		analysis in the GHC compiler for Haskell, which has been
		recently extended with exceptions. We give empirical 
		evidence that the analysis is practical.},
  keywords  = {Exception analysis, Functional programming},
}



@Inproceedings{Gly-Stu-Sul-Son_PADO01,
  author    = {Kevin Glynn and 
		Peter J. Stuckey and 
		Martin Sulzmann and
		Harald S{\o}ndergaard},
  title     = {Boolean Constraints for Binding-Time Analysis},
  editor    = {O. Danvy and A. Filinsky},
  booktitle = {Programs as Data Objects: Proceedings of the Second Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {2053},
  pages     = {39--63},
  publisher = {Springer},
  year      = {2001},
  doi       = {10.1007/3-540-44978-7_4},
  abstract  = {To achieve acceptable accuracy, many program analyses for
		functional programs are ``property polymorphic''.
		That is, they can infer different input-output relations 
		for a function at separate applications of the function, 
		in a manner similar to type inference for a polymorphic 
		language. We extend a property polymorphic (or ``polyvariant'')
		method for binding-time analysis, due to Dussart, Henglein, 
		and Mossin, so that it applies to languages with ML-style 
		type polymorphism. The extension is non-trivial 
		and we have implemented it for Haskell. While we follow 
		others in specifying the analysis as a non-standard type
		inference, we argue that it should be realised through a 
		translation into the well-understood domain of Boolean 
		constraints. The expressiveness offered by Boolean 
		constraints opens the way for smooth extensions to 
		sophisticated language features and it allows for 
		more accurate analysis.},
  keywords  = {Boolean logic, Binding-time analysis, Haskell},
}



@InProceedings{Gru-Mof-Son-Zob_ACE04,
  author    = {Paul Gruba and 
		Alistair Moffat and 
		Harald S{\o}ndergaard and 
		Justin Zobel},
  title     = {What Drives Curriculum Change?},
  editor    = {R. Lister and A. Young},
  booktitle = {Proceedings of the Sixth Australasian Computing
                        Education Conference (ACE2004)},
  location  = {Dunedin, New Zealand},
  pages     = {109--117},
  month     = {jan},
  year      = {2004},
  abstract  = {While promotional literature about computer science programs 
		may claim that curricula are determined by the needs of the 
		students and by international best practice, the reality is 
		often different. In this paper we reflect on the factors 
		underlying curriculum change in computer science departments 
		and schools, from institutional requirements and financial 
		pressures to purely academic considerations. We have used 
		these reflections as the basis of an investigation of 
		curriculum management practices at institutions in Australasia,
		via a survey instrument sent to a range of colleagues. Our 
		findings from the survey are consistent with our own 
		experiences, namely, that curriculum change is driven or 
		inhibited by factors such as vocal individuals and practical
		constraints rather than higher academic motives.},
  keywords  = {Education, Computer science curricula},
}



@InProceedings{Gru-Son_ACSC00,
  author    = {Paul Gruba and 
		Harald S{\o}ndergaard},
  title     = {Transforming Communication Skills Instruction:
                        The Conference Approach},
  editor    = {J. Edwards},
  booktitle = {Proceedings of the 23rd Australasian Computer Science 
		Conference},
  series    = {Australian Computer Science Communications 22},
  number    = {1},
  pages     = {88--94},
  year      = {2000},
  publisher = {IEEE Computer Society},
  location  = {Canberra, Australia},
  doi       = {10.1109/ACSC.2000.824385},
  abstract  = {From the social constructivist perspective of education, 
		learning is best achieved when students face complex, real 
		world problems in which there are no clear answers. Faced with
		a sizable common goal, students work collaboratively towards 
		outcomes and maintain ownership over key decisions. The role 
		of staff is that of facilitators whose role is to challenge 
		learners to explore multiple aspects of the problem as they go 
		about reaching viable solutions. Such a role contrasts, for 
		example, to an approach which sets out to lead students to a 
		presumed correct solution that is already possessed by the
		instructor. Based on these principles we designed and 
		implemented a course on communication skills in Computer 
		Science. Here, we describe our experiences using a student-run 
		conference as a means to teach communication skills. In this 
		approach, students were charged with the task of planning and 
		organising a conference, including peer review, publicity, 
		budget, sponsorship, web design, conference program, 
		presentation schedule, speaker support, and catering.
		We describe the principles and their implementation and 
		reflect on the outcome.},
  keywords  = {Education, Communication skills instruction},
}



@Article{Gru-Son_CSE01,
  author    = {Paul Gruba and 
		Harald S{\o}ndergaard},
  title     = {A Constructivist Approach to Communication Skills Instruction 
		in Computer Science},
  journal   = {Computer Science Education},
  volume    = {11},
  number    = {3},
  pages     = {203--219},
  year      = {2001},
  doi       = {10.1076/csed.11.3.203.3833},
  abstract  = {From the social constructivist perspective of education, 
		learning is best achieved when students face complex, real 
		world problems in which there are no clear answers. Faced with
		a sizable common goal, students work collaboratively towards 
		outcomes and maintain ownership over key decisions. The role 
		of staff is that of facilitators whose role is to challenge l
		earners to explore multiple aspects of the problem as they go 
		about reaching viable solutions. Such a role contrasts, for 
		example, to an approach which sets out to lead students to a 
		presumed correct solution that is already possessed by the
		instructor. Based on these principles we designed and 
		implemented a course on communication skills in Computer 
		Science. Here, we describe our experiences using a student-run 
		conference as a means to teach communication skills. In this 
		approach, students were charged with the task of planning and 
		organising a conference, including peer review, publicity, 
		budget, sponsorship, web design, conference program, 
		presentation schedule, speaker support, and catering. We 
		describe the principles and their implementation and reflect 
		on the outcome.},
  keywords  = {Education, Communication skills instruction},
}



@Inproceedings{Han-Sch-Son_RV09,
  author    = {Trevor Hansen and 
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {State Joining and Splitting for the Symbolic Execution 
		of Binaries},
  editor    = {S. Bensalem and D. A. Peled},
  booktitle = {Runtime Verification},
  series    = {Lecture Notes in Computer Science},
  volume    = {5779},
  pages     = {76--92},
  publisher = {Springer},
  year      = {2009},
  doi       = {10.1007/978-3-642-04694-0_6},
  abstract  = {Symbolic execution can be used to explore the possible run-time 
		states of a program. It makes use of a concept of ``state'' 
		where a variable's value has been replaced by an expression 
		that gives the value as a function of program input. 
		Additionally, a state can be equipped with a summary of 
		control-flow history: a ``path constraint'' keeps track of the
		class of inputs that would have caused the same flow of control.
		But even simple programs can have trillions of paths, so a 
		path-by-path analysis is impractical. We investigate a 
		``state joining'' approach to making symbolic execution more 
		practical and describe the challenges of applying state joining
		to the analysis of unmodified Linux x86 executables. The results
		so far are mixed, with good results for some code. On other
		examples, state joining produces cumbersome constraints that 
		are more expensive to solve than those generated by normal 
		symbolic execution.},
  keywords  = {Symbolic execution},
}



@InProceedings{Hen-Sch-Son-Whi_CATS09,
  author    = {Kevin Henshall and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Leigh Whiting},
  title     = {Boolean Affine Approximation with Binary Decision Diagrams},
  editor    = {R. Downey and P. Manyem},
  booktitle = {Theory of Computing 2009},
  series    = {Conferences in Research and Practice in Information Technology},
  volume    = {94},
  pages     = {121--129},
  year      = {2009},
  url       = {http://crpit.com/Vol94.html},
  abstract  ={Selman and Kautz's work on knowledge compilation has
		established how approximation (strengthening and/or
		weakening) of a propositional knowledge-base can be used to
		speed up query processing, at the expense of completeness.
		In the classical approach, the knowledge-base is assumed
		to be presented as a propositional formula in conjunctive
		normal form (CNF), and Horn functions are used to over-
		and under-approximate it (in the hope that many queries
		can be answered efficiently using the approximations only).
		However, other representations are possible, and functions
		other than Horn can be used for approximations, as long
		as they have deduction-computational properties similar to
		those of the Horn functions. Zanuttini has suggested that
		the class of affine Boolean functions would be especially
		useful in knowledge compilation and has presented various
		affine approximation algorithms. Since CNF is awkward
		for presenting affine functions, Zanuttini considers both
		a sets-of-models representation and the use of modulo 2
		congruence equations. Here we consider the use of reduced
		ordered binary decision diagrams (ROBDDs), a representation
		which is more compact than the sets of models and which
		(unlike modulo 2 congruences) can express any source
		knowledge-base. We present an ROBDD algorithm to find
		strongest affine upper-approximations of a Boolean function
		and we argue its correctness.},
  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, ROBDDs},
}



@article{Hen-Sch-Son-Whi_CJTCS10,
  author    = {Kevin Henshall and 
		Peter Schachte and 
		Harald S{\o}ndergaard and
		Leigh Whiting},
  title     = {An Algorithm for Affine Approximation of Binary Decision 
		Diagrams},
  journal   = {Chicago Journal of Theoretical Computer Science},
  volume    = {2010},
  number    = {11},
  publisher = {University of Chicago},
  month     = {June},
  year      = {2010},
  doi       = {10.4086/cjtcs.2010.011},
  abstract  = {This paper is concerned with the problem of Boolean approximation
		in the following sense: given a Boolean function class and an
		arbitrary Boolean function, what is the function's best proxy in
		the class? Specifically, what is its strongest logical 
		consequence (or \emph{envelope}) in the class of \emph{affine} 
		Boolean functions. We prove various properties of affine Boolean
		functions and their representation as ROBDDs. Using these 
		properties, we develop an ROBDD algorithm to find the affine 
		envelope of a Boolean function.},
  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation},
}



@InProceedings{Her-Sch-Son_CATS06,
  author    = {Brian Herlihy and 
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {Boolean Equation Solving as Graph Traversal},
  editor    = {J. Gudmundsson and B. Jay},
  booktitle = {Theory of Computing 2006},
  series    = {Conferences in Research and Practice in Information Technology},
  volume    = {51},
  pages     = {123--132},
  year      = {2006},
  url       = {http://crpit.com/Vol51.html},
  abstract  = {We present a new method for finding closed forms of recursive 
		Boolean function definitions. Traditionally, these closed forms
		are found by iteratively approximating until a fixed point is 
		reached. Conceptually, our new method replaces each $k$-ary 
		function by $2^k$ Boolean variables defined by mutual recursion.
		The introduction of an exponential number of variables is 
		mitigated by the simplicity of their definitions and by the use
		of a novel variant of ROBDDs to avoid repeated computation.
		Experimental evaluation suggests that this approach is 
		significantly faster than Kleene iteration for examples that 
		would require many Kleene iteration steps.},
  keywords  = {Fixed points, ROBDDs},
}



@Article{Her-Sch-Son_IJFCS07,
  author    = {Brian Herlihy and 
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {Un-{Kleene} {Boolean} Equation Solving},
  journal   = {International Journal on Foundations of Computer Science},
  volume    = {18},
  number    = {2},
  pages     = {227--250},
  year      = {2007},
  doi       = {10.1142/S0129054107004668},
  abstract  = {We present a new method for finding closed forms of recursive 
		Boolean function definitions. Traditionally, these closed forms
		are found by Kleene iteration: iterative approximation until a 
		fixed point is reached. Conceptually, our new method replaces 
		each $k$-ary function by $2^k$ Boolean constants defined by 
		mutual recursion. The introduction of an exponential number of
		constants is mitigated by the simplicity of their definitions 
		and by the use of a novel variant of ROBDDs to avoid repeated 
		computation. Experiments suggest that this approach is 
		significantly faster than Kleene iteration for examples that 
		require many Kleene iteration steps.},
  keywords  = {Fixed points, ROBDDs},
}



@Inproceedings{Joh-Mof-Son-Stu_ACSE96,
  author    = {Roy Johnston and 
		Alistair Moffat and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title	    = {Low-Contact Learning in a First Year Programming Course},
  editor    = {J. Rosenberg},
  booktitle = {Proceedings of the First Australasian Conference on 
		Computer Science Education},
  pages     = {19--26},
  publisher = {ACM Press},
  year      = {1996},
  location  = {Sydney, Australia},
  doi       = {10.1145/369585.369589},
  abstract  = {Very large class sizes for introductory programming subjects pose
		a variety of problems, logistic and pedagogic.
		In response to these problems, we are experimenting with 
		low-contact streams in a class of 750 first year students.
		Motivated and disciplined students are offered the alternative 
		of fewer lectures and tutorials, that is, less direct contact, 
		in return for more (compulsory) homework and increased 
		feed-back, that is, more indirect contact.
		With a home computer and a link to the University, such 
		students can take the subject with more flexible timetabling.
		We provide material to support the higher degree of self-study 
		and tools for students to monitor their own progress.
		This paper describes how the low-contact streams are organised 
		and discusses the advantages and disadvantages of the approach.
		A thorough evaluation is not possible yet, but our initial 
		impression is that both traditional and self-paced students 
		benefit---the traditional students are better catered for in 
		a course that is pitched at a slightly lower and less 
		challenging level, and the self-paced students respond to the 
		challenge and extend themselves in a manner that might not 
		occur in a large lecture group.},
  keywords  = {Education},
}



@Article{Jon-Ses-Son_LASC89,
  author    = {Neil D. Jones and 
		Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in
		Compiler Generation},
  journal   = {Lisp and Symbolic Computation},
  volume    = {2},
  number    = {1},
  pages     = {9--50},
  year      = {1989},
  doi       = {10.1007/BF01806312},
  abstract  = {The program transformation principle called partial 
		evaluation has interesting applications in compilation
		and compiler generation. Self-applicable partial evaluators
		may be used for transforming interpreters into corresponding
		compilers and even for the generation of compiler generators.
		This is useful because interpreters are significantly easier
		to write than compilers, but run much slower than compiled
		code. A major difficulty in writing compilers (and compiler
		generators) is the thinking in terms of distinct binding
		times: run time and compile time (and compiler generation
		time). The paper gives an introduction to partial
		evaluation and describes a fully automatic though 
		experimental partial evaluator, called mix, able to generate
		stand-alone compilers as well as a compiler generator.
		Mix partially evaluates programs written in Mixwell,
		essentially a first-order subset of statically scoped pure
		Lisp. For compiler generation purposes it is necessary
		that the partial evaluator be self-applicable. Even though
		the potential utility of a self-applicable partial evaluator
		has been recognized since 1971, a 1984 version of mix
		appears to be the first successful implementation.
		The overall structure of mix and the basic ideas behind its
		way of working are sketched. Finally, some results of using
		a version of mix are reported.},
  keywords  = {Partial evaluation, Program transformation, Compilation},
}



@Incollection{Jon-Ses-Son_RTA85,
  author    = {Neil D. Jones and 
		Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {An Experiment in Partial Evaluation:
			The Generation of a Compiler Generator},
  editor    = {J.-P. Jouannaud},
  booktitle = {Rewriting Techniques and Applications},
  series    = {Lecture Notes in Computer Science},
  volume    = {202},
  pages     = {124--140},
  publisher = {Springer-Verlag},
  year      = {1985},
  note      = {Reviewed in Computing Reviews 27(7): 353, 1986},
  doi       = {10.1007/3-540-15976-2_6},
  keywords  = {Partial evaluation, Program transformation, Compilation},
}



@Article{Jon-Ses-Son_SIGPLANN85,
  author    = {Neil D. Jones and 
		Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {An Experiment in Partial Evaluation: The Generation of a 
		Compiler Generator (Extended Abstract)},
  journal   = {SIGPLAN Notices},
  volume    = {20},
  number    = {8},
  pages     = {82--87},
  year      = {1985},
  doi       = {10.1145/988346.988358},
  keywords  = {Partial evaluation, Program transformation, Compilation},
}



@Incollection{Jon-Ses-Son_mix-abstract87,
  author    = {Neil D. Jones and 
		Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in
		Compiler Generation---Extended Abstract},
  editor    = {M. Main et al.},
  booktitle = {Mathematical Foundations of Programming Language Semantics},
  series    = {Lecture Notes in Computer Science},
  volume    = {298},
  publisher = {Springer-Verlag},
  pages     = {386--413},
  year      = {1987},
  doi       = {10.1007/3-540-19020-1_21},
  keywords  = {Partial evaluation, Program transformation, Compilation},
}



@Incollection{Jon-Son_absint87,
  author    = {Neil D. Jones and 
		Harald S{\o}ndergaard},
  title     = {A Semantics-Based Framework for the Abstract Interpretation of 
		{Prolog}},
  editor    = {S. Abramsky and C. Hankin},
  booktitle = {Abstract Interpretation of Declarative Languages},
  chapter   = {6},
  pages     = {123--142},
  publisher = {Ellis Horwood},
  year      = {1987},
  keywords  = {Abstract interpretation, Logic programming, Prolog, Groundness analysis, Sharing analysis},
}



@article{Kaf-Gal-Gan-Sch-Son-Stu_TPLP18,
  author    = {Bishoksan Kafle and 
		John Gallagher and 
		Graeme Gange and 
		Peter Schachte and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {An Iterative Approach to Precondition Inference Using
                Constrained {Horn} Clauses},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {18},
  pages     = {553--570},
  year      = {2018},
  doi       = {10.1017/S1471068418000091},
  abstract  = {We present a method for automatic inference of conditions on 
		the initial states of a program that guarantee that the safety 
		assertions in the program are not violated. Constrained Horn 
		clauses (CHCs) are used to model the program and assertions in 
		a uniform way, and we use standard abstract interpretations to 
		derive an over-approximation of the set of unsafe initial states.
		The precondition then is the constraint corresponding to the 
		complement of that set, under-approximating the set of safe 
		initial states. This idea of complementation is not new, but 
		previous attempts to exploit it have suffered from loss of 
		precision. Here we develop an iterative specialisation algorithm
		to give more precise, and in some cases optimal safety 
		conditions. The algorithm combines existing transformations, 
		namely constraint specialisation, partial evaluation and a 
		trace elimination transformation. The last two of these 
		transformations perform polyvariant specialisation, leading 
		to disjunctive constraints which improve precision. The 
		algorithm is implemented and tested on a benchmark suite of 
		programs from the literature in precondition inference and 
		software verification competitions.},
  keywords  = {Program verification, Horn clauses, Program transformation, Partial evaluation},
}



@inproceedings{Kaf-Gan-Sch-Son-Stu_SAT17,
  author    = {Bishoksan Kafle and 
		Graeme Gange and 
		Peter Schachte and
                Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A {Benders} Decomposition Approach to Deciding Modular
                Linear Integer Arithmetic},
  editor    = {S. Gaspers and T. Walsh},
  booktitle = {Theory and Applications of Satisfiability Testing (SAT 2017)},
  series    = {Lecture Notes in Computer Science},
  volume    = {10491},
  pages     = {380--397},
  publisher = {Springer International Publishing},
  year      = {2017},
  doi       = {10.1007/978-3-319-66263-3_24},
  abstract  = {Verification tasks frequently require deciding systems of 
		linear constraints over modular (machine) arithmetic. 
		Existing approaches for reasoning over modular arithmetic 
		use bit-vector solvers, or else approximate machine integers 
		with mathematical integers and use arithmetic solvers. 
		Neither is ideal; the first is sound but inefficient, and the 
		second is efficient but unsound. We describe a linear encoding 
		which correctly describes modular arithmetic semantics, 
		yielding an optimistic but sound approach. Our method 
		abstracts the problem with linear arithmetic, but 
		progressively refines the abstraction when modular semantics 
		is violated. This preserves soundness while exploiting the 
		mostly integer nature of the constraint problem. We present 
		a prototype implementation, which gives encouraging 
		experimental results.},
  keywords  = {Program verification, Constraint solving, Machine arithmetic},
}



@Article{Kaf-Gan-Sch-Son-Stu_SoSyM24,
  author    = {Bishoksan Kafle and 
		Graeme Gange and 
		Peter Schachte and
		Harald S{\o}ndergaard and
		Peter J. Stuckey},
  title     = {A Lightweight Approach to Nontermination Inference Using
	  	{Constrained} {Horn} {Clauses}},
  journal   = {Software and Systems Modeling},
  volume    = {23},
  pages     = {319--342},
  year      = {2024},
  doi       = {10.1007/s10270-024-01161-5},
  abstract  = {Nontermination is an unwanted program property for some 
	  	software systems, and a safety property for other systems.
		In either case, automated discovery of preconditions for 
		nontermination is of interest. We introduce \textsc{NtHorn},
		a fast lightweight nontermination analyser, which is able to
		deduce non-trivial sufficient conditions for nontermination.
		Using Constrained Horn Clauses (CHCs) as a vehicle, we show 
		how established techniques for CHC program transformation 
		and abstract interpretation can be exploited for the purpose
		of nontermination analysis. \textsc{NtHorn} is comparable in 
		effectiveness to the state-of-the-art nontermination analysis
		tools, as measured on standard competition benchmark suites 
		(consisting of integer manipulating programs), while typically
		solving problems faster by one order of magnitude.},
}



@InProceedings{Kaf-Gan-Sch-Son-Stu_SEFM21,
  author    = {Bishoksan Kafle and 
		Graeme Gange and 
		Peter Schachte and
		Harald S{\o}ndergaard and
		Peter J. Stuckey},
  title     = {Lightweight Non-Termination Inference with {CHCs}},
  editor    = {R. Calinescu and C. P{\u{a}}s{\u{a}}reanu},
  booktitle = {Software Engineering and Formal Methods},
  series    = {Lecture Notes in Computer Science},
  volume    = {13085},
  pages     = {383--402},
  year      = {2021},
  doi       = {10.1007/978-3-030-92124-8_22},
  abstract  = {Non-termination is an unwanted program property (considered a 
		bug) for some software systems, and a safety property for 
		other systems. In either case, automated discovery of 
		preconditions for non-termination is of interest. We introduce
		\textsc{NtHorn}, a fast lightweight non-termination analyser,
		able to deduce non-trivial sufficient conditions for 
		non-termination. Using Constrained Horn Clauses (CHCs) as a 
		vehicle, we show how established techniques for CHC program 
		transformation and abstract interpretation can be exploited 
		for the purpose of non-termination analysis. \textsc{NtHorn} 
		is comparable in power to the state-of-the-art
		non-termination analysis tools, as measured on standard 
		competition benchmark suites (consisting of integer 
		manipulating programs), while typically solving problems 
		an order of magnitude faster.},
  keywords  = {Program verification, Program transformation, Partial evaluation, Nontermination analysis, Horn clauses},
}



@article{Kaf-Gan-Stu-Sch-Son_TPLP21,
  author    = {Bishoksan Kafle and 
		Graeme Gange and 
		Peter J. Stuckey and
		Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {Transformation-Enabled Precondition Inference},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {21},
  pages     = {700--716},
  year      = {2021},
  doi       = {10.1017/S1471068421000272},
  abstract  = {Precondition inference is a non-trivial problem with 
		important applications in program analysis and verification. 
		We present a novel iterative method for automatically deriving 
		preconditions for the safety and unsafety of programs. 
		Each iteration maintains over-approximations of the set of 
		safe and unsafe initial states; which are used to partition 
		the program's initial states into those known to be safe, 
		known to be unsafe and unknown. We then construct revised 
		programs with those unknown initial states and iterate the 
		procedure until the approximations are disjoint or some 
		termination criteria are met. An experimental evaluation of 
		the method on a set of software verification benchmarks shows 
		that it can infer precise preconditions (sometimes optimal) 
		that are not possible using previous methods.},
  keywords  = {Program verification, Program transformation},
}



@Inproceedings{Kel-Mac-Mar-Son-Stu-Yap_CP95,
  author    = {Andrew D. Kelly and 
		Andrew Macdonald and 
		Kim Marriott and
            	Harald S{\o}ndergaard and 
		Peter J. Stuckey and 
		Roland H. C. Yap},
  title     = {An Optimizing Compiler for {CLP(R)}},
  editor    = {U. Montanari and F. Rossi},
  booktitle = {Principles and Practice of Constraint Programming---CP'95},
  series    = {Lecture Notes in Computer Science},
  volume    = {976},
  pages     = {222--239},
  publisher = {Springer},
  year      = {1995},
  doi       = {10.1007/3-540-60299-2_14},
  abstract  = {The considerable expressive power and flexibility gained by 
		combining constraint programming with logic programming
		is not without cost. Implementations of constraint logic 
		programming (CLP) languages must include expensive constraint 
		solving algorithms tailored to specific domains, such as trees,
		Booleans, or real numbers. The performance of many current CLP
		compilers and interpreters does not encourage the widespread 
		use of CLP. We outline an optimizing compiler for 
		CLP(${\cal R}$), a CLP language which extends Prolog by 
		allowing linear arithmetic constraints. The compiler uses 
		sophisticated global analyses to determine the applicability of
		different program transformations. Two important components of 
		the compiler, the \emph{analyzer} and the \emph{optimizer}, 
		work in continual interaction in order to apply 
		semantics-preserving transformations to the source program.
		A large suite of transformations are planned. Currently the 
		compiler applies three powerful transformations, namely 
		``solver bypass'', ``dead variable elimination'' and
		``nofail constraint detection''. We explain these optimizations
		and their place in the overall compiler design and show how 
		they lead to performance improvements on a set of benchmark 
		programs.},
  keywords  = {Constraint programming, Logic programming, Static analysis, Program transformation, Compilation},
}



@Inproceedings{Kel-Mar-Son-Stu_ACSC97,
  author    = {Andrew D. Kelly and 
		Kim Marriott and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Generic Object-Oriented Incremental Analyser for Constraint
             	Logic Programs},
  editor    = {R. Kotagiri and J. Zobel},
  booktitle = {Proceedings of the 20th Australasian Computer Science Conference},
  series    = {Australian Computer Science Communications},
  volume    = {19},
  number    = {1},
  pages     = {92--101},
  year      = {1997},
  abstract  = {The incorporation of global program analysis into compilers 
		for constraint logic programming (CLP) languages has greatly
		improved the efficiency of these new languages. We present
		a global analyser based on abstract interpretation.  The 
		analyser is incremental, allowing substantial program 
		transformations by a compiler without requiring redundant
		re-computation of analysis data. The anayser is also
		generic in that it can perform a large number of different
		program analyses. Furthermore, the analyser has an 
		object-oriented design, enabling it to be easily adapted to
		different applications and allowing it to be used with various
		CLP languages. As an example of this generality, we outline 
		the analyser's role in two different applications each for a
		different CLP language: an optimizing compiler for CLP(R) 
		programs and an application for detecting occur-check problems
		in Prolog programs.},
  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},
}



@Inproceedings{Kel-Mar-Son-Stu_SAS96,
  author    = {Andrew D. Kelly and 
		Kim Marriott and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Two Applications of an Incremental Analysis Engine for
                (Constraint) Logic Programs (System Description)},
  editor    = {R. Cousot and D. A. Schmidt},
  booktitle = {Static Analysis: Proceedings of the Third International 
		Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {1145},
  pages     = {385--386},
  publisher = {Springer},
  year      = {1996},
  doi       = {10.1007/3-540-61739-6_55},
  keywords  = {Constraint programming, Logic programming, Prolog, Static analysis, Program transformation, Compilation},
}



@Article{Kel-Mar-Son-Stu_SPE98,
  author    = {Andrew D. Kelly and 
		Kim Marriott and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Practical Object-Oriented Analysis Engine for Constraint
                Logic Programs},
  journal   = {Software---Practice and Experience},
  volume    = {28},
  number    = {2},
  pages     = {199--224},
  year      = {1998},
  doi       = {10.1002/(SICI)1097-024X(199802)28:2<199::AID-SPE150>3.0.CO;2-4},
  abstract  = {The incorporation of global program analysis into recent 
		compilers for constraint logic programming (CLP) languages has 
		greatly improved the efficiency of these new languages. We 
		present a global analyzer based on abstract interpretation.
		Unlike traditional optimizers, whose designs tend to be ad hoc,
		the analyzer has been designed with maxiaml flexibility in
		mind. The analyzer is incremental, allowing substantial program
		transformations by a compiler without requiring redundant
		re-computation of analysis data. The anayser is also
		generic in that it can perform a large number of different
		program analyses. Furthermore, the analyzer has an
		object-oriented design, enabling it to be adapted to different
		applications and allowing it to be used with various CLP 
		languages with simple modifications. As an example of this 
		generality, we sketch the use of the analyzer in two different
		applications involving two different CLP languages: an 
		optimizing compiler for CLP(${\cal R}$) programs and an 
		application for detecting occur-check problems in Prolog 
		programs.},
  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},
}



@Inproceedings{Kin-Son_CAV08,
  author    = {Andy King and 
		Harald S{\o}ndergaard},
  title     = {Inferring Congruence Equations with {SAT}},
  editor    = {A. Gupta and S. Malik},
  booktitle = {Computer Aided Verification},
  series    = {Lecture Notes in Computer Science},
  volume    = {5123},
  pages     = {281--293},
  publisher = {Springer},
  year      = {2008},
  doi       = {10.1007/978-3-540-70545-1_26},
  abstract  = {This paper proposes a new approach for deriving invariants 
		that are systems of congruence equations where the modulo
		is a power of 2. The technique is an amalgam of SAT-solving,
		where a propositional formula is used to encode the semantics 
		of a basic block, and abstraction, where the solutions to the
		formula are systematically combined and summarised as a system
		of congruence equations. The resulting technique is more
		precise than existing congruence analyses since a single optimal
		transfer function is derived for a basic block as a whole.},
  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},
}



@Inproceedings{Kin-Son_VMCAI10,
  author    = {Andy King and 
		Harald S{\o}ndergaard},
  title     = {Automatic Abstraction for Congruences},
  editor    = {G. Barthe and M. Hermenegildo},
  booktitle = {Verification, Model Checking and Abstract Interpretation},
  series    = {Lecture Notes in Computer Science},
  volume    = {5944},
  pages     = {197--213},
  publisher = {Springer},
  year      = {2010},
  doi       = {10.1007/978-3-642-11319-2_16},
  abstract  = {One approach to verifying bit-twiddling algorithms is to derive 
		invariants between the bits that constitute the variables of a 
		program. Such invariants can often be described with systems
		of congruences where in each equation 
		$\vec{c} \cdot \vec{x} = d \mod m$, $m$ is a power of two, 
		$\vec{c}$ is a vector of integer coefficients, and $\vec{x}$ is
		a vector of propositional variables (bits). Because of the 
		low-level nature of these invariants and the large number of
		bits that are involved, it is important that the transfer 
		functions can be derived automatically. We address this problem,
		showing how an analysis for bit-level congruence relationships 
		can be decoupled into two parts:
		(1) a SAT-based abstraction (compilation) step which can be 
		automated, and
		(2) an interpretation step that requires no SAT-solving.
		We exploit triangular matrix forms to derive transfer functions
		efficiently, even in the presence of large numbers of bits. 
		Finally we propose program transformations that improve the 
		analysis results.},
  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},
}



@inproceedings{Lin-Mil-Son_APSEC16,
  author    = {Yude Lin and 
		Tim Miller and
		Harald S{\o}ndergaard},
  title     = {Compositional Symbolic Execution: Incremental Solving Revisited},
  editor    = {A. Potanin and G. Murphy},
  booktitle = {APSEC'16: Proceedings of the 23rd Asia-Pacific Software 
		Engineering Conference},
  pages     = {273--280},
  location  = {Hamilton, New Zealand},
  year      = {2016},
  doi       = {10.1109/APSEC.2016.046},
  abstract  = {Symbolic execution can automatically explore different execution
  		paths in a system under test and generate tests to precisely 
		cover them. It has two main advantages---being automatic and 
		thorough within a theory---and has many successful applications.
		The bottleneck of symbolic execution currently is the 
		computation consumption for complex systems. Compositional 
		Symbolic Execution (CSE) introduces a summarisation module to 
		eliminate the redundancy in the exploration of repeatedly 
		encountered code. In our previous work, we generalised the 
		summarisation for any code fragments instead of functions. 
		In this paper, we transplant this idea onto LLVM with many 
		additional features, one of them being the use of incremental 
		solving. We show that the combination of CSE and incremental 
		solving is mutually beneficial. The obvious weakness of CSE is 
		the lack of context during summarisation. We discuss the use
  		of assumption-based features, available in modern constraint
  		solvers, as a way to overcome this problem.},
  keywords  = {Symbolic execution, LLVM},
}



@inproceedings{Lin-Mil-Son_ASWEC15,
  author    = {Yude Lin and 
		Tim Miller and 
		Harald S{\o}ndergaard},
  title     = {Compositional Symbolic Execution Using Fine-Grained Summaries},
  booktitle = {Proceedings of the 24th Australasian Software Engineering
                Conference (ASWEC 2015)},
  pages     = {213--222},
  publisher = {IEEE Computing Society},
  year      = {2015},
  doi       = {10.1109/ASWEC.2015.32},
  url_Paper = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=7365810},
  abstract  = {Compositional symbolic execution has been proposed as a way to 
		increase the efficiency of symbolic execution. Essentially, 
		when a function is symbolically executed, a \emph{summary} of 
		the path that was executed is stored. This summary records the 
		precondition and postcondition of the path, and on subsequent 
		calls that satisfy that precondition, the corresponding 
		postcondition can be returned instead of executing the function
		again. However, using functions as the unit of summarisation 
		leaves the symbolic execution tool at the mercy of a program 
		designer, essentially resulting in an arbitrary summarisation 
		strategy. In this paper, we explore the use of 
		\emph{fine-grained} summaries, in which blocks \emph{within} 
		functions are summarised. We propose three types of 
		summarisation and demonstrate how to generate these. At such a 
		fine-grained level, symbolic execution of a path effectively 
		becomes the concatenation of the summaries along that path. 
		Using a prototype symbolic execution tool, we perform a 
		preliminary experimental evaluation of our summary approaches, 
		demonstrating that they can improve the speed of symbolic 
		execution by reducing the number of calls sent to the 
		underlying constraint solver.},
  keywords  = {Symbolic execution},
}



@Inproceedings{Mar-Son-Dar_NACLP90,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard and 
		Philip Dart},
  title	    = {A Characterization of Non-floundering Logic Programs},
  editor    = {S. Debray and M. Hermenegildo},
  booktitle = {Logic Programming: 
		Proceedings of the 1990 North American Conference},
  pages	    = {661--680},
  publisher = {MIT Press}, 
  year	    = {1990},
  abstract  = {SLDNF resolution provides an operational semantics which
		(unlike many Prolog implementations of negation) is both 
		computationally tractable and sound with respect to a 
		declarative semantics. However, SLDNF is not complete, and 
		it achieves soundness only by discarding certain queries to 
		programs because they ``flounder.''
		We present dataflow analyses that for a given normal logic 
		program detects (1) whether naive Prolog-style handling of 
		negation is sound and (2) whether SLDNF resolution avoids 
		floundering. The analyses are presented in a 
		language-independent framework of abstract interpretation based
		on denotational definitions. To our knowledge they are more 
		precise than any of their kind. In particular we obtain a 
		characterization of a class of non-floundering programs larger
		than any other that we know of.},
  keywords  = {Floundering analysis, Logic programming, Prolog},
}



@Article{Mar-Son-Jon_TOPLAS94,
  author    = {Kim Marriott and
		Harald S{\o}ndergaard and 
		Neil D. Jones},
  title     = {Denotational Abstract Interpretation of Logic Programs},
  journal   = {ACM Transactions on Programming Languages and Systems},
  volume    = {16},
  number    = {3},
  pages     = {607--648},
  year      = {1994},
  doi       = {10.1145/177492.177650},
  abstract  = {Logic programming languages are based on a principle of 
		separation of ``logic'' and ``control.'' This means that they
		can be given simple model-theoretic semantics without regard to
		any particular execution mechanism (or proof procedure, viewing
		execution as theorem proving). While the separation is desirable
		from a semantical point of view, it does, however, make sound, 
		efficient implementation of logic programming languages 
		difficult. The lack of ``control information'' in programs 
		calls for complex dataflow analysis techniques to guide 
		execution. Since dataflow analysis furthermore finds extensive 
		use in error-finding and transformation tools, there is a need 
		for a simple and powerful theory of dataflow analysis of logic 
		programs. The present paper offers such a theory, based on 
		F. Nielson's extension of P. and R. Cousot's abstract 
		interpretation. We present a denotational definition of the 
		semantics of definite logic programs. This definition is of 
		interest in its own right because of its compactness.
		Stepwise we develop the definition into a generic dataflow 
		analysis which encompasses a large class of dataflow analyses
		based on the SLD execution model. We exemplify one instance of
		the definition by developing a provably correct groundness 
		analysis to predict how variables may be bound to ground terms 
		during execution. We also discuss implementation issues and 
		related work.},
  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},
}



@Inproceedings{Mar-Son-Stu-Yap_ACSC94,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey and 
		Roland Yap},
  title	    = {Optimizing Compilation for {CLP(R)}},
  editor    = {G. Gupta},
  booktitle = {Proceedings of the 17th Australian Computer Science Conference},
  series    = {Australian Computer Science Communications},
  volume    = {16},
  number    = {1},
  pages     = {551--560},
  year	    = {1994},
  abstract  = {Constraint Logic Programming (CLP) is a recent innovation in
		programming language design. CLP languages extend logic
		programming by allowing constraints from different domains
		such as real numbers or Boolean functions. This gives
		considerable expressive power and flexibility and CLP
		programs have proven to be a high-level programming
		paradigm for applications based on interactive mathematical
		modelling. These advantages, however, are not without cost.
		Implementations of CLP languages must include expensive
		constraint solving algorithms tailored to the specific
		domains. Indeed, performance of the current generation of
		CLP compilers and interpreters is one of the main obstacles
		to the widespread use of CLP. Here we outline the design
		of a highly optimizing compiler for CLP($\Re$), a CLP
		language which extends Prolog by allowing linear arithmetic
		constraints. This compiler is intended to overcome the
		efficiency problems of the current implementation
		technology. The main innovation in the compiler is a
		comprehensive suite of program optimizations and associated
		global analyses which determine applicability of each
		optimization. We describe these optimizations and report
		very promising results from preliminary experiments.},
  keywords  = {Constraint programming, Logic programming, Compilation, Static analysis},
}
		


@Inproceedings{Mar-Son_GULP90,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Abstract Interpretation of Logic Programs:
			The Denotational Approach},
  editor    = {A. Bossi},
  booktitle = {Proceedings of the Fifth Italian Conference on Logic Programming},
  pages     = {399--425},
  organization = {Gruppo Ricercatori ed Utenti di Logic Programming,
			Padova, Italy}, 
  year	    = {1990},
  note	    = {Invited paper},
  abstract  = {Logic programming languages are based on a principle of 
		separation of ``logic'' and ``control.'' This means that 
		they can be given simple model-theoretic semantics
		without regard to any particular execution mechanism.
		While this is desirable from a semantical point of view, 
		it does make sound, efficient implementation of logic 
		programming languages difficult. The lack of ``control 
		information'' in programs calls for complex dataflow
		analyses to guide execution. Since dataflow analysis also 
		finds extensive use in error-finding and transformation 
		tools, there is a need for a simple and powerful theory
		of dataflow analysis of logic programs.
		We offer such a theory, inspired by F. Nielson's extension
		of P. and R. Cousot's \emph{abstract interpretation}.
		We then present a denotational definition of the semantics 
 		of definite logic programs. This definition is of interest 
		in its own right because of its novel application of 
		\emph{parametric substitutions} which makes it very compact
		and yet transparent. Stepwise we develop the definition 
		into a generic dataflow analysis which encompasses a large 
		class of dataflow analyses based on the SLD execution model.
		We exemplify one instance of the definition by developing a 
		provably correct groundness analysis to predict how 
		variables may be bound to ground terms during execution.
		We also discuss related work and other applications.},
  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},
}



@Inproceedings{Mar-Son_ICSC88,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title     = {Prolog Program Transformation by Introduction of 
		Difference Lists},
  booktitle = {Proceedings of the International Computer Science 
		Conference '88},
  pages     = {206--213},
  publisher = {IEEE Computer Society},
  location  = {Hong Kong},
  year      = {1988},
  keywords  = {Program transformation, Logic programming, Prolog},
}



@Inproceedings{Mar-Son_ICSLP88,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Bottom-Up Abstract Interpretation of Logic Programs},
  editor    = {R. A. Kowalski and K. A. Bowen},
  booktitle = {Logic Programming: Proceedings of the Fifth International 
		Conference and Symposium},
  pages	    = {733--748},
  publisher = {MIT Press}, 
  year	    = {1988},
  abstract  = {Abstract interpretation is useful in the design and 
		verification of dataflow analyses. Given a programming
		language and a fixpoint characterization of its semantics,
		abstract interpretation enables the explicit formulation
		of the relation between a dataflow analysis and the 
		semantics. A key notion in this is that of a ``collecting''
		semantics---an extension of the semantics that attaches
		information about run-time behaviour to program points.
	 	Different collecting semantics lead to different types of
		dataflow analysis. We present a novel collecting semantics 
		for normal logic programs. It is based on a Fitting-style 
		bottom-up semantics and forms a firm semantic base for
		bottom-up dataflow analyses. One such analysis, using
		descriptions similar to Sato and Tamaki's depth k
		abstractions, is detailed and shown to be sound with 
		respect to the collecting semantics. Its use in program
		specialization and termination analysis is demonstrated.},
  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Program transformation, Semantics, Termination analysis},
}



@Inproceedings{Mar-Son_IFIP89,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title     = {Semantics-Based Dataflow Analysis of Logic Programs},
  editor    = {G. X. Ritter},
  booktitle = {Information Processing 89},
  pages     = {601--606},
  publisher = {North-Holland},
  year      = {1989},
  abstract  = {The increased acceptance of Prolog has motivated widespread 
	 	interest in the semantics-based dataflow analysis of logic 
		programs and a number of different approaches have been 
		suggested. However, the relationships between these 
		approaches are not clear. The present paper provides a 
		unifying introduction to the approaches by giving novel 
		denotational semantic definitions which capture their 
		essence. In addition, the wide range of analysis tools 
		supported by semantics-based dataflow analysis are discussed.},
  keywords  = {Logic programming, Prolog, Static analysis, Semantics},
}



@Inproceedings{Mar-Son_ILPSworkshop93,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {On Propagation-Based Analysis of Logic Programs},
  editor    = {S. Michaylov and W. Winsborough},
  booktitle = {Proceedings of the ILPS 93 Workshop on Global Compilation,
			Vancouver, Canada},
  pages     = {47--65},
  year	    = {1993},
  abstract  = {Notions such as ``reexecution'' and ``propagation'' have recently
		attracted attention in dataflow analysis of logic programs. 
		Both techniques promise more accurate dataflow analysis without 
		requiring more complex description domains. Propagation, 
		however, has never been given a formal definition. It has 
		therefore been difficult to discuss properties such as 
		correctness, precision, and termination of propagation. 
		We suggest a definition of propagation. Comparing 
		propagation-based analysis with the more conventional
		approach based on abstract interpretation, we find that 
		propagation involves a certain inherent loss of precision 
		when dataflow analyses are based on description domains
		which are not ``downwards closed'' (including mode analysis).
		In the archetypical downwards closed case, groundness 
		analysis, we contrast approaches using Boolean functions as
		descriptions with those using propagation or reexecution.},
  keywords  = {Abstract interpretation, Boolean logic, Logic programming, Mode analysis, Groundness analysis},
}



@Article{Mar-Son_JLP92,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Bottom-Up Dataflow Analysis of Normal Logic Programs},
  journal   = {Journal of Logic Programming},
  volume    = {13},
  number    = {2 \& 3},
  pages	    = {181--204}, 
  year	    = {1992},
  doi       = {10.1016/0743-1066(92)90031-W},
  abstract  = {A theory of semantics-based dataflow analysis using a notion of
		``insertion'' is presented. This notion relaxes the Galois 
		connections used in P. and R. Cousot's theory of abstract 
		interpretation. The aim is to obtain a firm basis for the 
		development of dataflow analyses of normal logic programs.
		A dataflow analysis is viewed as a non-standard semantics that
		approximates the standard semantics by manipulating descriptions
		of data objects rather than the objects themselves. A Kleene 
		logic-based semantics for normal logic programs is defined, 
		similar to Fitting's $\Phi_P$ semantics. This provides the 
		needed semantic base for ``bottom-up'' dataflow analyses. 
		Such analyses give information about the success and failure 
		sets of a program. A major application of bottom-up analysis 
		is therefore type inference. We detail a dataflow analysis 
		using descriptions similar to Sato and Tamaki's depth $k$ 
		abstractions and another using Marriott, Naish and Lassez's
		``singleton'' abstractions. We show that both are sound with 
		respect to our semantics and outline various uses of the 
		analyses. Finally we justify our choice of semantics by showing
		that it is the most abstract of a number of possible semantics.
		This means that every analysis based on our semantics is 
		correct with respect to these other semantics, including 
		Kunen's semantics, SLDNF resolution, and the common (sound) 
		Prolog semantics.},
  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Semantics},
}



@Article{Mar-Son_LOPLAS93,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Precise and Efficient Groundness Analysis for Logic Programs},
  journal   = {ACM Letters on Programming Languages and Systems},
  volume    = {2},
  number    = {1--4},
  pages	    = {181--196},
  year	    = {1993},
  doi       = {10.1145/176454.176519},
  abstract  = {We show how precise groundness information can be extracted from
		logic programs. The idea is to use abstract interpretation with
		Boolean functions as ``approximations'' to groundness 
		dependencies between variables. This idea is not new, and 
		different classes of Boolean functions have been used. We argue,
		however, that one class, the \emph{positive} functions, is more 
		suitable than others. Positive Boolean functions have a certain
		property which we (inspired by A. Langen) call ``condensation.''
		This property allows for rapid computation of groundness 
		information.},
  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis},
}



@Inproceedings{Mar-Son_NACLP90,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Analysis of Constraint Logic Programs},
  editor    = {S. Debray and M. Hermenegildo},
  booktitle = {Logic Programming: 
		Proceedings of the 1990 North American Conference},
  pages	    = {531--547},
  publisher = {MIT Press}, 
  year	    = {1990},
  abstract  = {Increasingly, compilers for logic programs are making use 
		of information from dataflow analyses to aid in the generation
		of efficient target code. However, generating efficient target
		code from constraint logic programs is even more difficult than
		from logic programs. Thus we feel that good compilation of
		constraint logic programs will require sophisticated analysis 
		of the source code. Here we present a simple framework for
		the abstract interpretation of constraint logic programs
		which is intended to serve as the basis for developing such 
		analyses. We show the framework's practical usefulness by 
		sketching two dataflow analyses that are based on it
		and indicating how they can be used to improve the code 
		generated by a compiler.},
  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Semantics, Compilation},
}



@Article{Mar-Son_NGC93,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title	    = {Difference-List Transformation for {Prolog}},
  journal   = {New Generation Computing},
  volume    = {11},
  number    = {2},
  pages     = {125--157}, 
  year	    = {1993},
  doi       = {10.1007/BF03037156},
  abstract  = {Difference-lists are terms that represent lists.
		The use of difference-lists can speed up most list-processing 
		programs considerably. Prolog programmers routinely use 
		``difference-list versions'' of programs, but very little 
		investigation has taken place into difference-list 
		transformation. Thus, to most programmers it is either 
		unknown that the use of difference-lists is far from safe in 
		all contexts, or else this fact is known but attributed to 
		Prolog's infamous ``occur check problem.'' In this paper we 
		study the transformation of list-processing programs into 
		programs that use difference-lists. In particular we are 
		concerned with finding circumstances under which the 
		transformation is safe. We show that dataflow analysis can 
		be used to determine whether the transformation is applicable 
		to a given program, thereby allowing for automatic 
		transformation. We prove that our transformation preserves 
		strong operational equivalence.},
  keywords  = {Program transformation, Static analysis, Logic programming, Prolog},
}



@Article{Mar-Son_occur89,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title     = {On {Prolog} and the Occur Check Problem},
  journal   = {SIGPLAN Notices},
  volume    = {24},
  number    = {5},
  pages     = {76--82},
  year      = {1989},
  doi       = {10.1145/66068.66075},
  abstract  = {It is well known that omission of the occur check in 
		unification leads to unsound Prolog systems. Nevertheless,
	 	most Prolog systems omit the occur check because this
		makes unification much faster and unsoundness allegedly
		seldom manifests itself. We revisit the occur check
		problem and point to two aspects that have previously 
		received no attention. Firstly, ``unification without the
		occur check'' is ambiguous, and in practice, Prolog systems
		vary markedly in their reaction to programs having occur
		check problems. Secondly, even very simple program
		transformations are unsafe for pure Prolog when the occur
		check is omitted. We conclude that the occur check problem
		is important, and in particular, that the current effort to
		standardize Prolog should address it.},
  keywords  = {Logic programming, Prolog, Unification},
}



@Techreport{Mar-Son_success_patterns88,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title     = {On Describing Success Patterns of Logic Programs},
  number    = {88/12},
  institution = {Department of Computer Science, The University of Melbourne},
  year      = {1988},
  abstract  = {Sato and Tamaki's depth $k$ abstractions are reviewed, and their
		use as (finite) descriptions of (infinite) sets of expressions
		(terms and atomic formulas) is discussed. This leads to an
		investigation of other classes of expressions. A certain
		property of a class is identified as being sufficient for the
		existence of a Galois insertion from the class to the set of
		all expressions, and thus for abstract interpretation to be
		applicable. Sato and Tamaki's class does not have the property,
		but it is shown how it can be extended to a class having the
		property while still remaining finite.},
  keywords  = {Abstract interpretation, Abstract domains, Depth k analysis},
}



@Unpublished{Mar-Son_tutorial89,
  author    = {Kim Marriott and 
		Harald S{\o}ndergaard},
  title     = {Notes for a Tutorial on Abstract Interpretation of Logic 
		Programs},
  year      = {1989},
  note      = {Tutorial Notes for the 1989 North American Conference on 
		Logic Programming. Assocation for Logic Programming, 1989},
  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Unification, Semantics, Groundness analysis},
}



@Inproceedings{Men-Son-Ven_AAEE17,
  author    = {Antonette Mendoza and
		Harald S{\o}ndergaard and 
		Anne Venables},
  title     = {Making Sense of Learning Management System's Quiz Analytics
        	in Understanding Students' Learning Difficulties},
  booktitle = {Proceedings of the 28th Annual Conference of the
        	Australasian Association for Engineering Education (AAEE2017)},
  pages     = {112--119},
  location  = {Manly, New South Wales},
  publisher = {Australasian Association for Engineering Education},
  year      = {2017},
  keywords  = {Education},
}



@InProceedings{Mof-Hug-Son-Gru_ACE05,
  author    = {Alistair Moffat and 
		Baden Hughes and 
		Harald S{\o}ndergaard and 
		Paul Gruba},
  title     = {Making Connections: First Year Transition for Computer
		Science and Software Engineering Students},
  editor    = {A. Young and D. Tolhurst},
  booktitle = {Proceedings of the Seventh Australasian Computing Education 
		Conference (ACE2005)},
  series    = {Conferences in Research and Practice in Information Technology},
  volume    = {42},
  pages     = {229--238},
  year      = {2005},
  abstract  = {During the last decade, an increasing emphasis has been placed 
		on the need for carefully planned transition programs to help 
		first-year students integrate into university. In this paper 
		we critically examine our experiences in designing and running
		successive transition programs for Computer Science and 
		Software Engineering students. Over the last three years we 
		have trialled several models. At present, our program requires 
		all entering students to be enrolled in a transition subject,
		``Making Connections'', which runs for half a semester. The
		subject, led by designated academic staff, serves as a forum 
		for students to learn about each other, the department and the 
		university. The program includes a computer-based language and
		study skills assessment component, including self-assessment 
		tasks. Students can extend the subject by taking academic 
		skills workshops run by the university's student support 
		services. We have found compulsion to be a useful facilitator 
		of student engagement, and the addition of an objective 
		assessment task has been beneficial.},
  keywords  = {Education, Student transition programs},
}



@InProceedings{Nai-Son-Hor_CATS12,
  author    = {Lee Naish and 
		Harald S{\o}ndergaard and 
		Benjamin Horsfall},
  title     = {Logic Programming: From Underspecification to Undefinedness},
  editor    = {J. Mestre},
  booktitle = {Theory of Computing 2012},
  series    = {Conferences in Research and Practice in Information Technology},
  volume    = {128},
  pages     = {49--58},
  year      = {2012},
  url       = {http://crpit.com/Vol128.html},
  abstract  = {The semantics of logic programs was originally described in 
		terms of two-valued logic. Soon, however, it was realised that 
		three-valued logic had some natural advantages, as it provides 
		distinct values not only for truth and falsehood, but also for
		"undefined". The three-valued semantics proposed by Fitting and
		by Kunen are closely related to what is computed by a logic 
		program, the third truth value being associated with 
		non-termination. A different three-valued semantics, proposed 
		by Naish, shared much with those of Fitting and Kunen but 
		incorporated allowances for programmer intent, the third truth 
		value being associated with underspecification. Naish used an 
		(apparently) novel ``arrow'' operator to relate the intended 
		meaning of left and right sides of predicate definitions. In 
		this paper we suggest that the additional truth values of
		Fitting/Kunen and Naish are best viewed as duals. We use 
		Fitting's later four-valued approach to unify the two 
		three-valued approaches. The additional truth value has very 
		little affect on the Fitting three-valued semantics, though it
		can be useful when finding approximations to this semantics for
		program analysis. For the Naish semantics, the extra truth 
		value allows intended interpretations to be more expressive, 
		allowing us to verify and debug a larger class of programs. 
		We also explain that the "arrow" operator of Naish (and our 
		four-valued extension) is essentially the information ordering.
		This sheds new light on the relationships between 
		specifications and programs, and successive executions states 
		of a program.},
  keywords  = {Logic programming, Semantics, Many-valued logic},
}



@article{Nai-Son_TPLP14,
  author    = {Lee Naish and 
		Harald S{\o}ndergaard},
  title     = {Truth versus Information in Logic Programming},
  journal   = {Theory and Practice of Logic Programming},
  volume    = {14},
  number    = {6},
  pages     = {803--840},
  month     = {november},
  year      = {2014},
  url_Paper = {http://journals.cambridge.org/repo_A89XyMV9},
  doi       = {10.1017/S1471068413000069},
  abstract  = {The semantics of logic programs was originally described in 
		terms of two-valued logic. Soon, however, it was realised that
		three-valued logic had some natural advantages, as it provides 
		distinct values not only for truth and falsehood, but also for 
		``undefined''. The three-valued semantics proposed by Fitting 
		and by Kunen are closely related to what is computed by a 
		logic program, the third truth value being associated with 
		non-termination. A different three-valued semantics, proposed 
		by Naish, shared much with those of Fitting and Kunen but 
		incorporated allowances for programmer intent, the third truth 
		value being associated with underspecification. Naish used an 
		(apparently) novel ``arrow'' operator to relate the intended
		meaning of left and right sides of predicate definitions. In 
		this paper we suggest that the additional truth values of 
		Fitting/Kunen and Naish are best viewed as duals. We use 
		Belnap's four-valued logic, also used elsewhere by Fitting, 
		to unify the two three-valued approaches. The truth values are 
		arranged in a bilattice which supports the classical ordering 
		on truth values as well as the ``information ordering''. We 
		note that the ``arrow'' operator of Naish (and our four-valued
		extension) is essentially the information ordering, whereas the
		classical arrow denotes the truth ordering. This allows us to 
		shed new light on many aspects of logic programming, including 
		program analysis, type and mode systems, declarative debugging 
		and the relationships between specifications and programs, and 
		successive executions states of a program.},
  keywords  = {Logic programming, Semantics, Many-valued logic},
}



@InProceedings{Nav-Sch-Son-Stu_APLAS12,
  author    = {Jorge A. Navas and 
		Peter Schachte and 
		Harald S{\o}ndergaard and
		Peter J. Stuckey},
  title     = {Signedness-Agnostic Program Analysis: 
		Precise Integer Bounds for Low-Level Code},
  editor    = {R. Jhala and A. Igarashi},
  booktitle = {APLAS 2012: Proceedings of the 10th Asian Symposium 
        	on Programming Languages and Systems},
  series    = {Lecture Notes in Computer Science},
  volume    = {7705},
  pages     = {115--130},
  publisher = {Springer},
  year      = {2012},
  doi       = {10.1007/978-3-642-35182-2_9},
  abstract  = {Many compilers target common back-ends, thereby 
		avoiding the need to implement the same analyses 
		for many different source languages. This has led
		to interest in static analysis of LLVM code. 
		In LLVM (and similar languages) most signedness 
		information associated with variables has been 
		compiled away. Current analyses of LLVM code tend
		to assume that either all values are signed or all
		are unsigned (except where the code specifies the 
		signedness). We show how program analysis can 
		simultaneously consider each bit-string to be both 
		signed and unsigned, thus improving precision, 
		and we implement the idea for the specific case of 
		integer bounds analysis. Experimental evaluation
		shows that this provides higher precision at little
		extra cost. Our approach turns out to be beneficial
		even when all signedness information is available,
		such as when analysing C or Java code.},
  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},
}



@Article{Sch-Son-Whi-Hen_AIJ10,
  author    = {Peter Schachte and 
		Harald S{\o}ndergaard and 
		Leigh Whiting and
		Kevin Henshall},
  title     = {Information Loss in Knowledge Compilation: 
		A Comparison of {Boolean} Envelopes},
  journal   = {Artificial Intelligence},
  volume    = {174},
  number    = {9--10},
  pages     = {585--596},
  year      = {2010},
  doi       = {10.1016/j.artint.2010.03.003},
  abstract  = {Since Selman and Kautz's seminal work on the use of Horn 
		approximation to speed up the querying of knowledge bases, 
		there has been great interest in Boolean approximation for 
		AI applications. There are several Boolean classes with 
		desirable computational properties similar to those of the
		Horn class. The class of affine Boolean functions, for example,
		has been proposed as an interesting alternative to Horn for 
		knowledge compilation. To investigate the trade-offs between
		precision and efficiency in knowledge compilation, we compare, 
		analytically and empirically, four well-known Boolean classes,
		and their combinations, for ability to preserve information.
		We note that traditional evaluation which explores unit-clause
		consequences of random hard 3-CNF formulas does not tell the 
		full story, and we complement that evaluation with experiments 
		based on a variety of assumptions about queries and the 
		underlying knowledge base.},
  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, Artificial intelligence},
}



@Inproceedings{Sch-Son_SARA07,
  author    = {Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {Boolean Approximation Revisited},
  editor    = {I. Miguel and W. Ruml},
  booktitle = {Abstraction, Reformulation and Approximation:
         	Proceedings of {SARA} 2007},
  series    = {Lecture Notes in Artificial Intelligence},
  volume    = {4612},
  pages     = {329--343},
  publisher = {Springer},
  year      = {2007},
  doi       = {10.1007/978-3-540-73580-9_26},
  abstract  = {Most work to date on Boolean approximation assumes that
		Boolean functions are represented by formulas in
		conjunctive normal form. That assumption is appropriate 
		for the classical applications of Boolean approximation 
		but potentially limits wider use. We revisit, in a 
		lattice-theoretic setting, so-called envelopes and cores
		in propositional logic, identifying them with upper and
		lower closure operators, respectively. This leads to 
		recursive representation-independent characterisations
		of Boolean approximation for a large class of classes.
		We show that Boolean development can be applied in a 
		representation-independent setting to develop approximation
		algorithms for a broad range of Boolean classes, including
		Horn and Krom functions.},
  keywords  = {Boolean logic, Boolean approximation, Lattice theory},
}



@Inproceedings{Sch-Son_VMCAI06,
  author    = {Peter Schachte and 
		Harald S{\o}ndergaard},
  title     = {Closure Operators for {ROBDDs}},
  editor    = {E. A. Emerson and K. S. Namjoshi},
  booktitle = {Proceedings of the Seventh International Conference on
        	Verification, Model Checking and Abstract Interpretation},
  series    = {Lecture Notes in Computer Science},
  volume    = {3855},
  pages     = {1--16},
  publisher = {Springer},
  year      = {2006},
  doi       = {10.1007/11609773_1},
  abstract  = {Program analysis commonly makes use of Boolean functions to 
		express information about run-time states. Many important 
		classes of Boolean functions used this way, such as the
		monotone functions and the Boolean Horn functions, have
		simple semantic characterisations. They also have well-known 
		syntactic characterisations in terms of Boolean formulae, say,
		in conjunctive normal form. Here we are concerned with 
		characterisations using binary decision diagrams. Over the 
		last decade, ROBDDs have become popular as representations of 
		Boolean functions, mainly for their algorithmic properties.
		Assuming ROBDDs as representation, we address the following 
		problems: Given a function $\psi$ and a class of functions 
		$\class$, how to find the strongest $\varphi \in \class$ 
		entailed by $\psi$ (when such a $\varphi$ is known to exist)?
		How to find the weakest $\varphi \in \class$ that entails 
		$\psi$? How to determine that a function $\psi$ belongs to a 
		class $\class$? Answers are important, not only for several 
		program analyses, but for other areas of computer science, 
		where Boolean approximation is used. We give, for many commonly
		used classes $\class$ of Boolean functions, algorithms to 
		approximate functions represented as ROBDDs, in the sense 
		described above. The algorithms implement upper closure 
		operators, familiar from abstract interpretation.  They 
		immediately lead to algorithms for deciding class membership.},
  keywords  = {Boolean logic, Boolean approximation, ROBDDs},
}



@inproceedings{Ses-Son_PEPM24,
  author    = {Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {The Genesis of {Mix}: Early Days of Self-Applicable 
		Partial Evaluation (Invited Contribution)},
  editor    = {G. Keller and M. Wang},
  booktitle = {PEPM 2024: Proceedings of the 2024 ACM SIGPLAN International
        	Workshop on Partial Evaluation and Program Manipulation},
  pages     = {1--13},
  year      = {2024},
  doi       = {10.1145/3635800.3637445},
  abstract  = {Forty years ago development started on Mix, a partial evaluator
		designed specifically for the purpose of self-application.
		The effort, led by Neil D. Jones at the University of 
		Copenhagen, eventually demonstrated that non-trivial compilers
		could be generated automatically by applying a partial 
		evaluator to itself. The possibility, in theory, of such 
		self-application had been known for more than a decade, but
		remained unrealized by the start of 1984. We describe the 
		genesis of Mix, including the research environment, the 
		challenges, and the main insights that led to success. We 
		emphasize the critical role played by program annotation as a
		pre-processing step, a process that became automated in the 
		form of binding-time analysis.},
  keywords  = {Partial evaluation, Binding-time analysis, Compilation, History},
}



@Proceedings{Ses-Son_PEPM94,
  editor    = {Peter Sestoft and 
		Harald S{\o}ndergaard},
  title	    = {PEPM '94: Proceedings of the ACM SIGPLAN Workshop on Partial 
		Evaluation and Semantics-Based Program Manipulation},
  location  = {Orlando, Florida},
  year      = {1994},
  doi       = {10.1007/BF01019002},
  note	    = {Technical Report 94/9, Department of Computer Science, 
		The University of Melbourne},
  keywords  = {Partial evaluation, Program transformation, Static analysis},
}



@Article{Ses-Son_pebibl88,
  author    = {Peter Sestoft and 
		Harald S{\o}ndergaard},
  title     = {A Bibliography on Partial Evaluation},
  journal   = {SIGPLAN Notices},
  volume    = {23},
  number    = {2},
  pages     = {19--27},
  year      = {1988},
  doi       = {10.1145/43908.43910},
  abstract  = {This note gives a short introduction to partial evaluation 
		and an extensive, annotated bibliography to the field. 
		The bibliography is restricted to cover public-domain 
		literature in English.},
  keywords  = {Partial evaluation},
}



@Inproceedings{Son_ESOP86,
  author    = {Harald S{\o}ndergaard},
  title     = {An Application of Abstract Interpretation of Logic Programs:
		Occur Check Reduction},
  editor    = {B. Robinet and R. Wilhelm},
  booktitle = {Proceedings of the European Symposium on Programming---ESOP 86},
  series    = {Lecture Notes in Computer Science},
  volume    = {213},
  pages     = {327--338},
  publisher = {Springer-Verlag},
  year      = {1986},
  doi       = {10.1007/3-540-16442-1_25},
  abstract  = {The occur check in Robinson unification is superfluous in most 
		unifications that take place in practice. The present paper is 
		concerned with the problem of determining circumstances under 
		which the occur may safely be dispensed with. The method given 
		draws on one outlined by David Plaisted. The framework, 
		however, differs in that we systematically apply the abstract 
		interpretation principle to logic programs. The aim is to give
		a clear presentation and to facilitate justification of the 
		soundness of the method.},
  keywords  = {Abstract interpretation, Logic programming, Prolog, Unification},
}



@Phdthesis{Son_phd89,
  author    = {Harald S{\o}ndergaard},
  title	    = {Semantics-Based Analysis and Transformation of Logic Programs},
  school    = {University of Copenhagen, Denmark},
  year	    = {1989},
  note	    = {Also available as: Technical Report 89/21,
		Department of Computer Science, 
		The University of Melbourne, 1990,
		DIKU Report 89/22, Department of Computer Science, 
		University of Copenhagen, 1990,
		and Technical Report \#12,
		Key Center for Knowledge Based Systems,
		RMIT and the University of Melbourne, 1990},
  abstract  = {Dataflow analysis is an essential component of many programming 
		tools. One use of dataflow information is to identify errors in
		a program, as done by program ``debuggers'' and type checkers.
		Another is in compilers and other program transformers, where 
		the analysis may guide various optimisations.

		The correctness of a programming tool's dataflow analysis 
		component is usually of paramount importance. The theory of 
		abstract interpretation, originally developed by P. and R. 
		Cousot aims at providing a framework for the development of 
		correct analysis tools. In this theory, dataflow analysis is 
		viewed as ``non-standard'' semantics, and abstract 
		interpretation prescribes certain relations between standard
		and non-standard semantics, in order to guarantee the 
		correctness of the non-standard semantics with respect to the 
		standard semantics.

		The increasing acceptance of Prolog as a practical programming 
		language has motivated widespread interest in dataflow analysis
		of logic programs and especially in abstract interpretation.
		Logic programmming languages are attractive from a semantical 
		point of view, but dataflow analysis of logic programs is more 
		complex than that of more traditional programming languages, 
		since dataflow is bi-directional (owing to unification) and 
		control flow is in terms of backtracking.

		The present thesis is concerned with semantics-based dataflow 
		analysis of logic programs. We first set up a theory for 
		dataflow analysis which is basically that of abstract 
		interpretation as introduced by P. and R. Cousot. We do, 
		however, relax the classical theory of abstract interpretation
		somewhat, by giving up the demand for (unique) \emph{best} 
		approximations.

		Two different kinds of analysis of logic programs are then 
		identified: a \emph{bottom-up} analysis yields an approximation
		to the success set (and possibly the failure set) of a program,
		whereas a \emph{top-down} analysis yields an approximation to 
		the call patterns that would appear during an execution based 
		on SLD resolution. We investigate some of the uses of the two 
		kinds of analysis. In the bottom-up case, we pay special 
		attention to (bottom-up) type inference and its use in program 
		specialisation. In the top-down case, we present a generic 
		``dataflow semantics'' that encompasses many useful dataflow 
		analyses. As an instance of the generic semantics, a groundness
		analysis is detailed, and a series of other applications are 
		mentioned.

		We finally present a transformation technique, based on 
		top-down analysis, for introducing difference-lists in a 
		list-manipulating program, without changing the program's 
		semantics. This may lead to substantial improvement in a 
		program's execution time.},
  keywords  = {Abstract interpretation, Abstract domains, Logic programming, 
	  	Semantics, Many-valued logic, Unification, Groundness analysis,
		Program transformation},
}



@Inproceedings{Son_FSTTCS96,
  author    = {Harald S{\o}ndergaard},
  title     = {Immediate Fixpoints and Their Use in Groundness Analysis},
  editor    = {V. Chandru and V. Vinay},
  booktitle = {Foundations of Software Technology and 
		Theoretical Computer Science},
  series    = {Lecture Notes in Computer Science},
  volume    = {1180},
  pages     = {359--370},
  publisher = {Springer},
  year      = {1996},
  doi       = {10.1007/3-540-62034-6_63},
  abstract  = {A theorem by Schr{\"o}der says that for a certain natural 
		class of functions $F : B \rightarrow B$ defined on a Boolean 
		lattice $B$, $F(x) = F(F(F(x)))$ for all $x \in B$.
		An immediate corollary is that if such a function is monotonic 
		then it is also idempotent, that is, $F(x) = F(F(x))$.
		We show how this corollary can be extended to recognize cases
		where recursive definitions can immediately be replaced by an 
		equivalent closed form, that is, they can be solved without 
		Kleene iteration. Our result applies more generally to 
		distributive lattices. It has applications for example in the 
		abstract interpretation of declarative programs and deductive 
		databases. We exemplify this by showing how to accelerate 
		simple cases of strictness analysis for first-order functional 
		programs and, perhaps more successfully, groundness analysis 
		for logic programs.},
  keywords  = {Fixed points, Logic programming, Groundness analysis, Lattice theory},
}



@Proceedings{Son_PPDP01,
  editor    = {Harald S{\o}ndergaard},
  title     = {Principles and Practice of Declarative Programming},
  publisher = {ACM Press},
  year      = {2001},
  keywords  = {PPDP 2001, logic programming, functional programming},
}



@InProceedings{Son_ITiCSE09,
  author    = {Harald S{\o}ndergaard},
  title     = {Learning From and With Peers:
		The Different Roles of Student Peer Reviewing},
  booktitle = {Proceedings of the 14th Annual SIGCSE/SIGCUE Conference on
		Innovation and Technology in Computer Science Education},
  pages     = {31--35},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY},
  year      = {2009},
  location  = {Paris, France},
  doi       = {10.1145/3263191},
  abstract  = {There are many different approaches to student peer assessment.
		In this paper I lay out the pedagogical philosophy behind my 
		own use of student peer reviews. These should not only be 
		seen as adding to the amount of formative feedback in a class,
		nor are they only about the development of certain higher-order
		cognitive skills. Properly aligned with an overall assessment
		strategy, peer reviewing can help build a stronger learning 
		community. I describe such a strategy and my experience using
		PRAZE, an online tool for student peer reviewing, as well as 
		students' response to the tool and its use.},
  keywords  = {Education, Peer review},
}



@InProceedings{Son_LOPSTR21,
  author    = {Harald S{\o}ndergaard},
  title     = {String Abstract Domains and Their Combination},
  editor    = {E. {De Angelis} and W. Vanhoof},
  booktitle = {Logic-Based Program Synthesis and Transformation},
  series    = {Lecture Notes in Computer Science},
  volume    = {13290},
  pages     = {1--15},
  publisher = {Springer},
  year      = {2022},
  doi       = {10.1007/978-3-030-98869-2_1},
  abstract  = {We survey recent developments in string static analysis, with
		an emphasis on how string abstract domains can be combined.
		The paper has formed the basis for an invited presentation
		given to LOPSTR 2021 and PPDP 2021.},
  keywords  = {Abstract domains, String analysis},
}



@Proceedings{Son-Had_AAEE07,
  editor    = {Harald S{\o}ndergaard and 
		Roger Hadgraft},
  title     = {Proceedings of the 18th Conference of the 
		Australasian Association for Engineering Education},
  publisher = {Department of Computer Science and Software Engineering,
		The University of Melbourne, Vic 3010, Australia},
  month     = {December},
  year      = {2007},
  isbn      = {978--0--9757172--1--9},
  note      = {Published on CD-ROM and online},
  keywords  = {Education},
}



@article{Son-Mul_CSE12,
  author    = {Harald S{\o}ndergaard and 
		Raoul Mulder},
  title     = {Collaborative Learning through Formative Peer Review:
		Pedagogy, Programs and Potential},
  journal   = {Computer Science Education},
  volume    = {22},
  number    = {4},
  pages     = {343--367},
  year      = {2012},
  doi       = {10.1080/08993408.2012.728041},
  abstract  = {We examine student peer review, with an emphasis on 
		formative practice and collaborative learning, rather 
		than peer grading. Opportunities to engage students in 
		such formative peer assessment are growing, as a range 
		of online tools become available to manage and simplify 
		the process of administering student peer review. 
		We consider whether pedagogical requirements for student
		peer review are likely to be discipline-specific, taking
		computer science and software engineering as an example.
		We then summarise what attributes are important for a 
		modern generic peer review tool, and classify tools 
		according to four prevalent emphases, using currently 
		available, mature tools to illustrate each. We conclude 
		by identifying some gaps in current understanding of 
		formative peer review, and discuss how online tools for 
		student peer review can help create opportunities to 
		answer some of these questions.},
  keywords  = {Education, Peer review},
}



@Article{Son-Ses_ACTA90,
  author    = {Harald S{\o}ndergaard and 
		Peter Sestoft},
  title	    = {Referential Transparency, Definiteness and Unfoldability},
  journal   = {Acta Informatica},
  volume    = {27},
  number    = {6},
  pages	    = {505--517},
  year	    = {1990},
  note	    = {Reviewed in Computing Reviews 32(3): 144--145, 1991},
  doi       = {10.1007/BF00277387},
  abstract  = {The term ``referential transparency'' is frequently used
		to indicate that a programming language has certain useful
		properties. We observe, however, that the formal and
		informal definitions given in the literature are not
		equivalent and we investigate their relationships.
		To this end, we study the definitions in the context of
		a simple expression language and show that in the presence
		of non-determinism, the differences are manifest. We 
		propose a definition of ``referential transparency'', based
		on Quine's, as well as of the related notions: definiteness
		and unfoldability. We demonstrate that these notions are
		useful to characterize programming languages.},
  keywords  = {Programming language concepts, Nondeterminism, Semantics},
}



@Article{Son-Ses_CJ92,
  author    = {Harald S{\o}ndergaard and 
		Peter Sestoft},
  title     = {Non-Determinism in Functional Languages},
  journal   = {The Computer Journal},
  volume    = {35},
  number    = {5},
  pages	    = {514--523},
  year	    = {1992},
  doi       = {10.1093/comjnl/35.5.514},
  abstract  = {The introduction of a non-deterministic operator in even a
		very simple functional programming language gives rise to
		a plethora of semantic questions. These questions are not 
		only concerned with the choice operator itself. A
		surprisingly large number of different parameter passing
		mechanisms are made possible by the introduction of bounded
		non-determinism. The diversity of semantic possibilities
		is examined systematically using denotational definitions
		based on mathematical structures called powerdomains. This
		results in an improved understanding of the different kinds
		of non-determinism and the properties of different kinds of
		non-deterministic languages.},
  keywords  = {Programming language concepts, Nondeterminism, Functional programming, Semantics},
}



@InProceedings{Son-Tho_FIE04,
  author    = {Harald S{\o}ndergaard and 
		Doreen Thomas},
  title     = {Effective Feedback to Small and Large Classes},
  booktitle = {Proceedings of the 2004 ASEE/IEEE Frontiers in
		Education Conference (FIE2004)},
  pages     = {F1E-9--F1E-14},
  location  = {Savannah GA},
  month     = {oct},
  year      = {2004},
  doi       = {10.1109/FIE.2004.1408573},
  abstract  = {Educational experts appear to be in broad agreement when it 
		comes to the importance of feedback for effective learning.  
		Students benefit from plenty of opportunity and encouragement 
		to express their understanding, and from informed, supportive, 
		possibly challenging, feedback. At the same time, we observe 
		that many students at our university do not find that they 
		receive helpful feedback. One in three Engineering students 
		disagree or strongly disagree with the Quality of Teaching 
		questionnaire's ``I received helpful feedback on how I was 
		going'' in the individual course, and most other disciplines 
		find themselves in a similar situation. For the university as 
		a whole, student responses to this question are clearly less 
		positive than to other questions on quality of teaching,
		intellectual stimulation, staff interest, workload, and so on,
		and this state of affairs seems quite common in the Australian
		context. We discuss best practice in feedback provision, partly
		based on our interviews with students and staff. We have been 
		particularly interested in identifying cost-effective ways of 
		providing informed and constructive feedback to large classes.
		Feedback is often understood, by Engineering students and staff
		alike, simply as comments on submitted work---typically written
		assignments. We argue in favour of a broader concept that 
		covers a multitude of ways for a student to develop deep 
		learning through conversation, including questions and answers
		provided by others, team work, study groups, and formative
		teacher-provided feedback during an assessment task. We 
		emphasise the coaching role of the teacher, and feedback 
		designed to encourage students to monitor own learning. Large 
		classes pose particular logistic problems. We identify staff 
		development as a crucial factor for consistent, effective 
		feedback, and point to web-based feedback provision as a 
		workable solution to some logistic problems. We briefly discuss
		the role of information technology more broadly, both for 
		learning enhancement and for automated feedback provision.},
  keywords  = {Education},
}



@Inproceedings{Spe-Som-Son_SAS97,
  author    = {Chris Speirs and 
		Zoltan Somogyi and 
		Harald S{\o}ndergaard},
  title     = {Termination Analysis for {Mercury}},
  editor    = {P. {Van Hentenryck}},
  booktitle = {Static Analysis: 
		Proceedings of the Fourth International Symposium},
  series    = {Lecture Notes in Computer Science},
  volume    = {1302},
  pages     = {157--171},
  publisher = {Springer},
  year      = {1997},
  doi       = {10.1007/bfb0032740},
  abstract  = {Since the late eighties, much progress has been made in the 
		theory of termination analysis for logic programs. However, the
		practical significance of much of this work is hard to judge, 
		since experimental evaluations rarely get published. Here we 
		describe and evaluate a termination analyzer for Mercury, a 
		strongly typed and moded logic-functional programming language.
		Mercury's high degree of referential transparency and the 
		guaranteed availability of reliable mode information simplify 
		termination analysis. Our analyzer uses a variant of a method 
		developed by Pl{\"u}mer. It deals with full Mercury, including 
		modules and I/O. In spite of these obstacles, it produces 
		state-of-the-art termination information, while having a 
		negligible impact on the running time of the compiler of which
		it is part, even for large programs.},
  keywords  = {Logic programming, Mercury, Termination analysis},
}



@InProceedings{Ste-Son-Nai_ITiCSE99,
  author    = {Linda Stern and 
		Harald S{\o}ndergaard and 
		Lee Naish},
  title     = {A Strategy for Managing Content Complexity in
		Algorithm Animation},
  editor    = {B. Manaris},
  booktitle = {Proceedings of the Fourth Annual SIGCSE/SIGCUE Conference on
		Innovation and Technology in Computer Science Education},
  pages     = {127--130},
  publisher = {Association for Computing Machinery},
  address   = {New York, NY},
  year      = {1999},
  location  = {Cracow, Poland},
  doi       = {10.1145/305786.305891},
  abstract  = {Computer animation is an excellent medium for capturing 
		the dynamic nature of data structure manipulations, and 
		can be used to advantage in the teaching of algorithms 
		and data structures. A major educational issue is the 
		necessity of providing a means for the student to manage 
		the complexity of the material. We have addressed this
		issue in a multimedia teaching tool called ``Algorithms in
		Action'' by allowing students to view an algorithm at 
		varying levels of detail. Starting with a high level 
		pseudocode description of the algorithm, with accompanying 
		high level animation and textual explanation, students can 
		expand sections of the pseudocode to expose more detail.
		Animation and explanation are controlled in coordinate
		fashion, becoming correspondingly more detailed as the 
		pseudocode is expanded. Student feedback suggests that the
		availability of multiple levels detail and the facility
		for the user to control the level of detail being viewed
		is an effective way to manage content complexity.},
  keywords  = {Education, Algorithm visualisation, Web-based learning},
}



@inproceedings{Wan-Son-Stu_CPAIOR16,
  author    = {Wenxi Wang and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {A Bit-Vector Solver with Word-Level Propagation},
  editor    = {C.-G. Quimper},
  booktitle = {Integration of AI and OR Techniques in Constraint Programming:
                Proceedings of the 13th International Conference},
  series    = {Lecture Notes in Computer Science},
  volume    = {9676},
  pages     = {374--391},
  publisher = {Springer International Publishing},
  year      = {2016},
  isbn      = {978-3-319-33953-5},
  doi       = {10.1007/978-3-319-33954-2_27},
  abstract  = {Reasoning with bit-vectors arises in a variety of 
		applications in verification and cryptography. 
		Michel and Van Hentenryck have proposed an interesting 
		approach to bit-vector constraint propagation on the 
		word level. Each of the operations except comparison 
		are constant time, assuming the bit-vector fits in a 
		machine word. In contrast, bit-vector SMT solvers 
		usually solve bit-vector problems by bit-blasting, 
		that is, mapping the resulting operations to conjunctive 
		normal form clauses, and using SAT technology to solve 
		them. This also means generating intermediate variables 
		which can be an advantage, as these can be searched on 
		and learnt about. Since each approach has advantages 
		it is important to see whether we can benefit from 
		these advantages by using a word-level propagation 
		approach with learning. In this paper we describe an 
		approach to bit-vector solving using word-level 
		propagation with learning. We provide alternative 
		word-level propagators to Michel and Van Hentenryck, 
		and give the first empirical evaluation of their approach
		that we are aware of. We show that, with careful 
		engineering, a word-level propagation based approach 
		can compete with (or complement) bit-blasting.},
  keywords  = {SMT solving, Constraint propagation, Program verification},
}



@article{Wan-Son-Stu_JAR19,
  author    = {Wenxi Wang and 
		Harald S{\o}ndergaard and 
		Peter J. Stuckey},
  title     = {Wombit: A Portfolio Bit-Vector Solver Using Word-Level 
		Propagation},
  journal   = {Journal of Automated Reasoning},
  volume    = {63},
  number    = {3},
  pages     = {723--762},
  year      = {2019},
  doi       = {10.1007/s10817-018-9493-1},
  abstract  = {We develop an idea originally proposed by Michel and Van 
		Hentenryck of how to perform bit-vector constraint propagation 
		on the word level. Most operations are propagated in constant 
		time, assuming the bit-vector fits in a machine word.
		In contrast, bit-vector SMT solvers usually solve bit-vector 
		problems by (ultimately) bit-blasting, that is, mapping the 
		resulting operations to conjunctive normal form clauses, and 
		using SAT technology to solve them. Bit-blasting generates 
		intermediate variables which can be an advantage, as these can 
		be searched on and learnt about. As each approach has 
		advantages, it makes sense to try to combine them. In this 
		paper, we describe an approach to bit-vector solving using
		word-level propagation with learning. We have designed 
		alternative word-level propagators to Michel and Van 
		Hentenryck's, and evaluated different variants of the approach.
		We have also experimented with different approaches to learning
		and back-jumping in the solver. Based on the insights gained, 
		we have built a portfolio solver, Wombit, which essentially 
		extends the STP bit-vector solver. Using machine learning 
		techniques, the solver makes a judicious up-front decision 
		about whether to use word-level propagation or fall back on 
		bit-blasting.},
  keywords  = {SMT solving, Constraint propagation, Program verification},
}

\">\n            <i class=\"fa fa-download fa-fw\"></i> Download BibTeX\n          </a>\n        </li>\n        <li>\n          <a href=\"//bibbase.org/rss?bib=people.eng.unimelb.edu.au/harald/bibbase.bib\">\n            <i class=\"fa fa-rss fa-fw\"></i> RSS Feed\n          </a>\n          </li>\n      </ul>\n      </li>\n\n      \n\n\n      \n    </ul>\n\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_embed\"\n         style=\"display: none;\">\n\n      Excellent! Next you can\n      <a href=\"/network/register?next=/network/newSiteFromTemplate%3Fbiburl=people.eng.unimelb.edu.au/harald/bibbase.bib\"\n      >create a new website with this list</a>, or\n      embed it in an existing web page by copying &amp; pasting\n      any of the following snippets.\n\n      <div style=\"text-align: left; margin-top: 1em;\">\n        <strong>JavaScript</strong>\n        <span class=\"comment recommended\">(easiest)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;script src=\"https://bibbase.org/show?bib=people.eng.unimelb.edu.au%2Fharald%2Fbibbase.bib&amp;jsonp=1&amp;theme=dividers&amp;jsonp=1\"&gt;&lt;/script&gt;\n          </code>\n        </div>\n\n        <strong>PHP</strong>\n        <div class=\"well well-small\">\n          <code>\n            &lt;?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=people.eng.unimelb.edu.au%2Fharald%2Fbibbase.bib&amp;jsonp=1&amp;theme=dividers\");\n            print_r($contents);\n            ?&gt;\n          </code>\n        </div>\n\n        <strong>iFrame</strong>\n        <span class=\"comment\">(not recommended)</span>\n        <div class=\"well well-small\">\n          <code>\n            &lt;iframe src=\"https://bibbase.org/show?bib=people.eng.unimelb.edu.au%2Fharald%2Fbibbase.bib&amp;jsonp=1&amp;theme=dividers\"&gt;&lt;/iframe&gt;\n          </code>\n        </div>\n\n        <p>\n          For more details see the <a href=\"//bibbase.org/help\">documention</a>.\n        </p>\n      </div>\n    </div>\n\n    <div class=\"alert alert-success bibbase_msg\" id=\"bibbase_msg_preview\"\n         style=\"display: none;\">\n\n      This is a preview! To use this list on your own web site\n      or create a new web site from it,\n      <a href=\"/network/register?next=/network/newAccountWithFile%3FfileId=\"\n      >create a free account</a>. The file will be added\n      and you will be able to edit it in the File Manager.\n      We will show you instructions once you've created your account.\n    </div>\n\n    <div class=\"alert alert-warning bibbase_msg\" id=\"bibbase_msg_mendeley1\"\n         style=\"display: none;\">\n\n      <p>To the site owner:</p>\n\n      <p><strong>Action required!</strong> Mendeley is changing its\n        API. In order to keep using Mendeley with BibBase past April\n        14th, you need to:\n        <ol>\n          <li>renew the authorization for BibBase on Mendeley, and</li>\n          <li>update the BibBase URL\n            in your page the same way you did when you initially set up\n            this page.\n          </li>\n        </ol>\n      </p>\n\n      <p>\n        <a href=\"http://bibbase.org/cgi-bin/mendeley2/get.py\">\n          <i class=\"fa fa-angle-double-right\"></i>\n          Fix it now</a>\n      </p>\n    </div>\n\n  </div>\n\n\n  <div id=\"bibbase_body\">\n    \n  \n  <div class=\"bibbase_group_whole\" id=\"group_2024\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2024')\"\n      onkeypress=\"toggleGroup('group_2024')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2024</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bowles-sndergaard-logicbasedprogramsynthesisandtransformationproceedingsofthe34thinternationalsymposium-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Logic-Based Program Synthesis and Transformation: Proceedings of the 34th International Symposium.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bowles, J.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n  Volume 14919, of Lecture Notes in Computer Science.Springer.  2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-031-71294-4\"\n     onclick=\"log_download('bowles-sndergaard-logicbasedprogramsynthesisandtransformationproceedingsofthe34thinternationalsymposium-2024', 'http://doi.org/10.1007/978-3-031-71294-4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bowles-sndergaard-logicbasedprogramsynthesisandtransformationproceedingsofthe34thinternationalsymposium-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bowles-sndergaard-logicbasedprogramsynthesisandtransformationproceedingsofthe34thinternationalsymposium-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Proceedings{Bow-Son_LOPSTR24,\n  editor    = {Juliana Bowles and Harald S{\\o}ndergaard},\n  title     = {Logic-Based Program Synthesis and Transformation:\n\t\tProceedings of the 34th International Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {14919},\n  publisher = {Springer},\n  year      = {2024},\n  doi       = {10.1007/978-3-031-71294-4},\n  keywords  = {Program transformation, Program synthesis, Program analysis, Inversion, Specification, Logic-based methods, Logic programming},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kafle-gange-schachte-sndergaard-stuckey-alightweightapproachtononterminationinferenceusingconstrainedhornclauses-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Lightweight Approach to Nontermination Inference Using Constrained Horn Clauses.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kafle, B.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Software and Systems Modeling</i>, 23: 319–342.  2024.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s10270-024-01161-5\"\n     onclick=\"log_download('kafle-gange-schachte-sndergaard-stuckey-alightweightapproachtononterminationinferenceusingconstrainedhornclauses-2024', 'http://doi.org/10.1007/s10270-024-01161-5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kafle-gange-schachte-sndergaard-stuckey-alightweightapproachtononterminationinferenceusingconstrainedhornclauses-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kafle-gange-schachte-sndergaard-stuckey-alightweightapproachtononterminationinferenceusingconstrainedhornclauses-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Kaf-Gan-Sch-Son-Stu_SoSyM24,\n  author    = {Bishoksan Kafle and \n\t\tGraeme Gange and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and\n\t\tPeter J. Stuckey},\n  title     = {A Lightweight Approach to Nontermination Inference Using\n\t  \t{Constrained} {Horn} {Clauses}},\n  journal   = {Software and Systems Modeling},\n  volume    = {23},\n  pages     = {319--342},\n  year      = {2024},\n  doi       = {10.1007/s10270-024-01161-5},\n  abstract  = {Nontermination is an unwanted program property for some \n\t  \tsoftware systems, and a safety property for other systems.\n\t\tIn either case, automated discovery of preconditions for \n\t\tnontermination is of interest. We introduce \\textsc{NtHorn},\n\t\ta fast lightweight nontermination analyser, which is able to\n\t\tdeduce non-trivial sufficient conditions for nontermination.\n\t\tUsing Constrained Horn Clauses (CHCs) as a vehicle, we show \n\t\thow established techniques for CHC program transformation \n\t\tand abstract interpretation can be exploited for the purpose\n\t\tof nontermination analysis. \\textsc{NtHorn} is comparable in \n\t\teffectiveness to the state-of-the-art nontermination analysis\n\t\ttools, as measured on standard competition benchmark suites \n\t\t(consisting of integer manipulating programs), while typically\n\t\tsolving problems faster by one order of magnitude.},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Nontermination is an unwanted program property for some software systems, and a safety property for other systems. In either case, automated discovery of preconditions for nontermination is of interest. We introduce \\textscNtHorn, a fast lightweight nontermination analyser, which is able to deduce non-trivial sufficient conditions for nontermination. Using Constrained Horn Clauses (CHCs) as a vehicle, we show how established techniques for CHC program transformation and abstract interpretation can be exploited for the purpose of nontermination analysis. \\textscNtHorn is comparable in effectiveness to the state-of-the-art nontermination analysis tools, as measured on standard competition benchmark suites (consisting of integer manipulating programs), while typically solving problems faster by one order of magnitude.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sestoft-sndergaard-thegenesisofmixearlydaysofselfapplicablepartialevaluationinvitedcontribution-2024\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Keller, G.;  and Wang, M., editor(s), <i>PEPM 2024: Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation</i>, pages 1–13,  2024. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3635800.3637445\"\n     onclick=\"log_download('sestoft-sndergaard-thegenesisofmixearlydaysofselfapplicablepartialevaluationinvitedcontribution-2024', 'http://doi.org/10.1145/3635800.3637445', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sestoft-sndergaard-thegenesisofmixearlydaysofselfapplicablepartialevaluationinvitedcontribution-2024\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sestoft-sndergaard-thegenesisofmixearlydaysofselfapplicablepartialevaluationinvitedcontribution-2024')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ses-Son_PEPM24,\n  author    = {Peter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {The Genesis of {Mix}: Early Days of Self-Applicable \n\t\tPartial Evaluation (Invited Contribution)},\n  editor    = {G. Keller and M. Wang},\n  booktitle = {PEPM 2024: Proceedings of the 2024 ACM SIGPLAN International\n        \tWorkshop on Partial Evaluation and Program Manipulation},\n  pages     = {1--13},\n  year      = {2024},\n  doi       = {10.1145/3635800.3637445},\n  abstract  = {Forty years ago development started on Mix, a partial evaluator\n\t\tdesigned specifically for the purpose of self-application.\n\t\tThe effort, led by Neil D. Jones at the University of \n\t\tCopenhagen, eventually demonstrated that non-trivial compilers\n\t\tcould be generated automatically by applying a partial \n\t\tevaluator to itself. The possibility, in theory, of such \n\t\tself-application had been known for more than a decade, but\n\t\tremained unrealized by the start of 1984. We describe the \n\t\tgenesis of Mix, including the research environment, the \n\t\tchallenges, and the main insights that led to success. We \n\t\temphasize the critical role played by program annotation as a\n\t\tpre-processing step, a process that became automated in the \n\t\tform of binding-time analysis.},\n  keywords  = {Partial evaluation, Binding-time analysis, Compilation, History},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Forty years ago development started on Mix, a partial evaluator designed specifically for the purpose of self-application. The effort, led by Neil D. Jones at the University of Copenhagen, eventually demonstrated that non-trivial compilers could be generated automatically by applying a partial evaluator to itself. The possibility, in theory, of such self-application had been known for more than a decade, but remained unrealized by the start of 1984. We describe the genesis of Mix, including the research environment, the challenges, and the main insights that led to success. We emphasize the critical role played by program annotation as a pre-processing step, a process that became automated in the form of binding-time analysis.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2022\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2022')\"\n      onkeypress=\"toggleGroup('group_2022')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2022</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"farrugiaroberts-jeffries-sndergaard-programmingtolearnlogicandcomputationfromaprogrammingperspective-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Programming to Learn: Logic and Computation from a Programming Perspective.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Farrugia-Roberts, M.; Jeffries, B.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 27th Annual Conference on Innovation and Technology in Computer Science Education</i>, pages 311–317, New York, NY,  2022. Association for Computing Machinery\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3502718.3524814\"\n     onclick=\"log_download('farrugiaroberts-jeffries-sndergaard-programmingtolearnlogicandcomputationfromaprogrammingperspective-2022', 'http://doi.org/10.1145/3502718.3524814', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/farrugiaroberts-jeffries-sndergaard-programmingtolearnlogicandcomputationfromaprogrammingperspective-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('farrugiaroberts-jeffries-sndergaard-programmingtolearnlogicandcomputationfromaprogrammingperspective-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Far-Jef-Son_ITiCSE22,\n  author    = {Matthew Farrugia-Roberts and\n\t\tBryn Jeffries and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Programming to Learn:\n\t\tLogic and Computation from a Programming Perspective},\n  booktitle = {Proceedings of the 27th Annual Conference on Innovation and \n\t\tTechnology in Computer Science Education},\n  pages     = {311--317},\n  publisher = {Association for Computing Machinery},\n  address   = {New York, NY},\n  year      = {2022},\n  doi       = {10.1145/3502718.3524814},\n  abstract  = {Programming problems are commonly used as a learning and \n\t\tassessment activity for learning to program. We believe\n\t\tthat programming problems can be effective for broader \n\t\tlearning goals. In our large-enrolment course, we have \n\t\tdesigned special programming problems relevant to logic, \n\t\tdiscrete mathematics, and the theory of computation, and \n\t\twe have used them for formative and summative assessment.\n\t\tIn this report, we reflect on our experience. We aim to \n\t\tleverage our students&#x27; programming backgrounds by offering\n\t\ta code-based formalism for our mathematical syllabus.\n\t\tWe find we can translate many traditional questions into \n\t\tprogramming problems of a special kind---calling for \n\t\t&#x60;programs&#x27; as simple as a single expression, such as a \n\t\tformula or automaton represented in code. A web-based \n\t\tplatform enables self-paced learning with rapid contextual\n\t\tcorrective feedback, and helps us scale summative \n\t\tassessment to the size of our cohort. We identify several \n\t\tbarriers arising with our approach and discuss how we have\n\t\tattempted to negate them. We highlight the potential of \n\t\tprogramming problems as a digital learning activity even \n\t\tbeyond a logic and computation course.},\n  keywords  = {Education, Web-based learning},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Programming problems are commonly used as a learning and assessment activity for learning to program. We believe that programming problems can be effective for broader learning goals. In our large-enrolment course, we have designed special programming problems relevant to logic, discrete mathematics, and the theory of computation, and we have used them for formative and summative assessment. In this report, we reflect on our experience. We aim to leverage our students' programming backgrounds by offering a code-based formalism for our mathematical syllabus. We find we can translate many traditional questions into programming problems of a special kind—calling for `programs' as simple as a single expression, such as a formula or automaton represented in code. A web-based platform enables self-paced learning with rapid contextual corrective feedback, and helps us scale summative assessment to the size of our cohort. We identify several barriers arising with our approach and discuss how we have attempted to negate them. We highlight the potential of programming problems as a digital learning activity even beyond a logic and computation course.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://arxiv.org/abs/2208.04699v1\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022', 'https://arxiv.org/abs/2208.04699v1', event);\">\n    Teaching Simple Constructive Proofs with Haskell Programs.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Farrugia-Roberts, M.; Jeffries, B.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Achten, P.;  and Machkasova, E., editor(s), <i>Trends in Functional Programming in Education (TFPIE)</i>, volume 363, of <i>Electronic Proceedings in Theoretical Computer Science</i>, pages 54–73,  2022. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://arxiv.org/abs/2208.04699v1\"\n     onclick=\"log_download('farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022', 'https://arxiv.org/abs/2208.04699v1', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Teaching Simple Constructive Proofs with Haskell Programs [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4204/EPTCS.363.4\"\n     onclick=\"log_download('farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022', 'http://doi.org/10.4204/EPTCS.363.4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('farrugiaroberts-jeffries-sndergaard-teachingsimpleconstructiveproofswithhaskellprograms-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Far-Jef-Son_TFPIE21,\n  author    = {Matthew Farrugia-Roberts and\n\t\tBryn Jeffries and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Teaching Simple Constructive Proofs with {Haskell} Programs},\n  editor    = {P. Achten and E. Machkasova},\n  booktitle = {Trends in Functional Programming in Education (TFPIE)},\n  series    = {Electronic Proceedings in Theoretical Computer Science},\n  volume    = {363},\n  pages     = {54--73},\n  year      = {2022},\n  url_Paper       = {https://arxiv.org/abs/2208.04699v1},\n  doi       = {10.4204/EPTCS.363.4},\n  abstract  = {In recent years we have explored using Haskell alongside a\n\t\ttraditional mathematical formalism in our large-enrolment \n\t\tuniversity course on topics including logic and formal \n\t\tlanguages, aiming to offer our students a programming \n\t\tperspective on these mathematical topics. We have found it \n\t\tpossible to offer almost all formative and summative \n\t\tassessment through an interactive learning platform, using \n\t\tHaskell as a lingua franca for digital exercises across our \n\t\tbroad syllabus. One of the hardest exercises to convert \n\t\tinto this format are traditional written proofs conveying \n\t\tconstructive arguments. In this paper we reflect on the \n\t\tdigitisation of this kind of exercise. We share many examples\n\t\tof Haskell exercises designed to target similar skills to \n\t\twritten proof exercises across topics in propositional logic \n\t\tand formal languages, discussing various aspects of the design \n\t\tof such exercises. We also catalogue a sample of student \n\t\tresponses to such exercises. This discussion contributes to \n\t\tour broader exploration of programming problems as a flexible\n\t\tdigital medium for learning and assessment.},\n  keywords  = {Education, Web-based learning, Haskell},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In recent years we have explored using Haskell alongside a traditional mathematical formalism in our large-enrolment university course on topics including logic and formal languages, aiming to offer our students a programming perspective on these mathematical topics. We have found it possible to offer almost all formative and summative assessment through an interactive learning platform, using Haskell as a lingua franca for digital exercises across our broad syllabus. One of the hardest exercises to convert into this format are traditional written proofs conveying constructive arguments. In this paper we reflect on the digitisation of this kind of exercise. We share many examples of Haskell exercises designed to target similar skills to written proof exercises across topics in propositional logic and formal languages, discussing various aspects of the design of such exercises. We also catalogue a sample of student responses to such exercises. This discussion contributes to our broader exploration of programming problems as a flexible digital medium for learning and assessment.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-stringabstractdomainsandtheircombination-2022\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  String Abstract Domains and Their Combination.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In De Angelis, E.;  and Vanhoof, W., editor(s), <i>Logic-Based Program Synthesis and Transformation</i>, volume 13290, of <i>Lecture Notes in Computer Science</i>, pages 1–15,  2022. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-98869-2_1\"\n     onclick=\"log_download('sndergaard-stringabstractdomainsandtheircombination-2022', 'http://doi.org/10.1007/978-3-030-98869-2_1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-stringabstractdomainsandtheircombination-2022\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-stringabstractdomainsandtheircombination-2022')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Son_LOPSTR21,\n  author    = {Harald S{\\o}ndergaard},\n  title     = {String Abstract Domains and Their Combination},\n  editor    = {E. {De Angelis} and W. Vanhoof},\n  booktitle = {Logic-Based Program Synthesis and Transformation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13290},\n  pages     = {1--15},\n  publisher = {Springer},\n  year      = {2022},\n  doi       = {10.1007/978-3-030-98869-2_1},\n  abstract  = {We survey recent developments in string static analysis, with\n\t\tan emphasis on how string abstract domains can be combined.\n\t\tThe paper has formed the basis for an invited presentation\n\t\tgiven to LOPSTR 2021 and PPDP 2021.},\n  keywords  = {Abstract domains, String analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We survey recent developments in string static analysis, with an emphasis on how string abstract domains can be combined. The paper has formed the basis for an invited presentation given to LOPSTR 2021 and PPDP 2021.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2021\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2021')\"\n      onkeypress=\"toggleGroup('group_2021')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2021</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gange-ma-navas-schachte-sndergaard-stuckey-afreshlookatzonesandoctagons-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Fresh Look at Zones and Octagons.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Ma, Z.; Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Programming Languages and Systems</i>, 43(3): 11:1–11:51.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3457885\"\n     onclick=\"log_download('gange-ma-navas-schachte-sndergaard-stuckey-afreshlookatzonesandoctagons-2021', 'http://doi.org/10.1145/3457885', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-ma-navas-schachte-sndergaard-stuckey-afreshlookatzonesandoctagons-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-ma-navas-schachte-sndergaard-stuckey-afreshlookatzonesandoctagons-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Ma-Nav-Sch-Son-Stu_TOPLAS21,\n  author    = {Graeme Gange and\n                Zequn Ma and\n                Jorge A. Navas and\n                Peter Schachte and\n                Harald S{\\o}ndergaard and\n                Peter J. Stuckey},\n  title     = {A Fresh Look at {Zones} and {Octagons}},\n  journal   = {ACM Transactions on Programming Languages and Systems},\n  volume    = {43},\n  number    = {3},\n  pages     = {11:1--11:51},\n  year      = {2021},\n  doi       = {10.1145/3457885},\n  abstract  = {Zones and Octagons are popular abstract domains for \n\t\tstatic program analysis. They enable the automated \n\t\tdiscovery of simple numerical relations that hold \n\t\tbetween pairs of program variables. Both domains \n\t\tare well understood mathematically but the detailed \n\t\timplementation of static analyses based on these \n\t\tdomains poses many interesting algorithmic challenges. \n\t\tIn this paper we study the two abstract domains, their \n\t\timplementation and use. Utilizing improved data \n\t\tstructures and algorithms for the manipulation of \n\t\tgraphs that represent difference-bound constraints, \n\t\twe present fast implementations of both abstract domains, \n\t\tbuilt around a common infrastructure. We compare the \n\t\tperformance of these implementations against alternative \n\t\tapproaches offering the same analysis precision. We \n\t\tquantify the differences in performance by measuring \n\t\ttheir speed and precision on standard benchmarks. We \n\t\talso assess, in the context of software verification, \n\t\tthe extent to which the improved precision translates \n\t\tto better verification outcomes. Experiments demonstrate \n\t\tthat our new implementations improve the state-of-the-art \n\t\tfor both Zones and Octagons significantly.},\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numerical relations that hold between pairs of program variables. Both domains are well understood mathematically but the detailed implementation of static analyses based on these domains poses many interesting algorithmic challenges. In this paper we study the two abstract domains, their implementation and use. Utilizing improved data structures and algorithms for the manipulation of graphs that represent difference-bound constraints, we present fast implementations of both abstract domains, built around a common infrastructure. We compare the performance of these implementations against alternative approaches offering the same analysis precision. We quantify the differences in performance by measuring their speed and precision on standard benchmarks. We also assess, in the context of software verification, the extent to which the improved precision translates to better verification outcomes. Experiments demonstrate that our new implementations improve the state-of-the-art for both Zones and Octagons significantly.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-disjunctiveintervalanalysis-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Disjunctive Interval Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Drăgoi, C.; Mukherjee, S.;  and Namjoshi, K., editor(s), <i>Static Analysis</i>, volume 12913, of <i>Lecture Notes in Computer Science</i>, pages 144–165,  2021. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-88806-0_7\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-disjunctiveintervalanalysis-2021', 'http://doi.org/10.1007/978-3-030-88806-0_7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-disjunctiveintervalanalysis-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-disjunctiveintervalanalysis-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gan-Nav-Sch-Son-Stu_SAS21,\n  author    = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Disjunctive Interval Analysis},\n  editor    = {C. Dr{\\u{a}}goi and S. Mukherjee and K. Namjoshi},\n  booktitle = {Static Analysis},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12913},\n  pages     = {144--165},\n  publisher = {Springer},\n  year      = {2021},\n  doi       = {10.1007/978-3-030-88806-0_7},\n  abstract  = {We revisit disjunctive interval analysis based on the \n\t\tBoxes abstract domain. We propose the use of what we call \n\t\trange decision diagrams (RDDs) to implement Boxes, and we \n\t\tprovide algorithms for the necessary RDD operations.  \n\t\tRDDs tend to be more compact than the linear decision\n\t\tdiagrams (LDDs) that have traditionally been used for Boxes.\n\t\tRepresenting information more directly, RDDs also allow for \n\t\tthe implementation of more accurate abstract operations.\n\t\tThis comes at no cost in terms of analysis efficiency,\n\t\twhether LDDs utilise dynamic variable ordering or not.\n\t\tRDD and LDD implementations are available in the Crab analyzer,\n\t\tand our experiments confirm that RDDs are well suited for\n\t\tdisjunctive interval analysis.},\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Interval analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We revisit disjunctive interval analysis based on the Boxes abstract domain. We propose the use of what we call range decision diagrams (RDDs) to implement Boxes, and we provide algorithms for the necessary RDD operations. RDDs tend to be more compact than the linear decision diagrams (LDDs) that have traditionally been used for Boxes. Representing information more directly, RDDs also allow for the implementation of more accurate abstract operations. This comes at no cost in terms of analysis efficiency, whether LDDs utilise dynamic variable ordering or not. RDD and LDD implementations are available in the Crab analyzer, and our experiments confirm that RDDs are well suited for disjunctive interval analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kafle-gange-schachte-sndergaard-stuckey-lightweightnonterminationinferencewithchcs-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Lightweight Non-Termination Inference with CHCs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kafle, B.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Calinescu, R.;  and Păsăreanu, C., editor(s), <i>Software Engineering and Formal Methods</i>, volume 13085, of <i>Lecture Notes in Computer Science</i>, pages 383–402,  2021. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-92124-8_22\"\n     onclick=\"log_download('kafle-gange-schachte-sndergaard-stuckey-lightweightnonterminationinferencewithchcs-2021', 'http://doi.org/10.1007/978-3-030-92124-8_22', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kafle-gange-schachte-sndergaard-stuckey-lightweightnonterminationinferencewithchcs-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kafle-gange-schachte-sndergaard-stuckey-lightweightnonterminationinferencewithchcs-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Kaf-Gan-Sch-Son-Stu_SEFM21,\n  author    = {Bishoksan Kafle and \n\t\tGraeme Gange and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and\n\t\tPeter J. Stuckey},\n  title     = {Lightweight Non-Termination Inference with {CHCs}},\n  editor    = {R. Calinescu and C. P{\\u{a}}s{\\u{a}}reanu},\n  booktitle = {Software Engineering and Formal Methods},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {13085},\n  pages     = {383--402},\n  year      = {2021},\n  doi       = {10.1007/978-3-030-92124-8_22},\n  abstract  = {Non-termination is an unwanted program property (considered a \n\t\tbug) for some software systems, and a safety property for \n\t\tother systems. In either case, automated discovery of \n\t\tpreconditions for non-termination is of interest. We introduce\n\t\t\\textsc{NtHorn}, a fast lightweight non-termination analyser,\n\t\table to deduce non-trivial sufficient conditions for \n\t\tnon-termination. Using Constrained Horn Clauses (CHCs) as a \n\t\tvehicle, we show how established techniques for CHC program \n\t\ttransformation and abstract interpretation can be exploited \n\t\tfor the purpose of non-termination analysis. \\textsc{NtHorn} \n\t\tis comparable in power to the state-of-the-art\n\t\tnon-termination analysis tools, as measured on standard \n\t\tcompetition benchmark suites (consisting of integer \n\t\tmanipulating programs), while typically solving problems \n\t\tan order of magnitude faster.},\n  keywords  = {Program verification, Program transformation, Partial evaluation, Nontermination analysis, Horn clauses},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Non-termination is an unwanted program property (considered a bug) for some software systems, and a safety property for other systems. In either case, automated discovery of preconditions for non-termination is of interest. We introduce \\textscNtHorn, a fast lightweight non-termination analyser, able to deduce non-trivial sufficient conditions for non-termination. Using Constrained Horn Clauses (CHCs) as a vehicle, we show how established techniques for CHC program transformation and abstract interpretation can be exploited for the purpose of non-termination analysis. \\textscNtHorn is comparable in power to the state-of-the-art non-termination analysis tools, as measured on standard competition benchmark suites (consisting of integer manipulating programs), while typically solving problems an order of magnitude faster.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kafle-gange-stuckey-schachte-sndergaard-transformationenabledpreconditioninference-2021\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Transformation-Enabled Precondition Inference.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kafle, B.; Gange, G.; Stuckey, P. J.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Theory and Practice of Logic Programming</i>, 21: 700–716.  2021.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1017/S1471068421000272\"\n     onclick=\"log_download('kafle-gange-stuckey-schachte-sndergaard-transformationenabledpreconditioninference-2021', 'http://doi.org/10.1017/S1471068421000272', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kafle-gange-stuckey-schachte-sndergaard-transformationenabledpreconditioninference-2021\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kafle-gange-stuckey-schachte-sndergaard-transformationenabledpreconditioninference-2021')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Kaf-Gan-Stu-Sch-Son_TPLP21,\n  author    = {Bishoksan Kafle and \n\t\tGraeme Gange and \n\t\tPeter J. Stuckey and\n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Transformation-Enabled Precondition Inference},\n  journal   = {Theory and Practice of Logic Programming},\n  volume    = {21},\n  pages     = {700--716},\n  year      = {2021},\n  doi       = {10.1017/S1471068421000272},\n  abstract  = {Precondition inference is a non-trivial problem with \n\t\timportant applications in program analysis and verification. \n\t\tWe present a novel iterative method for automatically deriving \n\t\tpreconditions for the safety and unsafety of programs. \n\t\tEach iteration maintains over-approximations of the set of \n\t\tsafe and unsafe initial states; which are used to partition \n\t\tthe program&#x27;s initial states into those known to be safe, \n\t\tknown to be unsafe and unknown. We then construct revised \n\t\tprograms with those unknown initial states and iterate the \n\t\tprocedure until the approximations are disjoint or some \n\t\ttermination criteria are met. An experimental evaluation of \n\t\tthe method on a set of software verification benchmarks shows \n\t\tthat it can infer precise preconditions (sometimes optimal) \n\t\tthat are not possible using previous methods.},\n  keywords  = {Program verification, Program transformation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Precondition inference is a non-trivial problem with important applications in program analysis and verification. We present a novel iterative method for automatically deriving preconditions for the safety and unsafety of programs. Each iteration maintains over-approximations of the set of safe and unsafe initial states; which are used to partition the program's initial states into those known to be safe, known to be unsafe and unknown. We then construct revised programs with those unknown initial states and iterate the procedure until the approximations are disjoint or some termination criteria are met. An experimental evaluation of the method on a set of software verification benchmarks shows that it can infer precise preconditions (sometimes optimal) that are not possible using previous methods.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2020\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2020')\"\n      onkeypress=\"toggleGroup('group_2020')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2020</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020', 'https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf', event);\">\n    Abstract Interpretation, Symbolic Execution and Constraints.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In de Boer , F. S.;  and Mauro, J., editor(s), <i>Recent Developments in the Design and Implementation of Programming Languages</i>, volume 86, of <i>OpenAccess Series in Informatics</i>, pages 7:1–7:19,  2020. Schloss Dagstuhl-Leibniz-Zentrum für Informatik\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf\"\n     onclick=\"log_download('amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020', 'https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Abstract Interpretation, Symbolic Execution and Constraints [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.4230/OASIcs.Gabbrielli.2020.7\"\n     onclick=\"log_download('amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020', 'http://doi.org/10.4230/OASIcs.Gabbrielli.2020.7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-gange-schachte-sndergaard-stuckey-abstractinterpretationsymbolicexecutionandconstraints-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ama-Gan-Sch-Son-Stu_DIPL20,\n  author    = {Roberto Amadini and \n\t\tGraeme Gange and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey}, \n  title     = {Abstract Interpretation, Symbolic Execution and Constraints},\n  editor    = {F. S. {de Boer} and J. Mauro},\n  booktitle = {Recent Developments in the Design and Implementation of \n\t\tProgramming Languages},\n  series    = {OpenAccess Series in Informatics},\n  volume    = {86}, \n  pages     = {7:1--7:19},\n  publisher = {Schloss Dagstuhl-Leibniz-Zentrum f{\\&quot;u}r Informatik},\n  year      = {2020},\n  doi       = {10.4230/OASIcs.Gabbrielli.2020.7},\n  url_Paper = {https://drops.dagstuhl.de/opus/volltexte/2020/13229/pdf/OASIcs-Gabbrielli-7.pdf},\n  abstract  = {Abstract interpretation is a static analysis framework for \n\t\tsound over-approximation of all possible runtime states of \n\t\ta program. Symbolic execution is a framework for reachability\n\t\tanalysis which tries to explore all possible execution paths \n\t\tof a program. A shared feature between abstract interpretation\n\t\tand symbolic execution is that each---implicitly or \n\t\texplicitly---maintains constraints during execution, \n\t\tin the form of invariants or path conditions.\n\t\tWe investigate the relations between the worlds of abstract \n\t\tinterpretation, symbolic execution and constraint solving, \n\t\tto expose potential synergies.},\n  keywords  = {Constraint programming, Symbolic execution, Abstract interpretation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstract interpretation is a static analysis framework for sound over-approximation of all possible runtime states of a program. Symbolic execution is a framework for reachability analysis which tries to explore all possible execution paths of a program. A shared feature between abstract interpretation and symbolic execution is that each—implicitly or explicitly—maintains constraints during execution, in the form of invariants or path conditions. We investigate the relations between the worlds of abstract interpretation, symbolic execution and constraint solving, to expose potential synergies.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020', 'https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431', event);\">\n    String Constraint Solving: Past, Present and Future.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In De Giacomo, G.;  and others, editor(s), <i>Proceedings of the 24th European Conference on Artificial Intelligence</i>, pages 2875–2876,  2020. IOS Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431\"\n     onclick=\"log_download('amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020', 'https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"String Constraint Solving: Past, Present and Future [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3233/FAIA200431\"\n     onclick=\"log_download('amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020', 'http://doi.org/10.3233/FAIA200431', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-gange-schachte-sndergaard-stuckey-stringconstraintsolvingpastpresentandfuture-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ama-Gan-Sch-Son-Stu_ECAI20,\n  author    = {Roberto Amadini and \n\t\tGraeme Gange and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey}, \n  title     = {String Constraint Solving: Past, Present and Future},\n  editor    = {G. {De Giacomo} and others},\n  booktitle = {Proceedings of the 24th European Conference on \n\t\tArtificial Intelligence},\n  pages     = {2875--2876},\n  publisher = {IOS Press},\n  year      = {2020},\n  doi       = {10.3233/FAIA200431},\n  url_Paper = {https://ebooks.iospress.nl/pdf/doi/10.3233/FAIA200431},\n  abstract  = {String constraint solving is an important emerging field, \n\t\tgiven the ubiquity of strings over different fields such as\n\t\tformal analysis, automated testing, database query processing,\n\t\tand cybersecurity. This paper highlights the current \n\t\tstate-of-the-art for string constraint solving, and \n\t\tidentifies future challenges in this field.},\n  keywords  = {String solvers},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  String constraint solving is an important emerging field, given the ubiquity of strings over different fields such as formal analysis, automated testing, database query processing, and cybersecurity. This paper highlights the current state-of-the-art for string constraint solving, and identifies future challenges in this field.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"amadini-gange-schachte-sndergaard-stuckey-algorithmselectionfordynamicsymbolicexecutionapreliminarystudy-2020\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Algorithm Selection for Dynamic Symbolic Execution: A Preliminary Study.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Fernández, M., editor(s), <i>Logic-Based Program Synthesis and Transformation</i>, volume 12561, of <i>Lecture Notes in Computer Science</i>, pages 192–209,  2020. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-68446-4_10\"\n     onclick=\"log_download('amadini-gange-schachte-sndergaard-stuckey-algorithmselectionfordynamicsymbolicexecutionapreliminarystudy-2020', 'http://doi.org/10.1007/978-3-030-68446-4_10', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-gange-schachte-sndergaard-stuckey-algorithmselectionfordynamicsymbolicexecutionapreliminarystudy-2020\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-gange-schachte-sndergaard-stuckey-algorithmselectionfordynamicsymbolicexecutionapreliminarystudy-2020')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ama-Gan-Sch-Son-Stu_LOPSTR20,\n  author    = {Roberto Amadini and \n\t\tGraeme Gange and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey}, \n  title     = {Algorithm Selection for Dynamic Symbolic Execution: \n\t\tA Preliminary Study},\n  editor    = {M. Fern{\\&#x27;a}ndez},\n  booktitle = {Logic-Based Program Synthesis and Transformation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {12561}, \n  pages     = {192--209},\n  year      = {2020},\n  doi       = {10.1007/978-3-030-68446-4_10},\n  abstract  = {Given a portfolio of algorithms, the goal of Algorithm Selection\n\t\t(\\textsf{AS}) is to select the best algorithm(s) for a new, \n\t\tunseen problem instance. Dynamic Symbolic Execution \n\t\t(\\textsf{DSE}) brings together concrete and symbolic execution \n\t\tto maximise the program coverage. \\textsf{DSE} uses a \n\t\tconstraint solver to solve the path conditions and generate \n\t\tnew inputs to explore. In this paper we join these lines of \n\t\tresearch by introducing a model that combines \\textsf{DSE} and\n\t\t\\textsf{AS} approaches. The proposed \\textsf{AS/DSE} model is \n\t\ta generic and flexible framework enabling the \\dse engine to \n\t\tsolve the path conditions it collects with a portfolio of \n\t\tdifferent solvers, by exploiting and extending the well-known\n\t\t\\textsf{AS} techniques that have been developed over the last \n\t\tdecade. In this way, one can increase the coverage and \n\t\tsometimes even outperform the aggregate coverage achievable \n\t\tby running simultaneously all the solvers of the portfolio.},\n  keywords  = {Symbolic execution},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Given a portfolio of algorithms, the goal of Algorithm Selection (\\textsfAS) is to select the best algorithm(s) for a new, unseen problem instance. Dynamic Symbolic Execution (\\textsfDSE) brings together concrete and symbolic execution to maximise the program coverage. \\textsfDSE uses a constraint solver to solve the path conditions and generate new inputs to explore. In this paper we join these lines of research by introducing a model that combines \\textsfDSE and \\textsfAS approaches. The proposed \\textsfAS/DSE model is a generic and flexible framework enabling the \\dse engine to solve the path conditions it collects with a portfolio of different solvers, by exploiting and extending the well-known \\textsfAS techniques that have been developed over the last decade. In this way, one can increase the coverage and sometimes even outperform the aggregate coverage achievable by running simultaneously all the solvers of the portfolio.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2019\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2019')\"\n      onkeypress=\"toggleGroup('group_2019')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2019</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve', event);\">\n    Constraint Programming for Dynamic Symbolic Execution of JavaScript.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Andrlon, M.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Rousseau, L.;  and Stergiou, K., editor(s), <i>Integration of Constraint Programming, Artificial Intelligence, and Operations Research: Proceedings of the 16th International Conference (CPAIOR 2019)</i>, volume 11494, of <i>Lecture Notes in Computer Science</i>, pages 1–19,  2019. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve\"\n     onclick=\"log_download('amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Constraint Programming for Dynamic Symbolic Execution of JavaScript [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-19212-9_1\"\n     onclick=\"log_download('amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019', 'http://doi.org/10.1007/978-3-030-19212-9_1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-andrlon-gange-schachte-sndergaard-stuckey-constraintprogrammingfordynamicsymbolicexecutionofjavascript-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ama-And-Gan-Sch-Son-Stu_CPAIOR19,\n  author    = {Roberto Amadini and \n\t\tMak Andrlon and \n\t\tGraeme Gange and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Constraint Programming for Dynamic Symbolic Execution of\n                {JavaScript}},\n  editor    = {L.-M. Rousseau and K. Stergiou},\n  booktitle = {Integration of Constraint Programming, Artificial Intelligence,\n\t\tand Operations Research: Proceedings of the 16th International\n\t\tConference (CPAIOR 2019)},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {11494}, \n  pages     = {1--19},\n  year      = {2019},\n  doi       = {10.1007/978-3-030-19212-9_1},\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/b999c802-90f6-5ce4-8b79-c298bfc62afa/retrieve},\n  abstract  = {Dynamic Symbolic Execution (DSE) combines concrete and symbolic \n\t\texecution, usually for the purpose of generating good test \n\t\tsuites automatically.  It relies on constraint solvers to solve\n\t\tpath conditions and to generate new inputs to explore. DSE \n\t\ttools usually make use of SMT solvers for constraint solving.\n\t\tIn this paper, we show that constraint programming (CP) is a\n\t\tpowerful alternative or complementary technique for DSE.\n\t\tSpecifically, we apply CP techniques for DSE of JavaScript, the\n\t\tde facto standard for web programming. We capture the JavaScript\n\t\tsemantics with MiniZinc and integrate this approach into a tool\n\t\twe call \\textsc{Aratha}. We use \\textsc{G-Strings}, a CP solver\n\t\tequipped with string variables, for solving path conditions, \n\t\tand we compare the performance of this approach against \n\t\tstate-of-the-art SMT solvers. Experimental results, in terms of\n\t\tboth speed and coverage, show the benefits of our approach,\n\t\tthus opening new research vistas for using CP techniques in \n\t\tthe service of program analysis.},\n  keywords  = {Symbolic execution, Constraint programming, String solvers, JavaScript},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Dynamic Symbolic Execution (DSE) combines concrete and symbolic execution, usually for the purpose of generating good test suites automatically. It relies on constraint solvers to solve path conditions and to generate new inputs to explore. DSE tools usually make use of SMT solvers for constraint solving. In this paper, we show that constraint programming (CP) is a powerful alternative or complementary technique for DSE. Specifically, we apply CP techniques for DSE of JavaScript, the de facto standard for web programming. We capture the JavaScript semantics with MiniZinc and integrate this approach into a tool we call \\textscAratha. We use \\textscG-Strings, a CP solver equipped with string variables, for solving path conditions, and we compare the performance of this approach against state-of-the-art SMT solvers. Experimental results, in terms of both speed and coverage, show the benefits of our approach, thus opening new research vistas for using CP techniques in the service of program analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"andrlon-schachte-sndergaard-stuckey-optimalboundsforfloatingpointadditioninconstanttime-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Optimal Bounds for Floating-Point Addition in Constant Time.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Andrlon, M.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Takagi, N.; Boldo, S.;  and Langhammer, M., editor(s), <i>Proceedings of the 26th IEEE Symposium on Computer Arithmetic (ARITH 2019)</i>, pages 159–166,  2019. IEEE Conf. Publ.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/arith.2019.00038\"\n     onclick=\"log_download('andrlon-schachte-sndergaard-stuckey-optimalboundsforfloatingpointadditioninconstanttime-2019', 'http://doi.org/10.1109/arith.2019.00038', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/andrlon-schachte-sndergaard-stuckey-optimalboundsforfloatingpointadditioninconstanttime-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('andrlon-schachte-sndergaard-stuckey-optimalboundsforfloatingpointadditioninconstanttime-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{And-Sch-Son-Stu_ARITH19,\n  author    = {Mak Andrlon and\n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and\n\t\tPeter J. Stuckey},\n  title     = {Optimal Bounds for Floating-Point Addition in Constant Time},\n  editor    = {N. Takagi and S. Boldo and M. Langhammer},\n  booktitle = {Proceedings of the 26th IEEE Symposium on Computer Arithmetic \n\t\t(ARITH 2019)},\n  pages     = {159--166},\n  publisher = {IEEE Conf. Publ.},\n  year      = {2019},\n  doi       = {10.1109/arith.2019.00038},\n  abstract  = {Reasoning about floating-point numbers is notoriously difficult,\n\t\towing to the lack of convenient algebraic properties such as \n\t\tassociativity. This poses a substantial challenge for program \n\t\tanalysis and verification tools which rely on precise \n\t\tfloating-point constraint solving. Currently, interval methods \n\t\tin this domain often exhibit slow convergence even on simple \n\t\texamples. We present a new theorem supporting efficient \n\t\tcomputation of exact bounds of the intersection of a rectangle \n\t\twith the preimage of an interval under floating-point addition,\n\t\tin any radix or rounding mode. We thus give an efficient method\n\t\tof deducing optimal bounds on the components of an addition, \n\t\tsolving the convergence problem.},\n  keywords  = {Constraint solving, Machine arithmetic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Reasoning about floating-point numbers is notoriously difficult, owing to the lack of convenient algebraic properties such as associativity. This poses a substantial challenge for program analysis and verification tools which rely on precise floating-point constraint solving. Currently, interval methods in this domain often exhibit slow convergence even on simple examples. We present a new theorem supporting efficient computation of exact bounds of the intersection of a rectangle with the preimage of an interval under floating-point addition, in any radix or rounding mode. We thus give an efficient method of deducing optimal bounds on the components of an addition, solving the convergence problem.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-dissectingwideningseparatingterminationfrominformation-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Dissecting Widening: Separating Termination from Information.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Lin, A. W., editor(s), <i>Proceedings of the 17th Asian Symposium on Programming Languages and Systems</i>, volume 11893, of <i>Lecture Notes in Computer Science</i>, pages 95–114,  2019. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-030-34175-6_6\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-dissectingwideningseparatingterminationfrominformation-2019', 'http://doi.org/10.1007/978-3-030-34175-6_6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-dissectingwideningseparatingterminationfrominformation-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-dissectingwideningseparatingterminationfrominformation-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gan-Nav-Sch-Son-Stu_APLAS19,\n  author    = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Dissecting Widening: Separating Termination from Information},\n  editor    = {A. W. Lin},\n  booktitle = {Proceedings of the 17th Asian Symposium on Programming \n\t\tLanguages and Systems},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {11893},\n  pages     = {95--114},\n  publisher = {Springer},\n  year      = {2019},\n  doi       = {10.1007/978-3-030-34175-6_6},\n  abstract  = {Widening ensures or accelerates convergence of a program \n\t\tanalysis, and sometimes contributes a guarantee of soundness \n\t\tthat would otherwise be absent. In this paper we propose a \n\t\tgeneralised view of widening, in which widening operates on \n\t\tvalues that are not necessarily elements of the given abstract\n\t\tdomain, although they must be in a correspondence, the details\n\t\tof which we spell out. We show that the new view generalizes \n\t\tthe traditional view, and that at least three distinct \n\t\tadvantages flow from the generalization. First, it gives a \n\t\thandle on &#x60;&#x60;compositional safety&#x27;&#x27;, the problem of creating \n\t\twidening operators for product domains. Second, it adds a \n\t\tdegree of flexibility, allowing us to define variants of \n\t\twidening, such as delayed widening, without resorting to \n\t\tintrusive surgery on an underlying fixpoint engine.  Third, \n\t\tit adds a degree of robustness, by making it difficult for\n\t\tan analysis implementor to make certain subtle (syntactic vs \n\t\tsemantic) category mistakes. The paper supports these claims \n\t\twith examples. Our proposal has been implemented in a \n\t\tstate-of-the-art abstract interpreter, and we briefly report \n\t\ton the changes that the revised view necessitated.},\n  keywords  = {Fixed points, Abstract domains, Abstract interpretation, Widening},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Widening ensures or accelerates convergence of a program analysis, and sometimes contributes a guarantee of soundness that would otherwise be absent. In this paper we propose a generalised view of widening, in which widening operates on values that are not necessarily elements of the given abstract domain, although they must be in a correspondence, the details of which we spell out. We show that the new view generalizes the traditional view, and that at least three distinct advantages flow from the generalization. First, it gives a handle on ``compositional safety'', the problem of creating widening operators for product domains. Second, it adds a degree of flexibility, allowing us to define variants of widening, such as delayed widening, without resorting to intrusive surgery on an underlying fixpoint engine. Third, it adds a degree of robustness, by making it difficult for an analysis implementor to make certain subtle (syntactic vs semantic) category mistakes. The paper supports these claims with examples. Our proposal has been implemented in a state-of-the-art abstract interpreter, and we briefly report on the changes that the revised view necessitated.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wang-sndergaard-stuckey-wombitaportfoliobitvectorsolverusingwordlevelpropagation-2019\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Wang, W.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Automated Reasoning</i>, 63(3): 723–762.  2019.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/s10817-018-9493-1\"\n     onclick=\"log_download('wang-sndergaard-stuckey-wombitaportfoliobitvectorsolverusingwordlevelpropagation-2019', 'http://doi.org/10.1007/s10817-018-9493-1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wang-sndergaard-stuckey-wombitaportfoliobitvectorsolverusingwordlevelpropagation-2019\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wang-sndergaard-stuckey-wombitaportfoliobitvectorsolverusingwordlevelpropagation-2019')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Wan-Son-Stu_JAR19,\n  author    = {Wenxi Wang and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Wombit: A Portfolio Bit-Vector Solver Using Word-Level \n\t\tPropagation},\n  journal   = {Journal of Automated Reasoning},\n  volume    = {63},\n  number    = {3},\n  pages     = {723--762},\n  year      = {2019},\n  doi       = {10.1007/s10817-018-9493-1},\n  abstract  = {We develop an idea originally proposed by Michel and Van \n\t\tHentenryck of how to perform bit-vector constraint propagation \n\t\ton the word level. Most operations are propagated in constant \n\t\ttime, assuming the bit-vector fits in a machine word.\n\t\tIn contrast, bit-vector SMT solvers usually solve bit-vector \n\t\tproblems by (ultimately) bit-blasting, that is, mapping the \n\t\tresulting operations to conjunctive normal form clauses, and \n\t\tusing SAT technology to solve them. Bit-blasting generates \n\t\tintermediate variables which can be an advantage, as these can \n\t\tbe searched on and learnt about. As each approach has \n\t\tadvantages, it makes sense to try to combine them. In this \n\t\tpaper, we describe an approach to bit-vector solving using\n\t\tword-level propagation with learning. We have designed \n\t\talternative word-level propagators to Michel and Van \n\t\tHentenryck&#x27;s, and evaluated different variants of the approach.\n\t\tWe have also experimented with different approaches to learning\n\t\tand back-jumping in the solver. Based on the insights gained, \n\t\twe have built a portfolio solver, Wombit, which essentially \n\t\textends the STP bit-vector solver. Using machine learning \n\t\ttechniques, the solver makes a judicious up-front decision \n\t\tabout whether to use word-level propagation or fall back on \n\t\tbit-blasting.},\n  keywords  = {SMT solving, Constraint propagation, Program verification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We develop an idea originally proposed by Michel and Van Hentenryck of how to perform bit-vector constraint propagation on the word level. Most operations are propagated in constant time, assuming the bit-vector fits in a machine word. In contrast, bit-vector SMT solvers usually solve bit-vector problems by (ultimately) bit-blasting, that is, mapping the resulting operations to conjunctive normal form clauses, and using SAT technology to solve them. Bit-blasting generates intermediate variables which can be an advantage, as these can be searched on and learnt about. As each approach has advantages, it makes sense to try to combine them. In this paper, we describe an approach to bit-vector solving using word-level propagation with learning. We have designed alternative word-level propagators to Michel and Van Hentenryck's, and evaluated different variants of the approach. We have also experimented with different approaches to learning and back-jumping in the solver. Based on the insights gained, we have built a portfolio solver, Wombit, which essentially extends the STP bit-vector solver. Using machine learning techniques, the solver makes a judicious up-front decision about whether to use word-level propagation or fall back on bit-blasting.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2018\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2018')\"\n      onkeypress=\"toggleGroup('group_2018')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2018</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve', event);\">\n    Symbolic Execution with Invariant Inlay: Evaluating the Potential.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Alatawi, E.; Miller, T.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 25th Australasian Software Engineering Conference (ASWEC 2018)</i>, pages 26–30,  2018. IEEE Computing Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve\"\n     onclick=\"log_download('alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Symbolic Execution with Invariant Inlay: Evaluating the Potential [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ASWEC.2018.00012\"\n     onclick=\"log_download('alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018', 'http://doi.org/10.1109/ASWEC.2018.00012', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('alatawi-miller-sndergaard-symbolicexecutionwithinvariantinlayevaluatingthepotential-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ala-Mil-Son_ASWEC18,\n  author    = {Eman Alatawi and \n\t\tTim Miller and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Symbolic Execution with Invariant Inlay:\n                Evaluating the Potential},\n  booktitle = {Proceedings of the 25th Australasian Software Engineering\n                Conference (ASWEC 2018)},\n  pages     = {26--30},\n  publisher = {IEEE Computing Society},\n  year      = {2018},\n  doi       = {10.1109/ASWEC.2018.00012},\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/38cf593c-2b7f-5e30-aa42-13b74180ed5d/retrieve},\n  abstract  = {Dynamic symbolic execution (DSE) is a non-standard execution \n\t\tmechanism which, loosely, executes a program symbolically and, \n\t\tsimultaneously, on concrete input. DSE is attractive because of\n\t\tseveral uses in software engineering, including the generation\n\t\tof test data suites with large coverage relative to test suite\n\t\tsize. However, DSE struggles in the face of execution path \n\t\texplosion, and is often unable to cover certain kinds of \n\t\tdifficult-to-reach program points. Invariant inlay is a \n\t\ttechnique that aims to improve a DSE tool by interspersing code\n\t\twith invariants, generated automatically using off-the-shelf \n\t\ttools for static program analysis. To capitalise fully on a \n\t\tstatic analyzer, invariant inlay first applies certain \n\t\ttestability transformations to the program source. In this \n\t\tpaper we account for how we have evaluated the idea \n\t\texperimentally, in order to determine its usefulness for\n\t\tprograms with complex control flow.},\n  keywords  = {Symbolic execution, Static analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Dynamic symbolic execution (DSE) is a non-standard execution mechanism which, loosely, executes a program symbolically and, simultaneously, on concrete input. DSE is attractive because of several uses in software engineering, including the generation of test data suites with large coverage relative to test suite size. However, DSE struggles in the face of execution path explosion, and is often unable to cover certain kinds of difficult-to-reach program points. Invariant inlay is a technique that aims to improve a DSE tool by interspersing code with invariants, generated automatically using off-the-shelf tools for static program analysis. To capitalise fully on a static analyzer, invariant inlay first applies certain testability transformations to the program source. In this paper we account for how we have evaluated the idea experimentally, in order to determine its usefulness for programs with complex control flow.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve', event);\">\n    Reference Abstract Domains and Applications to String Analysis.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Gange, G.; Gauthier, F.; Jordan, A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Stuckey, P. J.;  and Zhang, C.\n</span>\n\n  \n\n</span>\n\n  <i>Fundamenta Informaticae</i>, 158(4): 297–326.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve\"\n     onclick=\"log_download('amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Reference Abstract Domains and Applications to String Analysis [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.3233/FI-2018-1650\"\n     onclick=\"log_download('amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018', 'http://doi.org/10.3233/FI-2018-1650', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-gange-gauthier-jordan-schachte-sndergaard-stuckey-zhang-referenceabstractdomainsandapplicationstostringanalysis-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Ama-Gan-Gau-Jor-Sch-Son-Stu-Zha_FI18,\n  author    = {Roberto Amadini and \n\t\tGraeme Gange and \n\t\tFran{\\c{c}}ois Gauthier and\n\t\tAlexander Jordan and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey and\n\t\tChenyi Zhang},\n  title     = {Reference Abstract Domains and Applications to String Analysis},\n  journal   = {Fundamenta Informaticae},\n  volume    = {158},\n  number    = {4},\n  pages     = {297--326},\n  year      = {2018},\n  doi       = {10.3233/FI-2018-1650},\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/c17b2e2c-f7ea-57c4-8d54-926629bfa3f7/retrieve},\n  abstract  = {Abstract interpretation is a well established theory that \n\t\tsupports reasoning about the run-time behaviour of programs.\n\t\tIt achieves tractable reasoning by considering abstractions of\n\t\trun-time states, rather than the states themselves. The chosen\n\t\tset of abstractions is referred to as the abstract domain.\n\t\tWe develop a novel framework for combining (a possibly large \n\t\tnumber of) abstract domains. It achieves the effect of the \n\t\tso-called reduced product without requiring a quadratic number\n\t\tof functions to translate information among abstract domains. A\n\t\tcentral notion is a reference domain, a medium for information\n\t\texchange. Our approach suggests a novel and simpler way to \n\t\tmanage the integration of large numbers of abstract domains.\n\t\tWe instantiate our framework in the context of string analysis.\n\t\tBrowser-embedded dynamic programming languages such as \n\t\tJavaScript and PHP encourage the use of strings as a universal\n\t\tdata type for both code and data values. The ensuing \n\t\tvulnerabilities have made string analysis a focus of much\n\t\trecent research. String analysis tends to combine many \n\t\telementary string abstract domains, each designed to capture \n\t\ta specific aspect of strings. For this instance the set of \n\t\tregular languages, while too expensive to use directly for \n\t\tanalysis, provides an attractive reference domain, enabling \n\t\tthe efficient simulation of reduced products of multiple\n\t\tstring abstract domains.},\n  keywords  = {String analysis, Abstract interpretation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstract interpretation is a well established theory that supports reasoning about the run-time behaviour of programs. It achieves tractable reasoning by considering abstractions of run-time states, rather than the states themselves. The chosen set of abstractions is referred to as the abstract domain. We develop a novel framework for combining (a possibly large number of) abstract domains. It achieves the effect of the so-called reduced product without requiring a quadratic number of functions to translate information among abstract domains. A central notion is a reference domain, a medium for information exchange. Our approach suggests a novel and simpler way to manage the integration of large numbers of abstract domains. We instantiate our framework in the context of string analysis. Browser-embedded dynamic programming languages such as JavaScript and PHP encourage the use of strings as a universal data type for both code and data values. The ensuing vulnerabilities have made string analysis a focus of much recent research. String analysis tends to combine many elementary string abstract domains, each designed to capture a specific aspect of strings. For this instance the set of regular languages, while too expensive to use directly for analysis, provides an attractive reference domain, enabling the efficient simulation of reduced products of multiple string abstract domains.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kafle-gallagher-gange-schachte-sndergaard-stuckey-aniterativeapproachtopreconditioninferenceusingconstrainedhornclauses-2018\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Iterative Approach to Precondition Inference Using Constrained Horn Clauses.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kafle, B.; Gallagher, J.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Theory and Practice of Logic Programming</i>, 18: 553–570.  2018.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1017/S1471068418000091\"\n     onclick=\"log_download('kafle-gallagher-gange-schachte-sndergaard-stuckey-aniterativeapproachtopreconditioninferenceusingconstrainedhornclauses-2018', 'http://doi.org/10.1017/S1471068418000091', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kafle-gallagher-gange-schachte-sndergaard-stuckey-aniterativeapproachtopreconditioninferenceusingconstrainedhornclauses-2018\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kafle-gallagher-gange-schachte-sndergaard-stuckey-aniterativeapproachtopreconditioninferenceusingconstrainedhornclauses-2018')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Kaf-Gal-Gan-Sch-Son-Stu_TPLP18,\n  author    = {Bishoksan Kafle and \n\t\tJohn Gallagher and \n\t\tGraeme Gange and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {An Iterative Approach to Precondition Inference Using\n                Constrained {Horn} Clauses},\n  journal   = {Theory and Practice of Logic Programming},\n  volume    = {18},\n  pages     = {553--570},\n  year      = {2018},\n  doi       = {10.1017/S1471068418000091},\n  abstract  = {We present a method for automatic inference of conditions on \n\t\tthe initial states of a program that guarantee that the safety \n\t\tassertions in the program are not violated. Constrained Horn \n\t\tclauses (CHCs) are used to model the program and assertions in \n\t\ta uniform way, and we use standard abstract interpretations to \n\t\tderive an over-approximation of the set of unsafe initial states.\n\t\tThe precondition then is the constraint corresponding to the \n\t\tcomplement of that set, under-approximating the set of safe \n\t\tinitial states. This idea of complementation is not new, but \n\t\tprevious attempts to exploit it have suffered from loss of \n\t\tprecision. Here we develop an iterative specialisation algorithm\n\t\tto give more precise, and in some cases optimal safety \n\t\tconditions. The algorithm combines existing transformations, \n\t\tnamely constraint specialisation, partial evaluation and a \n\t\ttrace elimination transformation. The last two of these \n\t\ttransformations perform polyvariant specialisation, leading \n\t\tto disjunctive constraints which improve precision. The \n\t\talgorithm is implemented and tested on a benchmark suite of \n\t\tprograms from the literature in precondition inference and \n\t\tsoftware verification competitions.},\n  keywords  = {Program verification, Horn clauses, Program transformation, Partial evaluation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a method for automatic inference of conditions on the initial states of a program that guarantee that the safety assertions in the program are not violated. Constrained Horn clauses (CHCs) are used to model the program and assertions in a uniform way, and we use standard abstract interpretations to derive an over-approximation of the set of unsafe initial states. The precondition then is the constraint corresponding to the complement of that set, under-approximating the set of safe initial states. This idea of complementation is not new, but previous attempts to exploit it have suffered from loss of precision. Here we develop an iterative specialisation algorithm to give more precise, and in some cases optimal safety conditions. The algorithm combines existing transformations, namely constraint specialisation, partial evaluation and a trace elimination transformation. The last two of these transformations perform polyvariant specialisation, leading to disjunctive constraints which improve precision. The algorithm is implemented and tested on a benchmark suite of programs from the literature in precondition inference and software verification competitions.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2017\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2017')\"\n      onkeypress=\"toggleGroup('group_2017')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2017</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve', event);\">\n    Leveraging Abstract Interpretation for Efficient Dynamic Symbolic Execution.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Alatawi, E.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Miller, T.\n</span>\n\n  \n\n</span>\n\n  In Rosu, G.; Di Penta, M.;  and Nguyen, T. N., editor(s), <i>Proceedings of the 32nd ACM/IEEE International Conference on Automated Software Engineering</i>, pages 619–624,  2017. IEEE Computing Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve\"\n     onclick=\"log_download('alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017', 'https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Leveraging Abstract Interpretation for Efficient Dynamic Symbolic Execution [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ASE.2017.8115672\"\n     onclick=\"log_download('alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017', 'http://doi.org/10.1109/ASE.2017.8115672', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('alatawi-sndergaard-miller-leveragingabstractinterpretationforefficientdynamicsymbolicexecution-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ala-Son-Mil_ASE17,\n  author    = {Eman Alatawi and \n\t\tHarald S{\\o}ndergaard and\n\t\tTim Miller},\n  title     = {Leveraging Abstract Interpretation for Efficient Dynamic \n\t\tSymbolic Execution},\n  editor    = {G. Rosu and  M. {Di Penta} and T. N. Nguyen},\n  booktitle = {Proceedings of the 32nd ACM/IEEE International Conference on \n\t\tAutomated Software Engineering},\n  pages     = {619--624},\n  publisher = {IEEE Computing Society},\n  year      = {2017},\n  doi       = {10.1109/ASE.2017.8115672},\n  url_Paper = {https://minerva-access.unimelb.edu.au/rest/bitstreams/7d0c6934-364c-5596-b09d-d0e55f344c13/retrieve},\n  abstract  = {Dynamic Symbolic Execution (DSE) is a technique to automatically\n\t\tgenerate test inputs by executing the program simultaneously \n\t\twith concrete and symbolic values. A key challenge in DSE is \n\t\tscalability, as executing all feasible program paths is not \n\t\tpossible, owing to the possibly exponential or infinite number \n\t\tof program paths. Loops, in particular those where the number \n\t\tof iterations depends on an input of the program, are a source \n\t\tof path explosion. They cause problems because DSE maintains \n\t\tsymbolic values that capture only the data dependencies on\n\t\tsymbolic inputs. This ignores control dependencies, including \n\t\tloop dependencies that depend indirectly on the inputs. We \n\t\tpropose a method to increase the coverage achieved by DSE in \n\t\tthe presence of input-data dependent loops and loop dependent \n\t\tbranches. We combine DSE with abstract interpretation to find \n\t\tindirect control dependencies, including loop and branch \n\t\tindirect dependencies. Preliminary results show that this \n\t\tresults in better coverage, within considerably less time \n\t\tcompared to standard DSE.},\n  keywords  = {Symbolic execution, Static analysis, Abstract interpretation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Dynamic Symbolic Execution (DSE) is a technique to automatically generate test inputs by executing the program simultaneously with concrete and symbolic values. A key challenge in DSE is scalability, as executing all feasible program paths is not possible, owing to the possibly exponential or infinite number of program paths. Loops, in particular those where the number of iterations depends on an input of the program, are a source of path explosion. They cause problems because DSE maintains symbolic values that capture only the data dependencies on symbolic inputs. This ignores control dependencies, including loop dependencies that depend indirectly on the inputs. We propose a method to increase the coverage achieved by DSE in the presence of input-data dependent loops and loop dependent branches. We combine DSE with abstract interpretation to find indirect control dependencies, including loop and branch indirect dependencies. Preliminary results show that this results in better coverage, within considerably less time compared to standard DSE.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"amadini-jordan-gange-gauthier-schachte-sndergaard-stuckey-zhang-combiningstringabstractdomainsforjavascriptanalysisanevaluation-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Combining String Abstract Domains for JavaScript Analysis: An Evaluation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Amadini, R.; Jordan, A.; Gange, G.; Gauthier, F.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Stuckey, P. J.;  and Zhang, C.\n</span>\n\n  \n\n</span>\n\n  In Legay, A.;  and Margaria, T., editor(s), <i>TACAS 2017: Proceedings of the 23rd International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, volume 10205, of <i>Lecture Notes in Computer Science</i>, pages 41–57,  2017. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-54577-5_3\"\n     onclick=\"log_download('amadini-jordan-gange-gauthier-schachte-sndergaard-stuckey-zhang-combiningstringabstractdomainsforjavascriptanalysisanevaluation-2017', 'http://doi.org/10.1007/978-3-662-54577-5_3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/amadini-jordan-gange-gauthier-schachte-sndergaard-stuckey-zhang-combiningstringabstractdomainsforjavascriptanalysisanevaluation-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('amadini-jordan-gange-gauthier-schachte-sndergaard-stuckey-zhang-combiningstringabstractdomainsforjavascriptanalysisanevaluation-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Ama-Jor-Gan-Gau-Sch-Son-Stu-Zha_TACAS17,\n  author    = {Roberto Amadini and \n\t\tAlexander Jordan and \n\t\tGraeme Gange and \n\t\tFran{\\c{c}}ois Gauthier and\n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey and\n\t\tChenyi Zhang},\n  title     = {Combining String Abstract Domains for {JavaScript} Analysis: \n\t\tAn Evaluation},\n  editor    = {A. Legay and T. Margaria},\n  booktitle = {TACAS 2017: Proceedings of the 23rd International\n\t\tConference on Tools and Algorithms for the Construction \n\t\tand Analysis of Systems},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {10205},\n  pages     = {41--57},\n  publisher = {Springer},\n  year      = {2017},\n  doi       = {10.1007/978-3-662-54577-5_3},\n  abstract  = {Strings play a central role in JavaScript and similar scripting\n\t\tlanguages. Owing to dynamic features such as the eval function\n\t\tand dynamic property access, precise string analysis is a \n\t\tprerequisite for automated reasoning about practically any \n\t\tkind of runtime property. Although the literature presents \n\t\ta considerable number of abstract domains for capturing and \n\t\trepresenting specific aspect of strings, we are not aware of \n\t\ttools that allow flexible combination of string abstract \n\t\tdomains. Indeed, support for string analysis is often confined\n\t\tto a single, dedicated string domain. In this paper we \n\t\tdescribe a framework that allows us to combine multiple string\n\t\tabstract domains for the analysis of JavaScript programs. \n\t\tIt is implemented as an extension of SAFE, an open-source \n\t\tstatic analysis tool. We investigate different combinations \n\t\tof abstract domains that capture various aspects of strings.\n\t\tOur evaluation suggests that a combination of few, simple \n\t\tabstract domains suffice to outperform the precision of \n\t\tstate-of-the-art static analysis tools for JavaScript.},\n  keywords  = {String solvers, Abstract domains, Abstract interpretation, JavaScript},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Strings play a central role in JavaScript and similar scripting languages. Owing to dynamic features such as the eval function and dynamic property access, precise string analysis is a prerequisite for automated reasoning about practically any kind of runtime property. Although the literature presents a considerable number of abstract domains for capturing and representing specific aspect of strings, we are not aware of tools that allow flexible combination of string abstract domains. Indeed, support for string analysis is often confined to a single, dedicated string domain. In this paper we describe a framework that allows us to combine multiple string abstract domains for the analysis of JavaScript programs. It is implemented as an extension of SAFE, an open-source static analysis tool. We investigate different combinations of abstract domains that capture various aspects of strings. Our evaluation suggests that a combination of few, simple abstract domains suffice to outperform the precision of state-of-the-art static analysis tools for JavaScript.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kafle-gange-schachte-sndergaard-stuckey-abendersdecompositionapproachtodecidingmodularlinearintegerarithmetic-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kafle, B.; Gange, G.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Gaspers, S.;  and Walsh, T., editor(s), <i>Theory and Applications of Satisfiability Testing (SAT 2017)</i>, volume 10491, of <i>Lecture Notes in Computer Science</i>, pages 380–397,  2017. Springer International Publishing\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-66263-3_24\"\n     onclick=\"log_download('kafle-gange-schachte-sndergaard-stuckey-abendersdecompositionapproachtodecidingmodularlinearintegerarithmetic-2017', 'http://doi.org/10.1007/978-3-319-66263-3_24', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kafle-gange-schachte-sndergaard-stuckey-abendersdecompositionapproachtodecidingmodularlinearintegerarithmetic-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kafle-gange-schachte-sndergaard-stuckey-abendersdecompositionapproachtodecidingmodularlinearintegerarithmetic-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Kaf-Gan-Sch-Son-Stu_SAT17,\n  author    = {Bishoksan Kafle and \n\t\tGraeme Gange and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A {Benders} Decomposition Approach to Deciding Modular\n                Linear Integer Arithmetic},\n  editor    = {S. Gaspers and T. Walsh},\n  booktitle = {Theory and Applications of Satisfiability Testing (SAT 2017)},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {10491},\n  pages     = {380--397},\n  publisher = {Springer International Publishing},\n  year      = {2017},\n  doi       = {10.1007/978-3-319-66263-3_24},\n  abstract  = {Verification tasks frequently require deciding systems of \n\t\tlinear constraints over modular (machine) arithmetic. \n\t\tExisting approaches for reasoning over modular arithmetic \n\t\tuse bit-vector solvers, or else approximate machine integers \n\t\twith mathematical integers and use arithmetic solvers. \n\t\tNeither is ideal; the first is sound but inefficient, and the \n\t\tsecond is efficient but unsound. We describe a linear encoding \n\t\twhich correctly describes modular arithmetic semantics, \n\t\tyielding an optimistic but sound approach. Our method \n\t\tabstracts the problem with linear arithmetic, but \n\t\tprogressively refines the abstraction when modular semantics \n\t\tis violated. This preserves soundness while exploiting the \n\t\tmostly integer nature of the constraint problem. We present \n\t\ta prototype implementation, which gives encouraging \n\t\texperimental results.},\n  keywords  = {Program verification, Constraint solving, Machine arithmetic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Verification tasks frequently require deciding systems of linear constraints over modular (machine) arithmetic. Existing approaches for reasoning over modular arithmetic use bit-vector solvers, or else approximate machine integers with mathematical integers and use arithmetic solvers. Neither is ideal; the first is sound but inefficient, and the second is efficient but unsound. We describe a linear encoding which correctly describes modular arithmetic semantics, yielding an optimistic but sound approach. Our method abstracts the problem with linear arithmetic, but progressively refines the abstraction when modular semantics is violated. This preserves soundness while exploiting the mostly integer nature of the constraint problem. We present a prototype implementation, which gives encouraging experimental results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"mendoza-sndergaard-venables-makingsenseoflearningmanagementsystemsquizanalyticsinunderstandingstudentslearningdifficulties-2017\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Making Sense of Learning Management System's Quiz Analytics in Understanding Students' Learning Difficulties.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Mendoza, A.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Venables, A.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 28th Annual Conference of the Australasian Association for Engineering Education (AAEE2017)</i>, pages 112–119,  2017. Australasian Association for Engineering Education\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/mendoza-sndergaard-venables-makingsenseoflearningmanagementsystemsquizanalyticsinunderstandingstudentslearningdifficulties-2017\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('mendoza-sndergaard-venables-makingsenseoflearningmanagementsystemsquizanalyticsinunderstandingstudentslearningdifficulties-2017')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Men-Son-Ven_AAEE17,\n  author    = {Antonette Mendoza and\n\t\tHarald S{\\o}ndergaard and \n\t\tAnne Venables},\n  title     = {Making Sense of Learning Management System&#x27;s Quiz Analytics\n        \tin Understanding Students&#x27; Learning Difficulties},\n  booktitle = {Proceedings of the 28th Annual Conference of the\n        \tAustralasian Association for Engineering Education (AAEE2017)},\n  pages     = {112--119},\n  location  = {Manly, New South Wales},\n  publisher = {Australasian Association for Engineering Education},\n  year      = {2017},\n  keywords  = {Education},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2016\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2016')\"\n      onkeypress=\"toggleGroup('group_2016')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2016</span>\n      <span class=\"bibbase_group_count\">\n        \n        (6)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"alatawi-miller-sndergaard-generatingsourceinputsformetamorphictestingusingdynamicsymbolicexecution-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Generating Source Inputs for Metamorphic Testing Using Dynamic Symbolic Execution.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Alatawi, E.; Miller, T.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>MET'16: Proceedings of the First International Workshop on Metamorphic Testing</i>, pages 19–25,  2016. ACM\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2896971.2896980\"\n     onclick=\"log_download('alatawi-miller-sndergaard-generatingsourceinputsformetamorphictestingusingdynamicsymbolicexecution-2016', 'http://doi.org/10.1145/2896971.2896980', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/alatawi-miller-sndergaard-generatingsourceinputsformetamorphictestingusingdynamicsymbolicexecution-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('alatawi-miller-sndergaard-generatingsourceinputsformetamorphictestingusingdynamicsymbolicexecution-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ala-Mil-Son_MET16,\n  author    = {Eman Alatawi and \n\t\tTim Miller and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Generating Source Inputs for Metamorphic Testing\n                Using Dynamic Symbolic Execution},\n  booktitle = {MET&#x27;16: Proceedings of the First International Workshop on\n                Metamorphic Testing},\n  pages     = {19--25},\n  publisher = {ACM},\n  year      = {2016},\n  doi       = {10.1145/2896971.2896980},\n  isbn      = {978-1-4503-4163-9},\n  abstract  = {Metamorphic testing uses domain-specific properties about\n                a program&#x27;s intended behaviour to alleviate the oracle\n                problem. From a given set of source test inputs, a set of\n                follow-up test inputs are generated which have some\n                relation to the source inputs, and their outputs are\n                compared to outputs from the source tests, using\n                metamorphic relations.  We evaluate the use of an\n                automated test input generation technique called dynamic\n                symbolic execution (DSE) to generate the source test\n                inputs for metamorphic testing. We investigate whether\n                DSE increases source-code coverage and fault finding\n                effectiveness of metamorphic testing compared to the use\n                of random testing, and whether the use of metamorphic\n                relations as a supportive technique improves the test\n                inputs generated by DSE. Our results show that DSE\n                improves the coverage and fault detection rate of\n                metamorphic testing compared to random testing using\n                significantly smaller test suites, and the use of\n                metamorphic relations increases code coverage of both\n                DSE and random tests considerably, but the improvement\n                in the fault detection rate may be marginal and depends\n                on the used metamorphic relations.},\n  keywords  = {Symbolic execution, Testing},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Metamorphic testing uses domain-specific properties about a program's intended behaviour to alleviate the oracle problem. From a given set of source test inputs, a set of follow-up test inputs are generated which have some relation to the source inputs, and their outputs are compared to outputs from the source tests, using metamorphic relations. We evaluate the use of an automated test input generation technique called dynamic symbolic execution (DSE) to generate the source test inputs for metamorphic testing. We investigate whether DSE increases source-code coverage and fault finding effectiveness of metamorphic testing compared to the use of random testing, and whether the use of metamorphic relations as a supportive technique improves the test inputs generated by DSE. Our results show that DSE improves the coverage and fault detection rate of metamorphic testing compared to random testing using significantly smaller test suites, and the use of metamorphic relations increases code coverage of both DSE and random tests considerably, but the improvement in the fault detection rate may be marginal and depends on the used metamorphic relations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-exploitingsparsityindifferenceboundmatrices-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exploiting Sparsity in Difference-Bound Matrices.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Rival, X., editor(s), <i>Static Analysis: Proceedings of the 23rd International Symposium</i>, volume 9837, of <i>Lecture Notes in Computer Science</i>, pages 189–211,  2016. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-53413-7\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-exploitingsparsityindifferenceboundmatrices-2016', 'http://doi.org/10.1007/978-3-662-53413-7', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-exploitingsparsityindifferenceboundmatrices-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-exploitingsparsityindifferenceboundmatrices-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Gan-Nav-Sch-Son-Stu_SAS16,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Exploiting Sparsity in Difference-Bound Matrices},\n  editor    = {X. Rival},\n  booktitle = {Static Analysis:\n                Proceedings of the 23rd International Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9837},\n  pages     = {189--211},\n  publisher = {Springer},\n  year      = {2016},\n  doi       = {10.1007/978-3-662-53413-7},\n  abstract  = {Relational numeric abstract domains are very important in \n\t\tprogram analysis. Common domains, such as Zones and Octagons, \n\t\tare usually conceptualised with weighted digraphs and \n\t\timplemented using difference-bound matrices (DBMs). \n\t\tUnfortunately, though conceptually simple, direct \n\t\timplementations of graph-based domains tend to perform\n\t\tpoorly in practice, and are impractical for analyzing large \n\t\tcode-bases. We propose new DBM algorithms that exploit \n\t\tsparsity and closed operands. In particular, a new \n\t\trepresentation which we call split normal form reduces graph\n\t\tdensity on typical abstract states. We compare the resulting \n\t\timplementation with several existing DBM-based abstract \n\t\tdomains, and show that we can substantially reduce the time\n\t\tto perform full DBM analysis, without sacrificing precision.},\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Relational numeric abstract domains are very important in program analysis. Common domains, such as Zones and Octagons, are usually conceptualised with weighted digraphs and implemented using difference-bound matrices (DBMs). Unfortunately, though conceptually simple, direct implementations of graph-based domains tend to perform poorly in practice, and are impractical for analyzing large code-bases. We propose new DBM algorithms that exploit sparsity and closed operands. In particular, a new representation which we call split normal form reduces graph density on typical abstract states. We compare the resulting implementation with several existing DBM-based abstract domains, and show that we can substantially reduce the time to perform full DBM analysis, without sacrificing precision.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-acompleterefinementprocedureforregularseparabilityofcontextfreelanguages-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Complete Refinement Procedure for Regular Separability of Context-Free Languages.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Theoretical Computer Science</i>, 625: 1–24. April 2016.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.tcs.2016.01.026\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-acompleterefinementprocedureforregularseparabilityofcontextfreelanguages-2016', 'http://doi.org/10.1016/j.tcs.2016.01.026', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-acompleterefinementprocedureforregularseparabilityofcontextfreelanguages-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-acompleterefinementprocedureforregularseparabilityofcontextfreelanguages-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Nav-Sch-Son-Stu_TCS16,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Complete Refinement Procedure for Regular Separability\n                of Context-Free Languages},\n  journal   = {Theoretical Computer Science},\n  volume    = {625},\n  pages     = {1--24},\n  month     = {April},\n  year      = {2016},\n  doi       = {10.1016/j.tcs.2016.01.026},\n  abstract  = {Often, when analyzing the behaviour of systems modelled \n\t\tas context-free languages, we wish to know if two \n\t\tlanguages overlap.  To this end, we present a class of \n\t\tsemi-decision procedures for regular separability of \n\t\tcontext-free languages, based on counter-example guided \n\t\tabstraction refinement.  We propose two effective\n\t\tinstances of this approach, one that is complete but \n\t\trelatively expensive, and one that is inexpensive and \n\t\tsound, but for which we do not have a completeness proof.\n\t\tThe complete method will prove disjointness whenever the \n\t\tinput languages are regularly separable. Both methods \n\t\twill terminate whenever the input languages overlap. \n\t\tWe provide an experimental evaluation of these procedures,\n\t\tand demonstrate their practicality on a range of \n\t\tverification and language-theoretic instances.},\n  keywords  = {String analysis, Formal languages, Program verification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Often, when analyzing the behaviour of systems modelled as context-free languages, we wish to know if two languages overlap. To this end, we present a class of semi-decision procedures for regular separability of context-free languages, based on counter-example guided abstraction refinement. We propose two effective instances of this approach, one that is complete but relatively expensive, and one that is inexpensive and sound, but for which we do not have a completeness proof. The complete method will prove disjointness whenever the input languages are regularly separable. Both methods will terminate whenever the input languages overlap. We provide an experimental evaluation of these procedures, and demonstrate their practicality on a range of verification and language-theoretic instances.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-anabstractdomainofuninterpretedfunctions-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Abstract Domain of Uninterpreted Functions.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Jobstmann, B.;  and Leino, K. R. M., editor(s), <i>Verification, Model Checking and Abstract Interpretation: Proceedings of the 17th International Conference</i>, volume 9583, of <i>Lecture Notes in Computer Science</i>, pages 85–103,  2016. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-662-49122-5\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-anabstractdomainofuninterpretedfunctions-2016', 'http://doi.org/10.1007/978-3-662-49122-5', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-anabstractdomainofuninterpretedfunctions-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-anabstractdomainofuninterpretedfunctions-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Gan-Nav-Sch-Son-Stu_VMCAI15,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {An Abstract Domain of Uninterpreted Functions},\n  editor    = {B. Jobstmann and K. R. M. Leino},\n  booktitle = {Verification, Model Checking and Abstract Interpretation:\n                Proceedings of the 17th International Conference},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9583},\n  pages     = {85--103},\n  publisher = {Springer},\n  year      = {2016},\n  isbn      = {978-3-662-49121-8},\n  doi       = {10.1007/978-3-662-49122-5},\n  abstract  = {We revisit relational static analysis of numeric variables.\n\t\tSuch analyses face two difficulties. First, even inexpensive \n\t\trelational domains scale too poorly to be practical for large \n\t\tcode-bases. Second, to remain tractable they have extremely \n\t\tcoarse handling of non-linear relations. In this paper, we \n\t\tintroduce the subterm domain, a weakly relational abstract \n\t\tdomain for inferring equivalences amongst sub-expressions,\n\t\tbased on the theory of uninterpreted functions. This provides \n\t\tan extremely cheap approach for enriching non-relational \n\t\tdomains with relational information, and enhances precision \n\t\tof both relational and non-relational domains in the presence\n\t\tof non-linear operations. We evaluate the idea in the context \n\t\tof the software verification tool SeaHorn.},\n  keywords  = {Abstract domains, Abstract interpretation, Static analysis, Program verification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We revisit relational static analysis of numeric variables. Such analyses face two difficulties. First, even inexpensive relational domains scale too poorly to be practical for large code-bases. Second, to remain tractable they have extremely coarse handling of non-linear relations. In this paper, we introduce the subterm domain, a weakly relational abstract domain for inferring equivalences amongst sub-expressions, based on the theory of uninterpreted functions. This provides an extremely cheap approach for enriching non-relational domains with relational information, and enhances precision of both relational and non-relational domains in the presence of non-linear operations. We evaluate the idea in the context of the software verification tool SeaHorn.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lin-miller-sndergaard-compositionalsymbolicexecutionincrementalsolvingrevisited-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Compositional Symbolic Execution: Incremental Solving Revisited.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Lin, Y.; Miller, T.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Potanin, A.;  and Murphy, G., editor(s), <i>APSEC'16: Proceedings of the 23rd Asia-Pacific Software Engineering Conference</i>, pages 273–280,  2016. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/APSEC.2016.046\"\n     onclick=\"log_download('lin-miller-sndergaard-compositionalsymbolicexecutionincrementalsolvingrevisited-2016', 'http://doi.org/10.1109/APSEC.2016.046', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lin-miller-sndergaard-compositionalsymbolicexecutionincrementalsolvingrevisited-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lin-miller-sndergaard-compositionalsymbolicexecutionincrementalsolvingrevisited-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Lin-Mil-Son_APSEC16,\n  author    = {Yude Lin and \n\t\tTim Miller and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Compositional Symbolic Execution: Incremental Solving Revisited},\n  editor    = {A. Potanin and G. Murphy},\n  booktitle = {APSEC&#x27;16: Proceedings of the 23rd Asia-Pacific Software \n\t\tEngineering Conference},\n  pages     = {273--280},\n  location  = {Hamilton, New Zealand},\n  year      = {2016},\n  doi       = {10.1109/APSEC.2016.046},\n  abstract  = {Symbolic execution can automatically explore different execution\n  \t\tpaths in a system under test and generate tests to precisely \n\t\tcover them. It has two main advantages---being automatic and \n\t\tthorough within a theory---and has many successful applications.\n\t\tThe bottleneck of symbolic execution currently is the \n\t\tcomputation consumption for complex systems. Compositional \n\t\tSymbolic Execution (CSE) introduces a summarisation module to \n\t\teliminate the redundancy in the exploration of repeatedly \n\t\tencountered code. In our previous work, we generalised the \n\t\tsummarisation for any code fragments instead of functions. \n\t\tIn this paper, we transplant this idea onto LLVM with many \n\t\tadditional features, one of them being the use of incremental \n\t\tsolving. We show that the combination of CSE and incremental \n\t\tsolving is mutually beneficial. The obvious weakness of CSE is \n\t\tthe lack of context during summarisation. We discuss the use\n  \t\tof assumption-based features, available in modern constraint\n  \t\tsolvers, as a way to overcome this problem.},\n  keywords  = {Symbolic execution, LLVM},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Symbolic execution can automatically explore different execution paths in a system under test and generate tests to precisely cover them. It has two main advantages—being automatic and thorough within a theory—and has many successful applications. The bottleneck of symbolic execution currently is the computation consumption for complex systems. Compositional Symbolic Execution (CSE) introduces a summarisation module to eliminate the redundancy in the exploration of repeatedly encountered code. In our previous work, we generalised the summarisation for any code fragments instead of functions. In this paper, we transplant this idea onto LLVM with many additional features, one of them being the use of incremental solving. We show that the combination of CSE and incremental solving is mutually beneficial. The obvious weakness of CSE is the lack of context during summarisation. We discuss the use of assumption-based features, available in modern constraint solvers, as a way to overcome this problem.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"wang-sndergaard-stuckey-abitvectorsolverwithwordlevelpropagation-2016\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Bit-Vector Solver with Word-Level Propagation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Wang, W.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Quimper, C., editor(s), <i>Integration of AI and OR Techniques in Constraint Programming: Proceedings of the 13th International Conference</i>, volume 9676, of <i>Lecture Notes in Computer Science</i>, pages 374–391,  2016. Springer International Publishing\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-33954-2_27\"\n     onclick=\"log_download('wang-sndergaard-stuckey-abitvectorsolverwithwordlevelpropagation-2016', 'http://doi.org/10.1007/978-3-319-33954-2_27', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/wang-sndergaard-stuckey-abitvectorsolverwithwordlevelpropagation-2016\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('wang-sndergaard-stuckey-abitvectorsolverwithwordlevelpropagation-2016')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Wan-Son-Stu_CPAIOR16,\n  author    = {Wenxi Wang and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Bit-Vector Solver with Word-Level Propagation},\n  editor    = {C.-G. Quimper},\n  booktitle = {Integration of AI and OR Techniques in Constraint Programming:\n                Proceedings of the 13th International Conference},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9676},\n  pages     = {374--391},\n  publisher = {Springer International Publishing},\n  year      = {2016},\n  isbn      = {978-3-319-33953-5},\n  doi       = {10.1007/978-3-319-33954-2_27},\n  abstract  = {Reasoning with bit-vectors arises in a variety of \n\t\tapplications in verification and cryptography. \n\t\tMichel and Van Hentenryck have proposed an interesting \n\t\tapproach to bit-vector constraint propagation on the \n\t\tword level. Each of the operations except comparison \n\t\tare constant time, assuming the bit-vector fits in a \n\t\tmachine word. In contrast, bit-vector SMT solvers \n\t\tusually solve bit-vector problems by bit-blasting, \n\t\tthat is, mapping the resulting operations to conjunctive \n\t\tnormal form clauses, and using SAT technology to solve \n\t\tthem. This also means generating intermediate variables \n\t\twhich can be an advantage, as these can be searched on \n\t\tand learnt about. Since each approach has advantages \n\t\tit is important to see whether we can benefit from \n\t\tthese advantages by using a word-level propagation \n\t\tapproach with learning. In this paper we describe an \n\t\tapproach to bit-vector solving using word-level \n\t\tpropagation with learning. We provide alternative \n\t\tword-level propagators to Michel and Van Hentenryck, \n\t\tand give the first empirical evaluation of their approach\n\t\tthat we are aware of. We show that, with careful \n\t\tengineering, a word-level propagation based approach \n\t\tcan compete with (or complement) bit-blasting.},\n  keywords  = {SMT solving, Constraint propagation, Program verification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Reasoning with bit-vectors arises in a variety of applications in verification and cryptography. Michel and Van Hentenryck have proposed an interesting approach to bit-vector constraint propagation on the word level. Each of the operations except comparison are constant time, assuming the bit-vector fits in a machine word. In contrast, bit-vector SMT solvers usually solve bit-vector problems by bit-blasting, that is, mapping the resulting operations to conjunctive normal form clauses, and using SAT technology to solve them. This also means generating intermediate variables which can be an advantage, as these can be searched on and learnt about. Since each approach has advantages it is important to see whether we can benefit from these advantages by using a word-level propagation approach with learning. In this paper we describe an approach to bit-vector solving using word-level propagation with learning. We provide alternative word-level propagators to Michel and Van Hentenryck, and give the first empirical evaluation of their approach that we are aware of. We show that, with careful engineering, a word-level propagation based approach can compete with (or complement) bit-blasting.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2015\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2015')\"\n      onkeypress=\"toggleGroup('group_2015')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2015</span>\n      <span class=\"bibbase_group_count\">\n        \n        (7)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"alatawi-miller-sndergaard-usingmetamorphictestingtoimprovedynamicsymbolicexecution-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Using Metamorphic Testing to Improve Dynamic Symbolic Execution.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Alatawi, E.; Miller, T.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 24th Australasian Software Engineering Conference (ASWEC 2015)</i>, pages 38–47,  2015. IEEE Computing Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ASWEC.2015.16\"\n     onclick=\"log_download('alatawi-miller-sndergaard-usingmetamorphictestingtoimprovedynamicsymbolicexecution-2015', 'http://doi.org/10.1109/ASWEC.2015.16', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/alatawi-miller-sndergaard-usingmetamorphictestingtoimprovedynamicsymbolicexecution-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('alatawi-miller-sndergaard-usingmetamorphictestingtoimprovedynamicsymbolicexecution-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Ala-Mil-Son_ASWEC15,\n  author    = {Eman Alatawi and \n\t\tTim Miller and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Using Metamorphic Testing to Improve Dynamic Symbolic Execution},\n  booktitle = {Proceedings of the 24th Australasian Software Engineering\n                Conference (ASWEC 2015)},\n  pages     = {38--47},\n  publisher = {IEEE Computing Society},\n  year      = {2015},\n  doi       = {10.1109/ASWEC.2015.16},\n  abstract  = {Dynamic symbolic execution (DSE) is an approach for automatically\n\t\tgenerating test inputs from source code using constraint \n\t\tinformation. It is used in \\emph{fuzzing}: the execution of \n\t\ttests while monitoring for generic properties such as buffer \n\t\toverflows and other security violations. Limitations of DSE for\n\t\tfuzzing are two-fold: (1) only generic properties are checked: \n\t\tmany deviations from specified behaviour are not found; and \n\t\t(2) many programs are not entirely amenable to DSE because they\n\t\tgive rise to hard constraints, so that some parts of a program \n\t\tremain uncovered. In this paper, we discuss how to mitigate \n\t\tthese problems using \\emph{metamorphic testing} (MT). \n\t\tMetamorphic testing uses domain-specific properties about \n\t\tprogram behaviour, relating pairs of inputs to pairs of outputs.\n\t\tFrom a given test suite, \\emph{follow-up tests inputs} are \n\t\tgenerated, and their outputs are compared to outputs from the \n\t\toriginal tests, using \\emph{metamorphic relations}. Our \n\t\thypothesis is that using metamorphic testing increases the \n\t\tability of a DSE test suite to find faults, and that the \n\t\tfollow-up tests execute some previously-uncovered segments. \n\t\tWe have experimented with seven small but non-trivial libraries,\n\t\tcomparing DSE test suites with DSE+MT test suites, demonstrating\n\t\tthat DSE+MT test suites improve coverage marginally, but find \n\t\tmore faults.},\n  keywords  = {Symbolic execution, Testing},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Dynamic symbolic execution (DSE) is an approach for automatically generating test inputs from source code using constraint information. It is used in \\emphfuzzing: the execution of tests while monitoring for generic properties such as buffer overflows and other security violations. Limitations of DSE for fuzzing are two-fold: (1) only generic properties are checked: many deviations from specified behaviour are not found; and (2) many programs are not entirely amenable to DSE because they give rise to hard constraints, so that some parts of a program remain uncovered. In this paper, we discuss how to mitigate these problems using \\emphmetamorphic testing (MT). Metamorphic testing uses domain-specific properties about program behaviour, relating pairs of inputs to pairs of outputs. From a given test suite, \\emphfollow-up tests inputs are generated, and their outputs are compared to outputs from the original tests, using \\emphmetamorphic relations. Our hypothesis is that using metamorphic testing increases the ability of a DSE test suite to find faults, and that the follow-up tests execute some previously-uncovered segments. We have experimented with seven small but non-trivial libraries, comparing DSE test suites with DSE+MT test suites, demonstrating that DSE+MT test suites improve coverage marginally, but find more faults.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"cornish-gange-navas-schachte-sndergaard-stuckey-analyzingarraymanipulatingprogramsbyprogramtransformation-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Analyzing Array Manipulating Programs by Program Transformation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Cornish, J. R. M.; Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Proietti, M.;  and Seki, H., editor(s), <i>Logic-Based Program Synthesis and Transformation: Proceedings of the 24th International Symposium</i>, volume 8981, of <i>Lecture Notes in Computer Science</i>, pages 3–20,  2015. Springer International\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-17822-6_1\"\n     onclick=\"log_download('cornish-gange-navas-schachte-sndergaard-stuckey-analyzingarraymanipulatingprogramsbyprogramtransformation-2015', 'http://doi.org/10.1007/978-3-319-17822-6_1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cornish-gange-navas-schachte-sndergaard-stuckey-analyzingarraymanipulatingprogramsbyprogramtransformation-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cornish-gange-navas-schachte-sndergaard-stuckey-analyzingarraymanipulatingprogramsbyprogramtransformation-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Cor-Gan-Nav-Sch-Son-Stu_LOPSTR14,\n  author    = {J. Robert M. Cornish and \n\t\tGraeme Gange and \n\t\tJorge Navas and\n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Analyzing Array Manipulating Programs by Program Transformation},\n  editor    = {M. Proietti and H. Seki},\n  booktitle = {Logic-Based Program Synthesis and Transformation:\n                Proceedings of the 24th International Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {8981},\n  pages     = {3--20},\n  publisher = {Springer International},\n  year      = {2015},\n  doi       = {10.1007/978-3-319-17822-6_1},\n  abstract  = {We explore a transformational approach to the problem \n\t\tof verifying simple array-manipulating programs.  \n\t\tTraditionally, verification of such programs requires \n\t\tintricate analysis machinery to reason with universally\n\t\tquantified statements about symbolic array segments, \n\t\tsuch as &#x60;&#x60;every data item stored in the segment A[i] \n\t\tto A[j] is equal to the corresponding item stored in the\n\t\tsegment B[i] to B[j].&#x27;&#x27; We define a simple abstract \n\t\tmachine which allows for set-valued variables and we \n\t\tshow how to translate programs with array operations to\n\t\tarray-free code for this machine.  For the purpose of \n\t\tprogram analysis, the translated program remains faithful\n\t\tto the semantics of array manipulation.  Based on our \n\t\timplementation in LLVM, we evaluate the approach with\n\t\trespect to its ability to extract useful invariants and \n\t\tthe cost in terms of code size.},\n  keywords  = {Program transformation, Static analysis, Array analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We explore a transformational approach to the problem of verifying simple array-manipulating programs. Traditionally, verification of such programs requires intricate analysis machinery to reason with universally quantified statements about symbolic array segments, such as ``every data item stored in the segment A[i] to A[j] is equal to the corresponding item stored in the segment B[i] to B[j].'' We define a simple abstract machine which allows for set-valued variables and we show how to translate programs with array operations to array-free code for this machine. For the purpose of program analysis, the translated program remains faithful to the semantics of array manipulation. Based on our implementation in LLVM, we evaluate the approach with respect to its ability to extract useful invariants and the cost in terms of code size.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015', 'http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf', event);\">\n    Optimisation and Relaxation for Planning in the Situation Calculus.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Davies, T. O.; Pearce, A. R.; Stuckey, P. J.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Bordini, R. H.; Elkind, E.; Weiss, G.;  and Yolum, P., editor(s), <i>Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2015)</i>, pages 1141–1149,  2015. IFAAMAS\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf\"\n     onclick=\"log_download('davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015', 'http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/pdf.svg\"\n\t     alt=\"Optimisation and Relaxation for Planning in the Situation Calculus [pdf]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('davies-pearce-stuckey-sndergaard-optimisationandrelaxationforplanninginthesituationcalculus-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Dav-Pea-Stu-Son_AAMAS15,\n  author    = {Toby O. Davies and \n\t\tAdrian R. Pearce and\n                Peter J. Stuckey and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Optimisation and Relaxation for Planning in the Situation\n                Calculus},\n  editor    = {R. H. Bordini and E. Elkind and G. Weiss and P. Yolum},\n  booktitle = {Proceedings of the 14th International Conference\n                on Autonomous Agents and Multiagent Systems (AAMAS 2015)},\n  pages     = {1141--1149},\n  publisher = {IFAAMAS},\n  year      = {2015},  \n  url_Paper = {http://www.aamas2015.com/en/AAMAS_2015_USB/aamas/p1141.pdf},\n  abstract  = {The situation calculus can express rich agent behaviours and \n\t\tgoals and facilitates the reduction of complex planning \n\t\tproblems to theorem proving. However, in many planning \n\t\tproblems, solution quality is critically important, and the \n\t\tachievable quality is not necessarily known in advance.\n\t\tExisting \\textsc{Golog} implementations merely search for a \n\t\t\\emph{legal} plan, typically relying on depth-first search to \n\t\tfind an execution. We illustrate where existing strategies \n\t\twill not terminate when quality is considered, and to overcome\n\t\tthis limitation we formally introduce the notion of \\emph{cost}\n\t\tto simplify the search for a solution. The main contribution is\n\t\ta new class of relaxations of the planning problem, termed \n\t\t\\emph{precondition relaxations}, based on Lagrangian relaxation.\n\t\tWe show how this facilitates optimisation of a restricted class\n\t\tof \\textsc{Golog} programs for which plan existence (under a \n\t\tcost budget) is decidable. It allows for tractably computing \n\t\trelaxations to the planning problem and leads to a general, \n\t\t\\emph{blackbox}, approach to optimally solving multi-agent \n\t\tplanning problems without explicit reference to the semantics \n\t\tof interleaved concurrency.},\n  keywords  = {Planning, Artificial intelligence},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The situation calculus can express rich agent behaviours and goals and facilitates the reduction of complex planning problems to theorem proving. However, in many planning problems, solution quality is critically important, and the achievable quality is not necessarily known in advance. Existing \\textscGolog implementations merely search for a \\emphlegal plan, typically relying on depth-first search to find an execution. We illustrate where existing strategies will not terminate when quality is considered, and to overcome this limitation we formally introduce the notion of \\emphcost to simplify the search for a solution. The main contribution is a new class of relaxations of the planning problem, termed \\emphprecondition relaxations, based on Lagrangian relaxation. We show how this facilitates optimisation of a restricted class of \\textscGolog programs for which plan existence (under a cost budget) is decidable. It allows for tractably computing relaxations to the planning problem and leads to a general, \\emphblackbox, approach to optimally solving multi-agent planning problems without explicit reference to the semantics of interleaved concurrency.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-atoolforintersectingcontextfreegrammarsanditsapplications-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Tool for Intersecting Context-Free Grammars and Its Applications.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Havelund, K.; Holzmann, G.;  and Joshi, R., editor(s), <i>NASA Formal Methods: Proceedings of the Seventh International Symposium</i>, volume 9058, of <i>Lecture Notes in Computer Science</i>, pages 422–428,  2015. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-319-17524-9\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-atoolforintersectingcontextfreegrammarsanditsapplications-2015', 'http://doi.org/10.1007/978-3-319-17524-9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-atoolforintersectingcontextfreegrammarsanditsapplications-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-atoolforintersectingcontextfreegrammarsanditsapplications-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Gan-Nav-Sch-Son-Stu_NFM15,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Tool for Intersecting Context-Free Grammars and Its\n                Applications},\n  editor    = {K. Havelund and G. Holzmann and R. Joshi},\n  booktitle = {NASA Formal Methods:\n                Proceedings of the Seventh International Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {9058},\n  pages     = {422--428},\n  publisher = {Springer},\n  year      = {2015},\n  doi       = {10.1007/978-3-319-17524-9},\n  abstract  = {This paper describes a tool for intersecting context-free\n\t\tgrammars. Since this problem is undecidable the tool \n\t\tfollows a refinement-based approach and implements a \n\t\tnovel refinement which is complete for regularly \n\t\tseparable grammars. We show its effectiveness for safety\n\t\tverification of recursive multi-threaded programs.},\n  keywords  = {String analysis, Formal languages, Program verification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper describes a tool for intersecting context-free grammars. Since this problem is undecidable the tool follows a refinement-based approach and implements a novel refinement which is complete for regularly separable grammars. We show its effectiveness for safety verification of recursive multi-threaded programs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-intervalanalysisandmachinearithmeticwhysignednessignoranceisbliss-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Programming Languages and Systems</i>, 37(1): 1:1–1:35. january 2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1145/2651360\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-intervalanalysisandmachinearithmeticwhysignednessignoranceisbliss-2015', 'http://doi.org/http://dx.doi.org/10.1145/2651360', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-intervalanalysisandmachinearithmeticwhysignednessignoranceisbliss-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-intervalanalysisandmachinearithmeticwhysignednessignoranceisbliss-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Nav-Sch-Son-Stu_TOPLAS15,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and \n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Interval Analysis and Machine Arithmetic: \n                Why Signedness Ignorance Is Bliss},\n  journal   = {ACM Transactions on Programming Languages and Systems},\n  volume    = {37},\n  number    = {1},\n  pages     = {1:1--1:35},\n  month     = {january},\n  year      = {2015},\n  doi       = {http://dx.doi.org/10.1145/2651360},\n  abstract  = {The most commonly used integer types have fixed bit-width,\n\t\tmaking it possible for computations to &#x60;&#x60;wrap around&#x27;&#x27;,\n\t\tand many programs depend on this behaviour.  Yet much \n\t\twork to date on program analysis and verification of \n\t\tinteger computations treats integers as having infinite \n\t\tprecision, and most analyses that do respect fixed width\n\t\tlose precision when overflow is possible.  We present a \n\t\tnovel integer interval abstract domain that correctly \n\t\thandles wrap-around.  The analysis is signedness agnostic.\n\t\tBy treating integers as strings of bits, only considering\n\t\tsignedness for operations that treat them differently, \n\t\twe produce precise, correct results at a modest cost in \n\t\texecution time.},\n  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The most commonly used integer types have fixed bit-width, making it possible for computations to ``wrap around'', and many programs depend on this behaviour. Yet much work to date on program analysis and verification of integer computations treats integers as having infinite precision, and most analyses that do respect fixed width lose precision when overflow is possible. We present a novel integer interval abstract domain that correctly handles wrap-around. The analysis is signedness agnostic. By treating integers as strings of bits, only considering signedness for operations that treat them differently, we produce precise, correct results at a modest cost in execution time.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-hornclausesasanintermediaterepresentationforprogramanalysisandtransformation-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Horn Clauses As an Intermediate Representation for Program Analysis and Transformation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Theory and Practice of Logic Programming</i>, 15(4–5): 526–542.  2015.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/http://dx.doi.org/10.1017/S1471068415000204\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-hornclausesasanintermediaterepresentationforprogramanalysisandtransformation-2015', 'http://doi.org/http://dx.doi.org/10.1017/S1471068415000204', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-hornclausesasanintermediaterepresentationforprogramanalysisandtransformation-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-hornclausesasanintermediaterepresentationforprogramanalysisandtransformation-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Nav-Sch-Son-Stu_TPLP15,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Horn Clauses As an Intermediate Representation for \n                Program Analysis and Transformation},\n  journal   = {Theory and Practice of Logic Programming},\n  volume    = {15},\n  number    = {4--5},\n  pages     = {526--542},\n  year      = {2015},\n  doi       = {http://dx.doi.org/10.1017/S1471068415000204},\n  abstract  = {Many recent analyses for conventional imperative programs \n\t\tbegin by transforming programs into logic programs, \n\t\tcapitalising on existing LP analyses and simple LP \n\t\tsemantics.  We propose using logic programs as an \n\t\tintermediate program representation throughout the \n\t\tcompilation process.  With restrictions ensuring \n\t\tdeterminism and single-modedness, a logic program can \n\t\teasily be transformed to machine language or other \n\t\tlow-level language, while maintaining the simple semantics\n  \t\tthat makes it suitable as a language for program analysis\n\t\tand transformation.  We present a simple LP language that\n\t\tenforces determinism and single-modedness, and show that\n\t\tit makes a convenient program representation for analysis\n\t\tand transformation.},\n  keywords  = {Static analysis, Intermediate representations, Horn clauses, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many recent analyses for conventional imperative programs begin by transforming programs into logic programs, capitalising on existing LP analyses and simple LP semantics. We propose using logic programs as an intermediate program representation throughout the compilation process. With restrictions ensuring determinism and single-modedness, a logic program can easily be transformed to machine language or other low-level language, while maintaining the simple semantics that makes it suitable as a language for program analysis and transformation. We present a simple LP language that enforces determinism and single-modedness, and show that it makes a convenient program representation for analysis and transformation.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=7365810\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015', 'http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=7365810', event);\">\n    Compositional Symbolic Execution Using Fine-Grained Summaries.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Lin, Y.; Miller, T.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 24th Australasian Software Engineering Conference (ASWEC 2015)</i>, pages 213–222,  2015. IEEE Computing Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=7365810\"\n     onclick=\"log_download('lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015', 'http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=7365810', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Compositional Symbolic Execution Using Fine-Grained Summaries [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ASWEC.2015.32\"\n     onclick=\"log_download('lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015', 'http://doi.org/10.1109/ASWEC.2015.32', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('lin-miller-sndergaard-compositionalsymbolicexecutionusingfinegrainedsummaries-2015')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Lin-Mil-Son_ASWEC15,\n  author    = {Yude Lin and \n\t\tTim Miller and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Compositional Symbolic Execution Using Fine-Grained Summaries},\n  booktitle = {Proceedings of the 24th Australasian Software Engineering\n                Conference (ASWEC 2015)},\n  pages     = {213--222},\n  publisher = {IEEE Computing Society},\n  year      = {2015},\n  doi       = {10.1109/ASWEC.2015.32},\n  url_Paper = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=&amp;arnumber=7365810},\n  abstract  = {Compositional symbolic execution has been proposed as a way to \n\t\tincrease the efficiency of symbolic execution. Essentially, \n\t\twhen a function is symbolically executed, a \\emph{summary} of \n\t\tthe path that was executed is stored. This summary records the \n\t\tprecondition and postcondition of the path, and on subsequent \n\t\tcalls that satisfy that precondition, the corresponding \n\t\tpostcondition can be returned instead of executing the function\n\t\tagain. However, using functions as the unit of summarisation \n\t\tleaves the symbolic execution tool at the mercy of a program \n\t\tdesigner, essentially resulting in an arbitrary summarisation \n\t\tstrategy. In this paper, we explore the use of \n\t\t\\emph{fine-grained} summaries, in which blocks \\emph{within} \n\t\tfunctions are summarised. We propose three types of \n\t\tsummarisation and demonstrate how to generate these. At such a \n\t\tfine-grained level, symbolic execution of a path effectively \n\t\tbecomes the concatenation of the summaries along that path. \n\t\tUsing a prototype symbolic execution tool, we perform a \n\t\tpreliminary experimental evaluation of our summary approaches, \n\t\tdemonstrating that they can improve the speed of symbolic \n\t\texecution by reducing the number of calls sent to the \n\t\tunderlying constraint solver.},\n  keywords  = {Symbolic execution},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Compositional symbolic execution has been proposed as a way to increase the efficiency of symbolic execution. Essentially, when a function is symbolically executed, a \\emphsummary of the path that was executed is stored. This summary records the precondition and postcondition of the path, and on subsequent calls that satisfy that precondition, the corresponding postcondition can be returned instead of executing the function again. However, using functions as the unit of summarisation leaves the symbolic execution tool at the mercy of a program designer, essentially resulting in an arbitrary summarisation strategy. In this paper, we explore the use of \\emphfine-grained summaries, in which blocks \\emphwithin functions are summarised. We propose three types of summarisation and demonstrate how to generate these. At such a fine-grained level, symbolic execution of a path effectively becomes the concatenation of the summaries along that path. Using a prototype symbolic execution tool, we perform a preliminary experimental evaluation of our summary approaches, demonstrating that they can improve the speed of symbolic execution by reducing the number of calls sent to the underlying constraint solver.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2014\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2014')\"\n      onkeypress=\"toggleGroup('group_2014')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2014</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"people.eng.unimelb.edu.au/harald/www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014', 'people.eng.unimelb.edu.au/harald/www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015', event);\">\n    Fragment-Based Planning Using Column Generation.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Davies, T. O.; Pearce, A. R.; Stuckey, P. J.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Chien, S.; Do, M.; Fern, A.;  and Ruml, W., editor(s), <i>Proceedings of the 24th International Conference on Automated Planning and Scheduling</i>, pages 83–91,  2014. AAAI\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"people.eng.unimelb.edu.au/harald/www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015\"\n     onclick=\"log_download('davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014', 'people.eng.unimelb.edu.au/harald/www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Fragment-Based Planning Using Column Generation [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1609/icaps.v24i1.13628\"\n     onclick=\"log_download('davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014', 'http://doi.org/10.1609/icaps.v24i1.13628', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('davies-pearce-stuckey-sndergaard-fragmentbasedplanningusingcolumngeneration-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Dav-Pea-Stu-Son_ICAPS14,\n  author    = {Toby O. Davies and \n\t\tAdrian R. Pearce and\n                Peter J. Stuckey and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Fragment-Based Planning Using Column Generation},\n  editor    = {S. Chien and M. Do and A. Fern and W. Ruml},\n  booktitle = {Proceedings of the 24th International Conference\n                on Automated Planning and Scheduling},\n  pages     = {83--91},\n  publisher = {AAAI},\n  year      = {2014},  \n  url_Paper = {www.aaai.org/ocs/index.php/ICAPS/ICAPS14/paper/view/7907/8015},\n  doi       = {10.1609/icaps.v24i1.13628},\n  abstract  = {We introduce a novel algorithm for temporal planning in \n\t\t\\textsc{Golog} using shared resources, and describe the \n\t\tBulk Freight Rail Scheduling Problem, a motivating example\n\t\tof such a temporal domain. We use the framework of column \n\t\tgeneration to tackle complex resource constrained temporal \n\t\tplanning problems that are beyond the scope of current planning\n\t\ttechnology by combining: the global view of a linear programming\n\t\trelaxation of the problem; the strength of search in finding \n\t\taction sequences; and the domain knowledge that can be encoded \n\t\tin a \\textsc{Golog} program. We show that our approach \n\t\tsignificantly outperforms state-of-the-art temporal planning \n\t\tand constraint programming approaches in this domain, in \n\t\taddition to existing temporal \\textsc{Golog} implementations.\n\t\tWe also apply our algorithm to a temporal variant of \n\t\tblocks-world where our decomposition speeds proof of optimality\n\t\tsignificantly compared to other anytime algorithms. We discuss \n\t\tthe potential of the underlying algorithm being applicable to\n\t\tSTRIPS planning, with further work.},\n  keywords  = {Planning, Artificial intelligence},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We introduce a novel algorithm for temporal planning in \\textscGolog using shared resources, and describe the Bulk Freight Rail Scheduling Problem, a motivating example of such a temporal domain. We use the framework of column generation to tackle complex resource constrained temporal planning problems that are beyond the scope of current planning technology by combining: the global view of a linear programming relaxation of the problem; the strength of search in finding action sequences; and the domain knowledge that can be encoded in a \\textscGolog program. We show that our approach significantly outperforms state-of-the-art temporal planning and constraint programming approaches in this domain, in addition to existing temporal \\textscGolog implementations. We also apply our algorithm to a temporal variant of blocks-world where our decomposition speeds proof of optimality significantly compared to other anytime algorithms. We discuss the potential of the underlying algorithm being applicable to STRIPS planning, with further work.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://dx.doi.org/10.1109/TCAD.2014.2304176\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014', 'http://dx.doi.org/10.1109/TCAD.2014.2304176', event);\">\n    Four-Valued Reasoning and Cyclic Circuits.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Horsfall, B.; Naish, L.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, 33(7): 1003–1016. july 2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://dx.doi.org/10.1109/TCAD.2014.2304176\"\n     onclick=\"log_download('gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014', 'http://dx.doi.org/10.1109/TCAD.2014.2304176', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Four-Valued Reasoning and Cyclic Circuits [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1109/TCAD.2014.2304176\"\n     onclick=\"log_download('gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014', 'http://doi.org/10.1109/TCAD.2014.2304176', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-horsfall-naish-sndergaard-fourvaluedreasoningandcycliccircuits-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Hor-Nai-Son_TCAD14,\n  author    = {Graeme Gange and \n\t\tBenjamin Horsfall and \n\t\tLee Naish and\n                Harald S{\\o}ndergaard},\n  title     = {Four-Valued Reasoning and Cyclic Circuits},\n  journal   = {IEEE Transactions on Computer-Aided Design of Integrated\n                Circuits and Systems},\n  volume    = {33},\n  number    = {7},\n  pages     = {1003--1016},\n  month     = {july},\n  year      = {2014},\n  url_Paper = {http://dx.doi.org/10.1109/TCAD.2014.2304176},\n  doi       = {10.1109/TCAD.2014.2304176},\n  abstract  = {Allowing cycles in a logic circuit can be advantageous,\n\t\tfor example, by reducing the number of gates required to \n\t\timplement a given Boolean function, or set of functions.\n\t\tHowever, a cyclic circuit may easily be ill-behaved.\n\t\tFor instance it may have some output wire oscillate \n\t\tinstead of reaching a steady state.  Propositional \n\t\tthree-valued logic has long been used in tests for\n\t\twell-behaviour of cyclic circuits: a symbolic evaluation \n\t\tmethod known as ternary analysis provides one criterion \n\t\tfor well-behaviour under certain assumptions about wire \n\t\tand gate delay.  We revisit ternary analysis and argue \n\t\tfor the use of four truth values.  The fourth truth \n\t\tvalue allows for the distinction of &#x60;&#x60;undefined&#x27;&#x27; and\n\t\t&#x60;&#x60;underspecified&#x27;&#x27; behaviour.  Ability to under-specify \n\t\tbehaviour is useful, because, in a quest for smaller \n\t\tcircuits, an implementor can capitalize on degrees of \n\t\tfreedom offered in the specification.  Moreover, a fourth\n\t\ttruth value is attractive because, rather than complicating\n\t\t(ternary) circuit analysis, it introduces a pleasant \n\t\tsymmetry, in the form of contra-duality, as well as \n\t\tproviding a convenient framework for manipulating\n\t\tspecifications.  We use this symmetry to provide fixed \n\t\tpoint results that clarify how two-, three-, and four-valued\n\t\tanalyses are related, and to explain some observations about\n\t\tternary analysis.},\n  keywords  = {Fixed points, Many-valued logic, Logic circuits, Circuit synthesis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Allowing cycles in a logic circuit can be advantageous, for example, by reducing the number of gates required to implement a given Boolean function, or set of functions. However, a cyclic circuit may easily be ill-behaved. For instance it may have some output wire oscillate instead of reaching a steady state. Propositional three-valued logic has long been used in tests for well-behaviour of cyclic circuits: a symbolic evaluation method known as ternary analysis provides one criterion for well-behaviour under certain assumptions about wire and gate delay. We revisit ternary analysis and argue for the use of four truth values. The fourth truth value allows for the distinction of ``undefined'' and ``underspecified'' behaviour. Ability to under-specify behaviour is useful, because, in a quest for smaller circuits, an implementor can capitalize on degrees of freedom offered in the specification. Moreover, a fourth truth value is attractive because, rather than complicating (ternary) circuit analysis, it introduces a pleasant symmetry, in the form of contra-duality, as well as providing a convenient framework for manipulating specifications. We use this symmetry to provide fixed point results that clarify how two-, three-, and four-valued analyses are related, and to explain some observations about ternary analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-apartialorderapproachtoarraycontentanalysis-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Partial-Order Approach to Array Content Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n   2014.\n  <span class=\"note\">ArXiv preprint https://arxiv.org/abs/1408.1754</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.48550/arxiv.1408.1754\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-apartialorderapproachtoarraycontentanalysis-2014', 'http://doi.org/10.48550/arxiv.1408.1754', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-apartialorderapproachtoarraycontentanalysis-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-apartialorderapproachtoarraycontentanalysis-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@misc{Gan-Nav-Sch-Son-Stu_ArXiv14,\n  author    = {Graeme Gange and \n\t\tJorge Navas and \n\t\tPeter Schachte and\n                Harald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Partial-Order Approach to Array Content Analysis},\n  note      = {ArXiv preprint {https://arxiv.org/abs/1408.1754}},\n  year      = {2014},\n  doi       = {10.48550/arxiv.1408.1754},\n  abstract  = {We present a parametric abstract domain for array content \n\t\tanalysis. The method maintains invariants for contiguous \n\t\tregions of the array, similar to the methods of Gopan, Reps \n\t\tand Sagiv, and of Halbwachs and Peron. However, it introduces \n\t\ta novel concept of an array content graph, avoiding the need \n\t\tfor an up-front factorial partitioning step. The resulting \n\t\tanalysis can be used with arbitrary numeric relational \n\t\tabstract domains; we evaluate the domain on a range of \n\t\tarray manipulating program fragments.},\n  keywords  = {Abstract domains, Array analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a parametric abstract domain for array content analysis. The method maintains invariants for contiguous regions of the array, similar to the methods of Gopan, Reps and Sagiv, and of Halbwachs and Peron. However, it introduces a novel concept of an array content graph, avoiding the need for an up-front factorial partitioning step. The resulting analysis can be used with arbitrary numeric relational abstract domains; we evaluate the domain on a range of array manipulating program fragments.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-sndergaard-stuckey-synthesizingoptimalswitchinglattices-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Synthesizing Optimal Switching Lattices.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Design Automation of Electronic Systems</i>, 20(1): 6:1–6:14. november 2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2661632\"\n     onclick=\"log_download('gange-sndergaard-stuckey-synthesizingoptimalswitchinglattices-2014', 'http://doi.org/10.1145/2661632', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-sndergaard-stuckey-synthesizingoptimalswitchinglattices-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-sndergaard-stuckey-synthesizingoptimalswitchinglattices-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gan-Son-Stu_TODAES14,\n  author    = {Graeme Gange and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Synthesizing Optimal Switching Lattices},\n  journal   = {ACM Transactions on Design Automation of Electronic Systems},\n  volume    = {20},\n  number    = {1},\n  pages     = {6:1--6:14},\n  month     = {november},\n  year      = {2014},\n  doi       = {10.1145/2661632},\n  abstract  = {The use of nanoscale technologies to create electronic devices \n\t\thas revived interest in the use of regular structures for \n\t\tdefining complex logic functions. One such structure is the \n\t\tswitching lattice, a two-dimensional lattice of four-terminal \n\t\tswitches. We show how to directly construct switching lattices \n\t\tof polynomial size from arbitrary logic functions; we also show\n\t\thow to synthesize minimal-sized lattices by translating the \n\t\tproblem to the satisfiability problem for a restricted class of\n\t\tquantified Boolean formulas. The synthesis method is an anytime\n\t\talgorithm which uses modern SAT solving technology and \n\t\tdichotomic search. It improves considerably on an earlier \n\t\tproposal for creating switching lattices for arbitrary logic \n\t\tfunctions.},\n  keywords  = {Boolean logic, Logic circuits, Circuit synthesis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The use of nanoscale technologies to create electronic devices has revived interest in the use of regular structures for defining complex logic functions. One such structure is the switching lattice, a two-dimensional lattice of four-terminal switches. We show how to directly construct switching lattices of polynomial size from arbitrary logic functions; we also show how to synthesize minimal-sized lattices by translating the problem to the satisfiability problem for a restricted class of quantified Boolean formulas. The synthesis method is an anytime algorithm which uses modern SAT solving technology and dichotomic search. It improves considerably on an earlier proposal for creating switching lattices for arbitrary logic functions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naish-sndergaard-truthversusinformationinlogicprogramming-2014\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://journals.cambridge.org/repo_A89XyMV9\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naish-sndergaard-truthversusinformationinlogicprogramming-2014', 'http://journals.cambridge.org/repo_A89XyMV9', event);\">\n    Truth versus Information in Logic Programming.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naish, L.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Theory and Practice of Logic Programming</i>, 14(6): 803–840. november 2014.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://journals.cambridge.org/repo_A89XyMV9\"\n     onclick=\"log_download('naish-sndergaard-truthversusinformationinlogicprogramming-2014', 'http://journals.cambridge.org/repo_A89XyMV9', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Truth versus Information in Logic Programming [link]\"\n       title=\" paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\"> paper</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"http://doi.org/10.1017/S1471068413000069\"\n     onclick=\"log_download('naish-sndergaard-truthversusinformationinlogicprogramming-2014', 'http://doi.org/10.1017/S1471068413000069', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naish-sndergaard-truthversusinformationinlogicprogramming-2014\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naish-sndergaard-truthversusinformationinlogicprogramming-2014')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Nai-Son_TPLP14,\n  author    = {Lee Naish and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Truth versus Information in Logic Programming},\n  journal   = {Theory and Practice of Logic Programming},\n  volume    = {14},\n  number    = {6},\n  pages     = {803--840},\n  month     = {november},\n  year      = {2014},\n  url_Paper = {http://journals.cambridge.org/repo_A89XyMV9},\n  doi       = {10.1017/S1471068413000069},\n  abstract  = {The semantics of logic programs was originally described in \n\t\tterms of two-valued logic. Soon, however, it was realised that\n\t\tthree-valued logic had some natural advantages, as it provides \n\t\tdistinct values not only for truth and falsehood, but also for \n\t\t&#x60;&#x60;undefined&#x27;&#x27;. The three-valued semantics proposed by Fitting \n\t\tand by Kunen are closely related to what is computed by a \n\t\tlogic program, the third truth value being associated with \n\t\tnon-termination. A different three-valued semantics, proposed \n\t\tby Naish, shared much with those of Fitting and Kunen but \n\t\tincorporated allowances for programmer intent, the third truth \n\t\tvalue being associated with underspecification. Naish used an \n\t\t(apparently) novel &#x60;&#x60;arrow&#x27;&#x27; operator to relate the intended\n\t\tmeaning of left and right sides of predicate definitions. In \n\t\tthis paper we suggest that the additional truth values of \n\t\tFitting/Kunen and Naish are best viewed as duals. We use \n\t\tBelnap&#x27;s four-valued logic, also used elsewhere by Fitting, \n\t\tto unify the two three-valued approaches. The truth values are \n\t\tarranged in a bilattice which supports the classical ordering \n\t\ton truth values as well as the &#x60;&#x60;information ordering&#x27;&#x27;. We \n\t\tnote that the &#x60;&#x60;arrow&#x27;&#x27; operator of Naish (and our four-valued\n\t\textension) is essentially the information ordering, whereas the\n\t\tclassical arrow denotes the truth ordering. This allows us to \n\t\tshed new light on many aspects of logic programming, including \n\t\tprogram analysis, type and mode systems, declarative debugging \n\t\tand the relationships between specifications and programs, and \n\t\tsuccessive executions states of a program.},\n  keywords  = {Logic programming, Semantics, Many-valued logic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood, but also for ``undefined''. The three-valued semantics proposed by Fitting and by Kunen are closely related to what is computed by a logic program, the third truth value being associated with non-termination. A different three-valued semantics, proposed by Naish, shared much with those of Fitting and Kunen but incorporated allowances for programmer intent, the third truth value being associated with underspecification. Naish used an (apparently) novel ``arrow'' operator to relate the intended meaning of left and right sides of predicate definitions. In this paper we suggest that the additional truth values of Fitting/Kunen and Naish are best viewed as duals. We use Belnap's four-valued logic, also used elsewhere by Fitting, to unify the two three-valued approaches. The truth values are arranged in a bilattice which supports the classical ordering on truth values as well as the ``information ordering''. We note that the ``arrow'' operator of Naish (and our four-valued extension) is essentially the information ordering, whereas the classical arrow denotes the truth ordering. This allows us to shed new light on many aspects of logic programming, including program analysis, type and mode systems, declarative debugging and the relationships between specifications and programs, and successive executions states of a program.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2013\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2013')\"\n      onkeypress=\"toggleGroup('group_2013')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2013</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"davis-schachte-somogyi-sndergaard-alowoverheadmethodforrecoveringunusedmemoryinsideregions-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Low Overhead Method for Recovering Unused Memory Inside Regions.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Davis, M.; Schachte, P.; Somogyi, Z.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2013 ACM Workshop on Memory Systems Performance and Correctness (MSPC 2013)</i>,  2013. ACM Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2492408.2492415\"\n     onclick=\"log_download('davis-schachte-somogyi-sndergaard-alowoverheadmethodforrecoveringunusedmemoryinsideregions-2013', 'http://doi.org/10.1145/2492408.2492415', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/davis-schachte-somogyi-sndergaard-alowoverheadmethodforrecoveringunusedmemoryinsideregions-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('davis-schachte-somogyi-sndergaard-alowoverheadmethodforrecoveringunusedmemoryinsideregions-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Dav-Sch-Som-Son_MSPC13,\n  author    = {Matthew Davis and \n\t\tPeter Schachte and \n\t\tZoltan Somogyi and\n\t\tHarald S{\\o}ndergaard},\n  title     = {A Low Overhead Method for Recovering Unused Memory \n\t\tInside Regions},\n  booktitle = {Proceedings of the 2013 ACM Workshop on Memory Systems \n\t\tPerformance and Correctness (MSPC 2013)},\n  publisher = {ACM Press},\n  year      = {2013},\n  doi       = {10.1145/2492408.2492415},\n  abstract  = {Automating memory management improves both resource safety\n\t\tand programmer productivity.  One approach, region-based\n\t\tmemory management (RBMM), applies compile-time reasoning\n\t\tto identify points in a program at which memory can be \n\t\tsafely reclaimed.  The main advantage of RBMM over \n\t\ttraditional garbage collection (GC) is the avoidance of \n\t\texpensive runtime analysis, which makes reclaiming memory\n\t\tmuch faster.  On the other hand, GC requires no static \n\t\tanalysis, and, operating at runtime, can have \n\t\tsignificantly more accurate information about object \n\t\tlifetimes.  In this paper we propose a hybrid system\n\t\tthat seeks to combine the advantages of both methods\n\t\twhile avoiding the overheads that previous hybrid systems\n\t\tincurred.  Our system can also reclaim array segments \n\t\twhose elements are no longer reachable.},\n  keywords  = {Memory management, Compilation, Go},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Automating memory management improves both resource safety and programmer productivity. One approach, region-based memory management (RBMM), applies compile-time reasoning to identify points in a program at which memory can be safely reclaimed. The main advantage of RBMM over traditional garbage collection (GC) is the avoidance of expensive runtime analysis, which makes reclaiming memory much faster. On the other hand, GC requires no static analysis, and, operating at runtime, can have significantly more accurate information about object lifetimes. In this paper we propose a hybrid system that seeks to combine the advantages of both methods while avoiding the overheads that previous hybrid systems incurred. Our system can also reclaim array segments whose elements are no longer reachable.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-abstractinterpretationovernonlatticeabstractdomains-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Abstract Interpretation over Non-Lattice Abstract Domains.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Logozzo, F.;  and Fähndrich, M., editor(s), <i>Static Analysis</i>, volume 7935, of <i>Lecture Notes in Computer Science</i>, pages 6–24,  2013. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-38856-9_3\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-abstractinterpretationovernonlatticeabstractdomains-2013', 'http://doi.org/10.1007/978-3-642-38856-9_3', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-abstractinterpretationovernonlatticeabstractdomains-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-abstractinterpretationovernonlatticeabstractdomains-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gan-Nav-Sch-Son-Stu_SAS13,\n  author    = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Abstract Interpretation over Non-Lattice Abstract Domains},\n  editor    = {F. Logozzo and M. F{\\&quot;a}hndrich},\n  booktitle = {Static Analysis},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7935},\n  pages     = {6--24},\n  publisher = {Springer},\n  year      = {2013},\n  doi       = {10.1007/978-3-642-38856-9_3},\n  abstract  = {The classical theoretical framework for static analysis of\n\t\tprograms is abstract interpretation. Much of the power and \n\t\telegance of that framework rests on the assumption that an \n\t\tabstract domain is a lattice. Nonetheless, and for good reason,\n\t\tthe literature on program analysis provides many examples of \n\t\tnon-lattice domains, including non-convex numeric domains. \n\t\tThe lack of domain structure, however, has negative \n\t\tconsequences, both for the precision of program analysis and \n\t\tfor the termination of standard Kleene iteration. In this paper \n\t\twe explore these consequences and present general remedies.},\n  keywords  = {Fixed points, Abstract domains, Lattice theory},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The classical theoretical framework for static analysis of programs is abstract interpretation. Much of the power and elegance of that framework rests on the assumption that an abstract domain is a lattice. Nonetheless, and for good reason, the literature on program analysis provides many examples of non-lattice domains, including non-convex numeric domains. The lack of domain structure, however, has negative consequences, both for the precision of program analysis and for the termination of standard Kleene iteration. In this paper we explore these consequences and present general remedies.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Failure Tabled Constraint Logic Programming by Interpolation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Theory and Practice of Logic Programming</i>, 13(4–5): 593–607.  2013.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1017/S1471068413000379\"\n     onclick=\"log_download('gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013', 'http://doi.org/10.1017/S1471068413000379', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-schachte-sndergaard-stuckey-failuretabledconstraintlogicprogrammingbyinterpolation-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Gan-Nav-Sch-Son-Stu_TPLP13,\n  author    = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter Schachte and\n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Failure Tabled Constraint Logic Programming by Interpolation},\n  journal   = {Theory and Practice of Logic Programming},\n  volume    = {13},\n  number    = {4--5},\n  pages     = {593--607},\n  year      = {2013},\n  doi       = {10.1017/S1471068413000379},\n  abstract  = {We present a new execution strategy for constraint logic\n\t\tprograms called \\emph{Failure Tabled CLP}. Similarly to\n\t\t\\emph{Tabled CLP} our strategy records certain derivations\n\t\tin order to prune further derivations. However, our method\n\t\tonly learns from \\emph{failed derivations}. This allows us\n\t\tto compute \\emph{interpolants} rather than \n\t\t\\emph{constraint projection} for generation of \n\t\t\\emph{reuse conditions}. As a result, our technique can\n\t\tbe used where projection is too expensive or does not \n\t\texist. Our experiments indicate that Failure Tabling can\n\t\tspeed up the execution of programs with many redundant \n\t\tfailed derivations as well as achieve termination in the\n\t\tpresence of infinite executions.},\n  keywords  = {Logic programming, Interpolants},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a new execution strategy for constraint logic programs called \\emphFailure Tabled CLP. Similarly to \\emphTabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from \\emphfailed derivations. This allows us to compute \\emphinterpolants rather than \\emphconstraint projection for generation of \\emphreuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-navas-stuckey-sndergaard-schachte-unboundedmodelcheckingwithinterpolationforregularlanguageconstraints-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Unbounded Model-Checking with Interpolation for Regular Language Constraints.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; Navas, J. A.; Stuckey, P. J.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Schachte, P.\n</span>\n\n  \n\n</span>\n\n  In Piterman, N.;  and Smolka, S., editor(s), <i>TACAS 2013: Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, volume 7795, of <i>Lecture Notes in Computer Science</i>, pages 277–291,  2013. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-36742-7_20\"\n     onclick=\"log_download('gange-navas-stuckey-sndergaard-schachte-unboundedmodelcheckingwithinterpolationforregularlanguageconstraints-2013', 'http://doi.org/10.1007/978-3-642-36742-7_20', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-navas-stuckey-sndergaard-schachte-unboundedmodelcheckingwithinterpolationforregularlanguageconstraints-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-navas-stuckey-sndergaard-schachte-unboundedmodelcheckingwithinterpolationforregularlanguageconstraints-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gan-Nav-Stu-Son-Sch_TACAS13,\n  author    = {Graeme Gange and \n\t\tJorge A. Navas and \n\t\tPeter J. Stuckey and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter Schachte},\n  title     = {Unbounded Model-Checking with Interpolation for Regular\n                Language Constraints},\n  editor    = {N. Piterman and S. Smolka},\n  booktitle = {TACAS 2013: Proceedings of the 19th International\n\t\tConference on Tools and Algorithms for the Construction \n\t\tand Analysis of Systems},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7795},\n  pages     = {277--291},\n  publisher = {Springer},\n  year      = {2013},\n  doi       = {10.1007/978-3-642-36742-7_20},\n  abstract  = {We present a decision procedure for the problem of, \n\t\tgiven a set of regular expressions $R_1, \\ldots, R_n$,\n\t\tdetermining whether $R = R_1 \\cap \\cdots \\cap R_n$ is \n\t\tempty.  Our solver, \\sys{revenant}, finitely unrolls \n\t\tautomata for $R_1, \\ldots, R_n$, encoding each as a \n\t\tset of propositional constraints.  If a SAT solver \n\t\tdetermines satisfiability then $R$ is non-empty. Otherwise\n\t\tour solver uses unbounded model checking techniques \n\t\tto extract an interpolant from the bounded proof.  \n\t\tThis interpolant serves as an overapproximation of $R$.  \n\t\tIf the solver reaches a fixed-point with the constraints\n\t\tremaining unsatisfiable, it has proven $R$ to be empty.\n\t\tOtherwise, it increases the unrolling depth and repeats.\n\t\tWe compare \\textsc{revenant} with other state-of-the-art \n\t\tstring solvers.  Evaluation suggests that it behaves\n\t\tbetter for constraints that express the intersection of\n\t\tsets of regular languages, a case of interest in the \n\t\tcontext of verification.},\n  keywords  = {Static analysis, Formal languages, Model checking, Interpolants, String constraints},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a decision procedure for the problem of, given a set of regular expressions $R_1, …, R_n$, determining whether $R = R_1 ∩ ⋯ ∩ R_n$ is empty. Our solver, \\sysrevenant, finitely unrolls automata for $R_1, …, R_n$, encoding each as a set of propositional constraints. If a SAT solver determines satisfiability then $R$ is non-empty. Otherwise our solver uses unbounded model checking techniques to extract an interpolant from the bounded proof. This interpolant serves as an overapproximation of $R$. If the solver reaches a fixed-point with the constraints remaining unsatisfiable, it has proven $R$ to be empty. Otherwise, it increases the unrolling depth and repeats. We compare \\textscrevenant with other state-of-the-art string solvers. Evaluation suggests that it behaves better for constraints that express the intersection of sets of regular languages, a case of interest in the context of verification.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gange-sndergaard-stuckey-schachte-solvingdifferenceconstraintsovermodulararithmetic-2013\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Solving Difference Constraints over Modular Arithmetic.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gange, G.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Stuckey, P. J.;  and Schachte, P.\n</span>\n\n  \n\n</span>\n\n  In Bonacina, M. P., editor(s), <i>CADE 2013: Proceedings of the 24th International Conference on Automated Deduction</i>, volume 7898, of <i>Lecture Notes in Artificial Intelligence</i>, pages 215–230,  2013. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-38574-2_15\"\n     onclick=\"log_download('gange-sndergaard-stuckey-schachte-solvingdifferenceconstraintsovermodulararithmetic-2013', 'http://doi.org/10.1007/978-3-642-38574-2_15', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gange-sndergaard-stuckey-schachte-solvingdifferenceconstraintsovermodulararithmetic-2013\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gange-sndergaard-stuckey-schachte-solvingdifferenceconstraintsovermodulararithmetic-2013')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gan-Son-Stu-Sch_CADE13,\n  author    = {Graeme Gange and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey and \n\t\tPeter Schachte},\n  title     = {Solving Difference Constraints over Modular Arithmetic},\n  editor    = {M. P. Bonacina},\n  booktitle = {CADE 2013: Proceedings of the 24th International\n\t\tConference on Automated Deduction},\n  series    = {Lecture Notes in Artificial Intelligence},\n  volume    = {7898},\n  pages     = {215--230},\n  publisher = {Springer},\n  year      = {2013},\n  doi       = {10.1007/978-3-642-38574-2_15},\n  abstract  = {Difference logic is commonly used in program verification \n\t\tand analysis. In the context of fixed-precision integers,\n\t\tas used in assembly languages for example, the use of \n\t\tclassical difference logic is unsound. We study the problem\n\t\tof deciding difference constraints in the context of modular\n\t\tarithmetic and show that it is strongly NP-complete. We \n\t\tdiscuss the applicability of the Bellman-Ford algorithm and \n\t\trelated shortest-distance algorithms to the context of modular\n\t\tarithmetic. We explore two approaches, namely a complete \n\t\tmethod implemented using SMT technology and an incomplete \n\t\tfixpoint-based method, and the two are experimentally \n\t\tevaluated. The incomplete method performs considerably \n\t\tfaster while maintaining acceptable accuracy on a range\n\t\tof instances.},\n  keywords  = {Constraint solving, Program verification, Static analysis, Machine arithmetic, Fixed points},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Difference logic is commonly used in program verification and analysis. In the context of fixed-precision integers, as used in assembly languages for example, the use of classical difference logic is unsound. We study the problem of deciding difference constraints in the context of modular arithmetic and show that it is strongly NP-complete. We discuss the applicability of the Bellman-Ford algorithm and related shortest-distance algorithms to the context of modular arithmetic. We explore two approaches, namely a complete method implemented using SMT technology and an incomplete fixpoint-based method, and the two are experimentally evaluated. The incomplete method performs considerably faster while maintaining acceptable accuracy on a range of instances.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2012\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2012')\"\n      onkeypress=\"toggleGroup('group_2012')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2012</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"davis-schachte-somogyi-sndergaard-towardsregionbasedmemorymanagementforgo-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Towards Region Based Memory Management for Go.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Davis, M.; Schachte, P.; Somogyi, Z.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2012 ACM Workshop on Memory Systems Performance and Correctness (MSPC 2012)</i>, pages 58–67,  2012. ACM Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/2247684.2247695\"\n     onclick=\"log_download('davis-schachte-somogyi-sndergaard-towardsregionbasedmemorymanagementforgo-2012', 'http://doi.org/10.1145/2247684.2247695', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/davis-schachte-somogyi-sndergaard-towardsregionbasedmemorymanagementforgo-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('davis-schachte-somogyi-sndergaard-towardsregionbasedmemorymanagementforgo-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Dav-Sch-Som-Son_MSPC12,\n  author    = {Matthew Davis and \n\t\tPeter Schachte and \n\t\tZoltan Somogyi and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Towards Region Based Memory Management for {Go}},\n  booktitle = {Proceedings of the 2012 ACM Workshop on Memory Systems \n\t\tPerformance and Correctness (MSPC 2012)},\n  pages     = {58--67},\n  publisher = {ACM Press},\n  year      = {2012},\n  doi       = {10.1145/2247684.2247695},\n  abstract  = {Region-based memory management aims to lower the cost of \n\t\tdeallocation through bulk processing: instead of \n\t\trecovering the memory of each object separately, it\n\t\trecovers the memory of a region containing many objects.\n\t\tIt relies on static analysis to determinethe set of \n\t\tmemory regions needed by a program, the program points at\n\t\twhich each region should be created and removed, and, for\n\t\teach memory allocation, the region that should supply the\n\t\tmemory.  The concurrent language Go has features that pose\n\t\tinteresting challenges for this analysis.  We present a \n\t\tnovel design for region-based memory management for Go,\n\t\tcombining static analysis, to guide region creation, and\n\t\tlightweight runtime bookkeeping, to help control \n\t\treclamation.  The main advantage of our approach is that\n\t\tit greatly limits the amount of re-work that must be done\n\t\tafter eachchange to the program source code, making our\n\t\tapproach more practical than existing RBMM systems.  Our\n\t\tprototype implementation covers most of the sequential\n\t\tfragment of Go, and preliminary results are encouraging.},\n  keywords  = {Memory management, Go},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Region-based memory management aims to lower the cost of deallocation through bulk processing: instead of recovering the memory of each object separately, it recovers the memory of a region containing many objects. It relies on static analysis to determinethe set of memory regions needed by a program, the program points at which each region should be created and removed, and, for each memory allocation, the region that should supply the memory. The concurrent language Go has features that pose interesting challenges for this analysis. We present a novel design for region-based memory management for Go, combining static analysis, to guide region creation, and lightweight runtime bookkeeping, to help control reclamation. The main advantage of our approach is that it greatly limits the amount of re-work that must be done after eachchange to the program source code, making our approach more practical than existing RBMM systems. Our prototype implementation covers most of the sequential fragment of Go, and preliminary results are encouraging.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://crpit.com/Vol128.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012', 'http://crpit.com/Vol128.html', event);\">\n    Logic Programming: From Underspecification to Undefinedness.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Naish, L.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Horsfall, B.\n</span>\n\n  \n\n</span>\n\n  In Mestre, J., editor(s), <i>Theory of Computing 2012</i>, volume 128, of <i>Conferences in Research and Practice in Information Technology</i>, pages 49–58,  2012. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://crpit.com/Vol128.html\"\n     onclick=\"log_download('naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012', 'http://crpit.com/Vol128.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Logic Programming: From Underspecification to Undefinedness [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('naish-sndergaard-horsfall-logicprogrammingfromunderspecificationtoundefinedness-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Nai-Son-Hor_CATS12,\n  author    = {Lee Naish and \n\t\tHarald S{\\o}ndergaard and \n\t\tBenjamin Horsfall},\n  title     = {Logic Programming: From Underspecification to Undefinedness},\n  editor    = {J. Mestre},\n  booktitle = {Theory of Computing 2012},\n  series    = {Conferences in Research and Practice in Information Technology},\n  volume    = {128},\n  pages     = {49--58},\n  year      = {2012},\n  url       = {http://crpit.com/Vol128.html},\n  abstract  = {The semantics of logic programs was originally described in \n\t\tterms of two-valued logic. Soon, however, it was realised that \n\t\tthree-valued logic had some natural advantages, as it provides \n\t\tdistinct values not only for truth and falsehood, but also for\n\t\t&quot;undefined&quot;. The three-valued semantics proposed by Fitting and\n\t\tby Kunen are closely related to what is computed by a logic \n\t\tprogram, the third truth value being associated with \n\t\tnon-termination. A different three-valued semantics, proposed \n\t\tby Naish, shared much with those of Fitting and Kunen but \n\t\tincorporated allowances for programmer intent, the third truth \n\t\tvalue being associated with underspecification. Naish used an \n\t\t(apparently) novel &#x60;&#x60;arrow&#x27;&#x27; operator to relate the intended \n\t\tmeaning of left and right sides of predicate definitions. In \n\t\tthis paper we suggest that the additional truth values of\n\t\tFitting/Kunen and Naish are best viewed as duals. We use \n\t\tFitting&#x27;s later four-valued approach to unify the two \n\t\tthree-valued approaches. The additional truth value has very \n\t\tlittle affect on the Fitting three-valued semantics, though it\n\t\tcan be useful when finding approximations to this semantics for\n\t\tprogram analysis. For the Naish semantics, the extra truth \n\t\tvalue allows intended interpretations to be more expressive, \n\t\tallowing us to verify and debug a larger class of programs. \n\t\tWe also explain that the &quot;arrow&quot; operator of Naish (and our \n\t\tfour-valued extension) is essentially the information ordering.\n\t\tThis sheds new light on the relationships between \n\t\tspecifications and programs, and successive executions states \n\t\tof a program.},\n  keywords  = {Logic programming, Semantics, Many-valued logic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The semantics of logic programs was originally described in terms of two-valued logic. Soon, however, it was realised that three-valued logic had some natural advantages, as it provides distinct values not only for truth and falsehood, but also for \"undefined\". The three-valued semantics proposed by Fitting and by Kunen are closely related to what is computed by a logic program, the third truth value being associated with non-termination. A different three-valued semantics, proposed by Naish, shared much with those of Fitting and Kunen but incorporated allowances for programmer intent, the third truth value being associated with underspecification. Naish used an (apparently) novel ``arrow'' operator to relate the intended meaning of left and right sides of predicate definitions. In this paper we suggest that the additional truth values of Fitting/Kunen and Naish are best viewed as duals. We use Fitting's later four-valued approach to unify the two three-valued approaches. The additional truth value has very little affect on the Fitting three-valued semantics, though it can be useful when finding approximations to this semantics for program analysis. For the Naish semantics, the extra truth value allows intended interpretations to be more expressive, allowing us to verify and debug a larger class of programs. We also explain that the \"arrow\" operator of Naish (and our four-valued extension) is essentially the information ordering. This sheds new light on the relationships between specifications and programs, and successive executions states of a program.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"navas-schachte-sndergaard-stuckey-signednessagnosticprogramanalysispreciseintegerboundsforlowlevelcode-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Navas, J. A.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Jhala, R.;  and Igarashi, A., editor(s), <i>APLAS 2012: Proceedings of the 10th Asian Symposium on Programming Languages and Systems</i>, volume 7705, of <i>Lecture Notes in Computer Science</i>, pages 115–130,  2012. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-35182-2_9\"\n     onclick=\"log_download('navas-schachte-sndergaard-stuckey-signednessagnosticprogramanalysispreciseintegerboundsforlowlevelcode-2012', 'http://doi.org/10.1007/978-3-642-35182-2_9', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/navas-schachte-sndergaard-stuckey-signednessagnosticprogramanalysispreciseintegerboundsforlowlevelcode-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('navas-schachte-sndergaard-stuckey-signednessagnosticprogramanalysispreciseintegerboundsforlowlevelcode-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Nav-Sch-Son-Stu_APLAS12,\n  author    = {Jorge A. Navas and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and\n\t\tPeter J. Stuckey},\n  title     = {Signedness-Agnostic Program Analysis: \n\t\tPrecise Integer Bounds for Low-Level Code},\n  editor    = {R. Jhala and A. Igarashi},\n  booktitle = {APLAS 2012: Proceedings of the 10th Asian Symposium \n        \ton Programming Languages and Systems},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {7705},\n  pages     = {115--130},\n  publisher = {Springer},\n  year      = {2012},\n  doi       = {10.1007/978-3-642-35182-2_9},\n  abstract  = {Many compilers target common back-ends, thereby \n\t\tavoiding the need to implement the same analyses \n\t\tfor many different source languages. This has led\n\t\tto interest in static analysis of LLVM code. \n\t\tIn LLVM (and similar languages) most signedness \n\t\tinformation associated with variables has been \n\t\tcompiled away. Current analyses of LLVM code tend\n\t\tto assume that either all values are signed or all\n\t\tare unsigned (except where the code specifies the \n\t\tsignedness). We show how program analysis can \n\t\tsimultaneously consider each bit-string to be both \n\t\tsigned and unsigned, thus improving precision, \n\t\tand we implement the idea for the specific case of \n\t\tinteger bounds analysis. Experimental evaluation\n\t\tshows that this provides higher precision at little\n\t\textra cost. Our approach turns out to be beneficial\n\t\teven when all signedness information is available,\n\t\tsuch as when analysing C or Java code.},\n  keywords  = {Abstract domains, Abstract interpretation, Interval analysis, Machine arithmetic, C analysis, LLVM},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many compilers target common back-ends, thereby avoiding the need to implement the same analyses for many different source languages. This has led to interest in static analysis of LLVM code. In LLVM (and similar languages) most signedness information associated with variables has been compiled away. Current analyses of LLVM code tend to assume that either all values are signed or all are unsigned (except where the code specifies the signedness). We show how program analysis can simultaneously consider each bit-string to be both signed and unsigned, thus improving precision, and we implement the idea for the specific case of integer bounds analysis. Experimental evaluation shows that this provides higher precision at little extra cost. Our approach turns out to be beneficial even when all signedness information is available, such as when analysing C or Java code.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-mulder-collaborativelearningthroughformativepeerreviewpedagogyprogramsandpotential-2012\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Collaborative Learning through Formative Peer Review: Pedagogy, Programs and Potential.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Mulder, R.\n</span>\n\n  \n\n</span>\n\n  <i>Computer Science Education</i>, 22(4): 343–367.  2012.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1080/08993408.2012.728041\"\n     onclick=\"log_download('sndergaard-mulder-collaborativelearningthroughformativepeerreviewpedagogyprogramsandpotential-2012', 'http://doi.org/10.1080/08993408.2012.728041', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-mulder-collaborativelearningthroughformativepeerreviewpedagogyprogramsandpotential-2012\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-mulder-collaborativelearningthroughformativepeerreviewpedagogyprogramsandpotential-2012')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Son-Mul_CSE12,\n  author    = {Harald S{\\o}ndergaard and \n\t\tRaoul Mulder},\n  title     = {Collaborative Learning through Formative Peer Review:\n\t\tPedagogy, Programs and Potential},\n  journal   = {Computer Science Education},\n  volume    = {22},\n  number    = {4},\n  pages     = {343--367},\n  year      = {2012},\n  doi       = {10.1080/08993408.2012.728041},\n  abstract  = {We examine student peer review, with an emphasis on \n\t\tformative practice and collaborative learning, rather \n\t\tthan peer grading. Opportunities to engage students in \n\t\tsuch formative peer assessment are growing, as a range \n\t\tof online tools become available to manage and simplify \n\t\tthe process of administering student peer review. \n\t\tWe consider whether pedagogical requirements for student\n\t\tpeer review are likely to be discipline-specific, taking\n\t\tcomputer science and software engineering as an example.\n\t\tWe then summarise what attributes are important for a \n\t\tmodern generic peer review tool, and classify tools \n\t\taccording to four prevalent emphases, using currently \n\t\tavailable, mature tools to illustrate each. We conclude \n\t\tby identifying some gaps in current understanding of \n\t\tformative peer review, and discuss how online tools for \n\t\tstudent peer review can help create opportunities to \n\t\tanswer some of these questions.},\n  keywords  = {Education, Peer review},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We examine student peer review, with an emphasis on formative practice and collaborative learning, rather than peer grading. Opportunities to engage students in such formative peer assessment are growing, as a range of online tools become available to manage and simplify the process of administering student peer review. We consider whether pedagogical requirements for student peer review are likely to be discipline-specific, taking computer science and software engineering as an example. We then summarise what attributes are important for a modern generic peer review tool, and classify tools according to four prevalent emphases, using currently available, mature tools to illustrate each. We conclude by identifying some gaps in current understanding of formative peer review, and discuss how online tools for student peer review can help create opportunities to answer some of these questions.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2010\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2010')\"\n      onkeypress=\"toggleGroup('group_2010')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2010</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"henshall-schachte-sndergaard-whiting-analgorithmforaffineapproximationofbinarydecisiondiagrams-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Algorithm for Affine Approximation of Binary Decision Diagrams.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Henshall, K.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Whiting, L.\n</span>\n\n  \n\n</span>\n\n  <i>Chicago Journal of Theoretical Computer Science</i>, 2010(11). June 2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.4086/cjtcs.2010.011\"\n     onclick=\"log_download('henshall-schachte-sndergaard-whiting-analgorithmforaffineapproximationofbinarydecisiondiagrams-2010', 'http://doi.org/10.4086/cjtcs.2010.011', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/henshall-schachte-sndergaard-whiting-analgorithmforaffineapproximationofbinarydecisiondiagrams-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('henshall-schachte-sndergaard-whiting-analgorithmforaffineapproximationofbinarydecisiondiagrams-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Hen-Sch-Son-Whi_CJTCS10,\n  author    = {Kevin Henshall and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and\n\t\tLeigh Whiting},\n  title     = {An Algorithm for Affine Approximation of Binary Decision \n\t\tDiagrams},\n  journal   = {Chicago Journal of Theoretical Computer Science},\n  volume    = {2010},\n  number    = {11},\n  publisher = {University of Chicago},\n  month     = {June},\n  year      = {2010},\n  doi       = {10.4086/cjtcs.2010.011},\n  abstract  = {This paper is concerned with the problem of Boolean approximation\n\t\tin the following sense: given a Boolean function class and an\n\t\tarbitrary Boolean function, what is the function&#x27;s best proxy in\n\t\tthe class? Specifically, what is its strongest logical \n\t\tconsequence (or \\emph{envelope}) in the class of \\emph{affine} \n\t\tBoolean functions. We prove various properties of affine Boolean\n\t\tfunctions and their representation as ROBDDs. Using these \n\t\tproperties, we develop an ROBDD algorithm to find the affine \n\t\tenvelope of a Boolean function.},\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper is concerned with the problem of Boolean approximation in the following sense: given a Boolean function class and an arbitrary Boolean function, what is the function's best proxy in the class? Specifically, what is its strongest logical consequence (or \\emphenvelope) in the class of \\emphaffine Boolean functions. We prove various properties of affine Boolean functions and their representation as ROBDDs. Using these properties, we develop an ROBDD algorithm to find the affine envelope of a Boolean function.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"king-sndergaard-automaticabstractionforcongruences-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Automatic Abstraction for Congruences.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  King, A.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Barthe, G.;  and Hermenegildo, M., editor(s), <i>Verification, Model Checking and Abstract Interpretation</i>, volume 5944, of <i>Lecture Notes in Computer Science</i>, pages 197–213,  2010. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-11319-2_16\"\n     onclick=\"log_download('king-sndergaard-automaticabstractionforcongruences-2010', 'http://doi.org/10.1007/978-3-642-11319-2_16', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/king-sndergaard-automaticabstractionforcongruences-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('king-sndergaard-automaticabstractionforcongruences-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Kin-Son_VMCAI10,\n  author    = {Andy King and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Automatic Abstraction for Congruences},\n  editor    = {G. Barthe and M. Hermenegildo},\n  booktitle = {Verification, Model Checking and Abstract Interpretation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5944},\n  pages     = {197--213},\n  publisher = {Springer},\n  year      = {2010},\n  doi       = {10.1007/978-3-642-11319-2_16},\n  abstract  = {One approach to verifying bit-twiddling algorithms is to derive \n\t\tinvariants between the bits that constitute the variables of a \n\t\tprogram. Such invariants can often be described with systems\n\t\tof congruences where in each equation \n\t\t$\\vec{c} \\cdot \\vec{x} = d \\mod m$, $m$ is a power of two, \n\t\t$\\vec{c}$ is a vector of integer coefficients, and $\\vec{x}$ is\n\t\ta vector of propositional variables (bits). Because of the \n\t\tlow-level nature of these invariants and the large number of\n\t\tbits that are involved, it is important that the transfer \n\t\tfunctions can be derived automatically. We address this problem,\n\t\tshowing how an analysis for bit-level congruence relationships \n\t\tcan be decoupled into two parts:\n\t\t(1) a SAT-based abstraction (compilation) step which can be \n\t\tautomated, and\n\t\t(2) an interpretation step that requires no SAT-solving.\n\t\tWe exploit triangular matrix forms to derive transfer functions\n\t\tefficiently, even in the presence of large numbers of bits. \n\t\tFinally we propose program transformations that improve the \n\t\tanalysis results.},\n  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation $ěc{c} · ěc{x} = d \\mod m$, $m$ is a power of two, $ěc{c}$ is a vector of integer coefficients, and $ěc{x}$ is a vector of propositional variables (bits). Because of the low-level nature of these invariants and the large number of bits that are involved, it is important that the transfer functions can be derived automatically. We address this problem, showing how an analysis for bit-level congruence relationships can be decoupled into two parts: (1) a SAT-based abstraction (compilation) step which can be automated, and (2) an interpretation step that requires no SAT-solving. We exploit triangular matrix forms to derive transfer functions efficiently, even in the presence of large numbers of bits. Finally we propose program transformations that improve the analysis results.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"schachte-sndergaard-whiting-henshall-informationlossinknowledgecompilationacomparisonofbooleanenvelopes-2010\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Information Loss in Knowledge Compilation: A Comparison of Boolean Envelopes.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Whiting, L.;  and Henshall, K.\n</span>\n\n  \n\n</span>\n\n  <i>Artificial Intelligence</i>, 174(9–10): 585–596.  2010.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1016/j.artint.2010.03.003\"\n     onclick=\"log_download('schachte-sndergaard-whiting-henshall-informationlossinknowledgecompilationacomparisonofbooleanenvelopes-2010', 'http://doi.org/10.1016/j.artint.2010.03.003', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/schachte-sndergaard-whiting-henshall-informationlossinknowledgecompilationacomparisonofbooleanenvelopes-2010\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('schachte-sndergaard-whiting-henshall-informationlossinknowledgecompilationacomparisonofbooleanenvelopes-2010')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Sch-Son-Whi-Hen_AIJ10,\n  author    = {Peter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tLeigh Whiting and\n\t\tKevin Henshall},\n  title     = {Information Loss in Knowledge Compilation: \n\t\tA Comparison of {Boolean} Envelopes},\n  journal   = {Artificial Intelligence},\n  volume    = {174},\n  number    = {9--10},\n  pages     = {585--596},\n  year      = {2010},\n  doi       = {10.1016/j.artint.2010.03.003},\n  abstract  = {Since Selman and Kautz&#x27;s seminal work on the use of Horn \n\t\tapproximation to speed up the querying of knowledge bases, \n\t\tthere has been great interest in Boolean approximation for \n\t\tAI applications. There are several Boolean classes with \n\t\tdesirable computational properties similar to those of the\n\t\tHorn class. The class of affine Boolean functions, for example,\n\t\thas been proposed as an interesting alternative to Horn for \n\t\tknowledge compilation. To investigate the trade-offs between\n\t\tprecision and efficiency in knowledge compilation, we compare, \n\t\tanalytically and empirically, four well-known Boolean classes,\n\t\tand their combinations, for ability to preserve information.\n\t\tWe note that traditional evaluation which explores unit-clause\n\t\tconsequences of random hard 3-CNF formulas does not tell the \n\t\tfull story, and we complement that evaluation with experiments \n\t\tbased on a variety of assumptions about queries and the \n\t\tunderlying knowledge base.},\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, Artificial intelligence},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Since Selman and Kautz's seminal work on the use of Horn approximation to speed up the querying of knowledge bases, there has been great interest in Boolean approximation for AI applications. There are several Boolean classes with desirable computational properties similar to those of the Horn class. The class of affine Boolean functions, for example, has been proposed as an interesting alternative to Horn for knowledge compilation. To investigate the trade-offs between precision and efficiency in knowledge compilation, we compare, analytically and empirically, four well-known Boolean classes, and their combinations, for ability to preserve information. We note that traditional evaluation which explores unit-clause consequences of random hard 3-CNF formulas does not tell the full story, and we complement that evaluation with experiments based on a variety of assumptions about queries and the underlying knowledge base.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2009\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2009')\"\n      onkeypress=\"toggleGroup('group_2009')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2009</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"chang-stern-sndergaard-hadgraft-placesforlearningengineeringapreliminaryreportoninformallearningspaces-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Places for Learning Engineering: A Preliminary Report on Informal Learning Spaces.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Chang, R.; Stern, L.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Hadgraft, R.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2009 Research in Engineering Education Symposium</i>,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/chang-stern-sndergaard-hadgraft-placesforlearningengineeringapreliminaryreportoninformallearningspaces-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('chang-stern-sndergaard-hadgraft-placesforlearningengineeringapreliminaryreportoninformallearningspaces-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Cha-Ste-Son-Had_REES09,\n  author    = {Rosemary Chang and\n\t\tLinda Stern and\n\t\tHarald S{\\o}ndergaard and\n\t\tRoger Hadgraft},\n  title     = {Places for Learning Engineering: \n\t\tA Preliminary Report on Informal Learning Spaces},\n  booktitle = {Proceedings of the 2009 Research in Engineering Education \n\t\tSymposium},\n  location  = {Palm Cove, Queensland},\n  year      = {2009},\n  keywords  = {Education},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"hansen-schachte-sndergaard-statejoiningandsplittingforthesymbolicexecutionofbinaries-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  State Joining and Splitting for the Symbolic Execution of Binaries.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Hansen, T.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Bensalem, S.;  and Peled, D. A., editor(s), <i>Runtime Verification</i>, volume 5779, of <i>Lecture Notes in Computer Science</i>, pages 76–92,  2009. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-642-04694-0_6\"\n     onclick=\"log_download('hansen-schachte-sndergaard-statejoiningandsplittingforthesymbolicexecutionofbinaries-2009', 'http://doi.org/10.1007/978-3-642-04694-0_6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/hansen-schachte-sndergaard-statejoiningandsplittingforthesymbolicexecutionofbinaries-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('hansen-schachte-sndergaard-statejoiningandsplittingforthesymbolicexecutionofbinaries-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Han-Sch-Son_RV09,\n  author    = {Trevor Hansen and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {State Joining and Splitting for the Symbolic Execution \n\t\tof Binaries},\n  editor    = {S. Bensalem and D. A. Peled},\n  booktitle = {Runtime Verification},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5779},\n  pages     = {76--92},\n  publisher = {Springer},\n  year      = {2009},\n  doi       = {10.1007/978-3-642-04694-0_6},\n  abstract  = {Symbolic execution can be used to explore the possible run-time \n\t\tstates of a program. It makes use of a concept of &#x60;&#x60;state&#x27;&#x27; \n\t\twhere a variable&#x27;s value has been replaced by an expression \n\t\tthat gives the value as a function of program input. \n\t\tAdditionally, a state can be equipped with a summary of \n\t\tcontrol-flow history: a &#x60;&#x60;path constraint&#x27;&#x27; keeps track of the\n\t\tclass of inputs that would have caused the same flow of control.\n\t\tBut even simple programs can have trillions of paths, so a \n\t\tpath-by-path analysis is impractical. We investigate a \n\t\t&#x60;&#x60;state joining&#x27;&#x27; approach to making symbolic execution more \n\t\tpractical and describe the challenges of applying state joining\n\t\tto the analysis of unmodified Linux x86 executables. The results\n\t\tso far are mixed, with good results for some code. On other\n\t\texamples, state joining produces cumbersome constraints that \n\t\tare more expensive to solve than those generated by normal \n\t\tsymbolic execution.},\n  keywords  = {Symbolic execution},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Symbolic execution can be used to explore the possible run-time states of a program. It makes use of a concept of ``state'' where a variable's value has been replaced by an expression that gives the value as a function of program input. Additionally, a state can be equipped with a summary of control-flow history: a ``path constraint'' keeps track of the class of inputs that would have caused the same flow of control. But even simple programs can have trillions of paths, so a path-by-path analysis is impractical. We investigate a ``state joining'' approach to making symbolic execution more practical and describe the challenges of applying state joining to the analysis of unmodified Linux x86 executables. The results so far are mixed, with good results for some code. On other examples, state joining produces cumbersome constraints that are more expensive to solve than those generated by normal symbolic execution.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://crpit.com/Vol94.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009', 'http://crpit.com/Vol94.html', event);\">\n    Boolean Affine Approximation with Binary Decision Diagrams.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Henshall, K.; Schachte, P.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Whiting, L.\n</span>\n\n  \n\n</span>\n\n  In Downey, R.;  and Manyem, P., editor(s), <i>Theory of Computing 2009</i>, volume 94, of <i>Conferences in Research and Practice in Information Technology</i>, pages 121–129,  2009. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://crpit.com/Vol94.html\"\n     onclick=\"log_download('henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009', 'http://crpit.com/Vol94.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Boolean Affine Approximation with Binary Decision Diagrams [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('henshall-schachte-sndergaard-whiting-booleanaffineapproximationwithbinarydecisiondiagrams-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Hen-Sch-Son-Whi_CATS09,\n  author    = {Kevin Henshall and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard and \n\t\tLeigh Whiting},\n  title     = {Boolean Affine Approximation with Binary Decision Diagrams},\n  editor    = {R. Downey and P. Manyem},\n  booktitle = {Theory of Computing 2009},\n  series    = {Conferences in Research and Practice in Information Technology},\n  volume    = {94},\n  pages     = {121--129},\n  year      = {2009},\n  url       = {http://crpit.com/Vol94.html},\n  abstract  ={Selman and Kautz&#x27;s work on knowledge compilation has\n\t\testablished how approximation (strengthening and/or\n\t\tweakening) of a propositional knowledge-base can be used to\n\t\tspeed up query processing, at the expense of completeness.\n\t\tIn the classical approach, the knowledge-base is assumed\n\t\tto be presented as a propositional formula in conjunctive\n\t\tnormal form (CNF), and Horn functions are used to over-\n\t\tand under-approximate it (in the hope that many queries\n\t\tcan be answered efficiently using the approximations only).\n\t\tHowever, other representations are possible, and functions\n\t\tother than Horn can be used for approximations, as long\n\t\tas they have deduction-computational properties similar to\n\t\tthose of the Horn functions. Zanuttini has suggested that\n\t\tthe class of affine Boolean functions would be especially\n\t\tuseful in knowledge compilation and has presented various\n\t\taffine approximation algorithms. Since CNF is awkward\n\t\tfor presenting affine functions, Zanuttini considers both\n\t\ta sets-of-models representation and the use of modulo 2\n\t\tcongruence equations. Here we consider the use of reduced\n\t\tordered binary decision diagrams (ROBDDs), a representation\n\t\twhich is more compact than the sets of models and which\n\t\t(unlike modulo 2 congruences) can express any source\n\t\tknowledge-base. We present an ROBDD algorithm to find\n\t\tstrongest affine upper-approximations of a Boolean function\n\t\tand we argue its correctness.},\n  keywords  = {Boolean logic, Boolean approximation, Knowledge compilation, ROBDDs},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Selman and Kautz's work on knowledge compilation has established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In the classical approach, the knowledge-base is assumed to be presented as a propositional formula in conjunctive normal form (CNF), and Horn functions are used to over- and under-approximate it (in the hope that many queries can be answered efficiently using the approximations only). However, other representations are possible, and functions other than Horn can be used for approximations, as long as they have deduction-computational properties similar to those of the Horn functions. Zanuttini has suggested that the class of affine Boolean functions would be especially useful in knowledge compilation and has presented various affine approximation algorithms. Since CNF is awkward for presenting affine functions, Zanuttini considers both a sets-of-models representation and the use of modulo 2 congruence equations. Here we consider the use of reduced ordered binary decision diagrams (ROBDDs), a representation which is more compact than the sets of models and which (unlike modulo 2 congruences) can express any source knowledge-base. We present an ROBDD algorithm to find strongest affine upper-approximations of a Boolean function and we argue its correctness.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-learningfromandwithpeersthedifferentrolesofstudentpeerreviewing-2009\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Learning From and With Peers: The Different Roles of Student Peer Reviewing.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 14th Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education</i>, pages 31–35, New York, NY,  2009. Association for Computing Machinery\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/3263191\"\n     onclick=\"log_download('sndergaard-learningfromandwithpeersthedifferentrolesofstudentpeerreviewing-2009', 'http://doi.org/10.1145/3263191', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-learningfromandwithpeersthedifferentrolesofstudentpeerreviewing-2009\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-learningfromandwithpeersthedifferentrolesofstudentpeerreviewing-2009')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Son_ITiCSE09,\n  author    = {Harald S{\\o}ndergaard},\n  title     = {Learning From and With Peers:\n\t\tThe Different Roles of Student Peer Reviewing},\n  booktitle = {Proceedings of the 14th Annual SIGCSE/SIGCUE Conference on\n\t\tInnovation and Technology in Computer Science Education},\n  pages     = {31--35},\n  publisher = {Association for Computing Machinery},\n  address   = {New York, NY},\n  year      = {2009},\n  location  = {Paris, France},\n  doi       = {10.1145/3263191},\n  abstract  = {There are many different approaches to student peer assessment.\n\t\tIn this paper I lay out the pedagogical philosophy behind my \n\t\town use of student peer reviews. These should not only be \n\t\tseen as adding to the amount of formative feedback in a class,\n\t\tnor are they only about the development of certain higher-order\n\t\tcognitive skills. Properly aligned with an overall assessment\n\t\tstrategy, peer reviewing can help build a stronger learning \n\t\tcommunity. I describe such a strategy and my experience using\n\t\tPRAZE, an online tool for student peer reviewing, as well as \n\t\tstudents&#x27; response to the tool and its use.},\n  keywords  = {Education, Peer review},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  There are many different approaches to student peer assessment. In this paper I lay out the pedagogical philosophy behind my own use of student peer reviews. These should not only be seen as adding to the amount of formative feedback in a class, nor are they only about the development of certain higher-order cognitive skills. Properly aligned with an overall assessment strategy, peer reviewing can help build a stronger learning community. I describe such a strategy and my experience using PRAZE, an online tool for student peer reviewing, as well as students' response to the tool and its use.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2008\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2008')\"\n      onkeypress=\"toggleGroup('group_2008')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2008</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"king-sndergaard-inferringcongruenceequationswithsat-2008\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Inferring Congruence Equations with SAT.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  King, A.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Gupta, A.;  and Malik, S., editor(s), <i>Computer Aided Verification</i>, volume 5123, of <i>Lecture Notes in Computer Science</i>, pages 281–293,  2008. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-540-70545-1_26\"\n     onclick=\"log_download('king-sndergaard-inferringcongruenceequationswithsat-2008', 'http://doi.org/10.1007/978-3-540-70545-1_26', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/king-sndergaard-inferringcongruenceequationswithsat-2008\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('king-sndergaard-inferringcongruenceequationswithsat-2008')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Kin-Son_CAV08,\n  author    = {Andy King and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Inferring Congruence Equations with {SAT}},\n  editor    = {A. Gupta and S. Malik},\n  booktitle = {Computer Aided Verification},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {5123},\n  pages     = {281--293},\n  publisher = {Springer},\n  year      = {2008},\n  doi       = {10.1007/978-3-540-70545-1_26},\n  abstract  = {This paper proposes a new approach for deriving invariants \n\t\tthat are systems of congruence equations where the modulo\n\t\tis a power of 2. The technique is an amalgam of SAT-solving,\n\t\twhere a propositional formula is used to encode the semantics \n\t\tof a basic block, and abstraction, where the solutions to the\n\t\tformula are systematically combined and summarised as a system\n\t\tof congruence equations. The resulting technique is more\n\t\tprecise than existing congruence analyses since a single optimal\n\t\ttransfer function is derived for a basic block as a whole.},\n  keywords  = {Congruence analysis, Abstract interpretation, Abstract domains, Boolean logic},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper proposes a new approach for deriving invariants that are systems of congruence equations where the modulo is a power of 2. The technique is an amalgam of SAT-solving, where a propositional formula is used to encode the semantics of a basic block, and abstraction, where the solutions to the formula are systematically combined and summarised as a system of congruence equations. The resulting technique is more precise than existing congruence analyses since a single optimal transfer function is derived for a basic block as a whole.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2007\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2007')\"\n      onkeypress=\"toggleGroup('group_2007')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2007</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"herlihy-schachte-sndergaard-unkleenebooleanequationsolving-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Un-Kleene Boolean Equation Solving.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Herlihy, B.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>International Journal on Foundations of Computer Science</i>, 18(2): 227–250.  2007.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1142/S0129054107004668\"\n     onclick=\"log_download('herlihy-schachte-sndergaard-unkleenebooleanequationsolving-2007', 'http://doi.org/10.1142/S0129054107004668', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/herlihy-schachte-sndergaard-unkleenebooleanequationsolving-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('herlihy-schachte-sndergaard-unkleenebooleanequationsolving-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Her-Sch-Son_IJFCS07,\n  author    = {Brian Herlihy and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Un-{Kleene} {Boolean} Equation Solving},\n  journal   = {International Journal on Foundations of Computer Science},\n  volume    = {18},\n  number    = {2},\n  pages     = {227--250},\n  year      = {2007},\n  doi       = {10.1142/S0129054107004668},\n  abstract  = {We present a new method for finding closed forms of recursive \n\t\tBoolean function definitions. Traditionally, these closed forms\n\t\tare found by Kleene iteration: iterative approximation until a \n\t\tfixed point is reached. Conceptually, our new method replaces \n\t\teach $k$-ary function by $2^k$ Boolean constants defined by \n\t\tmutual recursion. The introduction of an exponential number of\n\t\tconstants is mitigated by the simplicity of their definitions \n\t\tand by the use of a novel variant of ROBDDs to avoid repeated \n\t\tcomputation. Experiments suggest that this approach is \n\t\tsignificantly faster than Kleene iteration for examples that \n\t\trequire many Kleene iteration steps.},\n  keywords  = {Fixed points, ROBDDs},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by Kleene iteration: iterative approximation until a fixed point is reached. Conceptually, our new method replaces each $k$-ary function by $2^k$ Boolean constants defined by mutual recursion. The introduction of an exponential number of constants is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experiments suggest that this approach is significantly faster than Kleene iteration for examples that require many Kleene iteration steps.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"schachte-sndergaard-booleanapproximationrevisited-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Boolean Approximation Revisited.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Miguel, I.;  and Ruml, W., editor(s), <i>Abstraction, Reformulation and Approximation: Proceedings of SARA 2007</i>, volume 4612, of <i>Lecture Notes in Artificial Intelligence</i>, pages 329–343,  2007. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/978-3-540-73580-9_26\"\n     onclick=\"log_download('schachte-sndergaard-booleanapproximationrevisited-2007', 'http://doi.org/10.1007/978-3-540-73580-9_26', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/schachte-sndergaard-booleanapproximationrevisited-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('schachte-sndergaard-booleanapproximationrevisited-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Sch-Son_SARA07,\n  author    = {Peter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Boolean Approximation Revisited},\n  editor    = {I. Miguel and W. Ruml},\n  booktitle = {Abstraction, Reformulation and Approximation:\n         \tProceedings of {SARA} 2007},\n  series    = {Lecture Notes in Artificial Intelligence},\n  volume    = {4612},\n  pages     = {329--343},\n  publisher = {Springer},\n  year      = {2007},\n  doi       = {10.1007/978-3-540-73580-9_26},\n  abstract  = {Most work to date on Boolean approximation assumes that\n\t\tBoolean functions are represented by formulas in\n\t\tconjunctive normal form. That assumption is appropriate \n\t\tfor the classical applications of Boolean approximation \n\t\tbut potentially limits wider use. We revisit, in a \n\t\tlattice-theoretic setting, so-called envelopes and cores\n\t\tin propositional logic, identifying them with upper and\n\t\tlower closure operators, respectively. This leads to \n\t\trecursive representation-independent characterisations\n\t\tof Boolean approximation for a large class of classes.\n\t\tWe show that Boolean development can be applied in a \n\t\trepresentation-independent setting to develop approximation\n\t\talgorithms for a broad range of Boolean classes, including\n\t\tHorn and Krom functions.},\n  keywords  = {Boolean logic, Boolean approximation, Lattice theory},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Most work to date on Boolean approximation assumes that Boolean functions are represented by formulas in conjunctive normal form. That assumption is appropriate for the classical applications of Boolean approximation but potentially limits wider use. We revisit, in a lattice-theoretic setting, so-called envelopes and cores in propositional logic, identifying them with upper and lower closure operators, respectively. This leads to recursive representation-independent characterisations of Boolean approximation for a large class of classes. We show that Boolean development can be applied in a representation-independent setting to develop approximation algorithms for a broad range of Boolean classes, including Horn and Krom functions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-hadgraft-proceedingsofthe18thconferenceoftheaustralasianassociationforengineeringeducation-2007\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Proceedings of the 18th Conference of the Australasian Association for Engineering Education.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Hadgraft, R.,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n  Department of Computer Science and Software Engineering, The University of Melbourne, Vic 3010, Australia. December 2007.\n  <span class=\"note\">Published on CD-ROM and online</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-hadgraft-proceedingsofthe18thconferenceoftheaustralasianassociationforengineeringeducation-2007\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-hadgraft-proceedingsofthe18thconferenceoftheaustralasianassociationforengineeringeducation-2007')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Proceedings{Son-Had_AAEE07,\n  editor    = {Harald S{\\o}ndergaard and \n\t\tRoger Hadgraft},\n  title     = {Proceedings of the 18th Conference of the \n\t\tAustralasian Association for Engineering Education},\n  publisher = {Department of Computer Science and Software Engineering,\n\t\tThe University of Melbourne, Vic 3010, Australia},\n  month     = {December},\n  year      = {2007},\n  isbn      = {978--0--9757172--1--9},\n  note      = {Published on CD-ROM and online},\n  keywords  = {Education},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2006\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2006')\"\n      onkeypress=\"toggleGroup('group_2006')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2006</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  <a href=\"http://crpit.com/Vol51.html\"\n     onclick=\"return trackOutboundLink('publications', 'click', 'herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006', 'http://crpit.com/Vol51.html', event);\">\n    Boolean Equation Solving as Graph Traversal.\n  </a>\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Herlihy, B.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Gudmundsson, J.;  and Jay, B., editor(s), <i>Theory of Computing 2006</i>, volume 51, of <i>Conferences in Research and Practice in Information Technology</i>, pages 123–132,  2006. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n  <a href=\"http://crpit.com/Vol51.html\"\n     onclick=\"log_download('herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006', 'http://crpit.com/Vol51.html', event.ctrlKey, event)\">\n    <img src=\"//bibbase.org/img/filetypes/link.svg\"\n\t     alt=\"Boolean Equation Solving as Graph Traversal [link]\"\n       title=\"Paper\"\n\t     class=\"bibbase_icon\"\n         ><span class=\"bibbase_icon_text\">Paper</span></a>\n  &nbsp;\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('herlihy-schachte-sndergaard-booleanequationsolvingasgraphtraversal-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Her-Sch-Son_CATS06,\n  author    = {Brian Herlihy and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Boolean Equation Solving as Graph Traversal},\n  editor    = {J. Gudmundsson and B. Jay},\n  booktitle = {Theory of Computing 2006},\n  series    = {Conferences in Research and Practice in Information Technology},\n  volume    = {51},\n  pages     = {123--132},\n  year      = {2006},\n  url       = {http://crpit.com/Vol51.html},\n  abstract  = {We present a new method for finding closed forms of recursive \n\t\tBoolean function definitions. Traditionally, these closed forms\n\t\tare found by iteratively approximating until a fixed point is \n\t\treached. Conceptually, our new method replaces each $k$-ary \n\t\tfunction by $2^k$ Boolean variables defined by mutual recursion.\n\t\tThe introduction of an exponential number of variables is \n\t\tmitigated by the simplicity of their definitions and by the use\n\t\tof a novel variant of ROBDDs to avoid repeated computation.\n\t\tExperimental evaluation suggests that this approach is \n\t\tsignificantly faster than Kleene iteration for examples that \n\t\twould require many Kleene iteration steps.},\n  keywords  = {Fixed points, ROBDDs},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed point is reached. Conceptually, our new method replaces each $k$-ary function by $2^k$ Boolean variables defined by mutual recursion. The introduction of an exponential number of variables is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experimental evaluation suggests that this approach is significantly faster than Kleene iteration for examples that would require many Kleene iteration steps.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"schachte-sndergaard-closureoperatorsforrobdds-2006\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Closure Operators for ROBDDs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Emerson, E. A.;  and Namjoshi, K. S., editor(s), <i>Proceedings of the Seventh International Conference on Verification, Model Checking and Abstract Interpretation</i>, volume 3855, of <i>Lecture Notes in Computer Science</i>, pages 1–16,  2006. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/11609773_1\"\n     onclick=\"log_download('schachte-sndergaard-closureoperatorsforrobdds-2006', 'http://doi.org/10.1007/11609773_1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/schachte-sndergaard-closureoperatorsforrobdds-2006\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('schachte-sndergaard-closureoperatorsforrobdds-2006')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Sch-Son_VMCAI06,\n  author    = {Peter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Closure Operators for {ROBDDs}},\n  editor    = {E. A. Emerson and K. S. Namjoshi},\n  booktitle = {Proceedings of the Seventh International Conference on\n        \tVerification, Model Checking and Abstract Interpretation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {3855},\n  pages     = {1--16},\n  publisher = {Springer},\n  year      = {2006},\n  doi       = {10.1007/11609773_1},\n  abstract  = {Program analysis commonly makes use of Boolean functions to \n\t\texpress information about run-time states. Many important \n\t\tclasses of Boolean functions used this way, such as the\n\t\tmonotone functions and the Boolean Horn functions, have\n\t\tsimple semantic characterisations. They also have well-known \n\t\tsyntactic characterisations in terms of Boolean formulae, say,\n\t\tin conjunctive normal form. Here we are concerned with \n\t\tcharacterisations using binary decision diagrams. Over the \n\t\tlast decade, ROBDDs have become popular as representations of \n\t\tBoolean functions, mainly for their algorithmic properties.\n\t\tAssuming ROBDDs as representation, we address the following \n\t\tproblems: Given a function $\\psi$ and a class of functions \n\t\t$\\class$, how to find the strongest $\\varphi \\in \\class$ \n\t\tentailed by $\\psi$ (when such a $\\varphi$ is known to exist)?\n\t\tHow to find the weakest $\\varphi \\in \\class$ that entails \n\t\t$\\psi$? How to determine that a function $\\psi$ belongs to a \n\t\tclass $\\class$? Answers are important, not only for several \n\t\tprogram analyses, but for other areas of computer science, \n\t\twhere Boolean approximation is used. We give, for many commonly\n\t\tused classes $\\class$ of Boolean functions, algorithms to \n\t\tapproximate functions represented as ROBDDs, in the sense \n\t\tdescribed above. The algorithms implement upper closure \n\t\toperators, familiar from abstract interpretation.  They \n\t\timmediately lead to algorithms for deciding class membership.},\n  keywords  = {Boolean logic, Boolean approximation, ROBDDs},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Program analysis commonly makes use of Boolean functions to express information about run-time states. Many important classes of Boolean functions used this way, such as the monotone functions and the Boolean Horn functions, have simple semantic characterisations. They also have well-known syntactic characterisations in terms of Boolean formulae, say, in conjunctive normal form. Here we are concerned with characterisations using binary decision diagrams. Over the last decade, ROBDDs have become popular as representations of Boolean functions, mainly for their algorithmic properties. Assuming ROBDDs as representation, we address the following problems: Given a function $ψ$ and a class of functions $ļass$, how to find the strongest $φ ∈ ļass$ entailed by $ψ$ (when such a $φ$ is known to exist)? How to find the weakest $φ ∈ ļass$ that entails $ψ$? How to determine that a function $ψ$ belongs to a class $ļass$? Answers are important, not only for several program analyses, but for other areas of computer science, where Boolean approximation is used. We give, for many commonly used classes $ļass$ of Boolean functions, algorithms to approximate functions represented as ROBDDs, in the sense described above. The algorithms implement upper closure operators, familiar from abstract interpretation. They immediately lead to algorithms for deciding class membership.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2005\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2005')\"\n      onkeypress=\"toggleGroup('group_2005')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2005</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"moffat-hughes-sndergaard-gruba-makingconnectionsfirstyeartransitionforcomputerscienceandsoftwareengineeringstudents-2005\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Making Connections: First Year Transition for Computer Science and Software Engineering Students.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Moffat, A.; Hughes, B.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Gruba, P.\n</span>\n\n  \n\n</span>\n\n  In Young, A.;  and Tolhurst, D., editor(s), <i>Proceedings of the Seventh Australasian Computing Education Conference (ACE2005)</i>, volume 42, of <i>Conferences in Research and Practice in Information Technology</i>, pages 229–238,  2005. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/moffat-hughes-sndergaard-gruba-makingconnectionsfirstyeartransitionforcomputerscienceandsoftwareengineeringstudents-2005\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('moffat-hughes-sndergaard-gruba-makingconnectionsfirstyeartransitionforcomputerscienceandsoftwareengineeringstudents-2005')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Mof-Hug-Son-Gru_ACE05,\n  author    = {Alistair Moffat and \n\t\tBaden Hughes and \n\t\tHarald S{\\o}ndergaard and \n\t\tPaul Gruba},\n  title     = {Making Connections: First Year Transition for Computer\n\t\tScience and Software Engineering Students},\n  editor    = {A. Young and D. Tolhurst},\n  booktitle = {Proceedings of the Seventh Australasian Computing Education \n\t\tConference (ACE2005)},\n  series    = {Conferences in Research and Practice in Information Technology},\n  volume    = {42},\n  pages     = {229--238},\n  year      = {2005},\n  abstract  = {During the last decade, an increasing emphasis has been placed \n\t\ton the need for carefully planned transition programs to help \n\t\tfirst-year students integrate into university. In this paper \n\t\twe critically examine our experiences in designing and running\n\t\tsuccessive transition programs for Computer Science and \n\t\tSoftware Engineering students. Over the last three years we \n\t\thave trialled several models. At present, our program requires \n\t\tall entering students to be enrolled in a transition subject,\n\t\t&#x60;&#x60;Making Connections&#x27;&#x27;, which runs for half a semester. The\n\t\tsubject, led by designated academic staff, serves as a forum \n\t\tfor students to learn about each other, the department and the \n\t\tuniversity. The program includes a computer-based language and\n\t\tstudy skills assessment component, including self-assessment \n\t\ttasks. Students can extend the subject by taking academic \n\t\tskills workshops run by the university&#x27;s student support \n\t\tservices. We have found compulsion to be a useful facilitator \n\t\tof student engagement, and the addition of an objective \n\t\tassessment task has been beneficial.},\n  keywords  = {Education, Student transition programs},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  During the last decade, an increasing emphasis has been placed on the need for carefully planned transition programs to help first-year students integrate into university. In this paper we critically examine our experiences in designing and running successive transition programs for Computer Science and Software Engineering students. Over the last three years we have trialled several models. At present, our program requires all entering students to be enrolled in a transition subject, ``Making Connections'', which runs for half a semester. The subject, led by designated academic staff, serves as a forum for students to learn about each other, the department and the university. The program includes a computer-based language and study skills assessment component, including self-assessment tasks. Students can extend the subject by taking academic skills workshops run by the university's student support services. We have found compulsion to be a useful facilitator of student engagement, and the addition of an objective assessment task has been beneficial.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2004\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2004')\"\n      onkeypress=\"toggleGroup('group_2004')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2004</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gruba-moffat-sndergaard-zobel-whatdrivescurriculumchange-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  What Drives Curriculum Change?.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gruba, P.; Moffat, A.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Zobel, J.\n</span>\n\n  \n\n</span>\n\n  In Lister, R.;  and Young, A., editor(s), <i>Proceedings of the Sixth Australasian Computing Education Conference (ACE2004)</i>, pages 109–117, jan 2004. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gruba-moffat-sndergaard-zobel-whatdrivescurriculumchange-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gruba-moffat-sndergaard-zobel-whatdrivescurriculumchange-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gru-Mof-Son-Zob_ACE04,\n  author    = {Paul Gruba and \n\t\tAlistair Moffat and \n\t\tHarald S{\\o}ndergaard and \n\t\tJustin Zobel},\n  title     = {What Drives Curriculum Change?},\n  editor    = {R. Lister and A. Young},\n  booktitle = {Proceedings of the Sixth Australasian Computing\n                        Education Conference (ACE2004)},\n  location  = {Dunedin, New Zealand},\n  pages     = {109--117},\n  month     = {jan},\n  year      = {2004},\n  abstract  = {While promotional literature about computer science programs \n\t\tmay claim that curricula are determined by the needs of the \n\t\tstudents and by international best practice, the reality is \n\t\toften different. In this paper we reflect on the factors \n\t\tunderlying curriculum change in computer science departments \n\t\tand schools, from institutional requirements and financial \n\t\tpressures to purely academic considerations. We have used \n\t\tthese reflections as the basis of an investigation of \n\t\tcurriculum management practices at institutions in Australasia,\n\t\tvia a survey instrument sent to a range of colleagues. Our \n\t\tfindings from the survey are consistent with our own \n\t\texperiences, namely, that curriculum change is driven or \n\t\tinhibited by factors such as vocal individuals and practical\n\t\tconstraints rather than higher academic motives.},\n  keywords  = {Education, Computer science curricula},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  While promotional literature about computer science programs may claim that curricula are determined by the needs of the students and by international best practice, the reality is often different. In this paper we reflect on the factors underlying curriculum change in computer science departments and schools, from institutional requirements and financial pressures to purely academic considerations. We have used these reflections as the basis of an investigation of curriculum management practices at institutions in Australasia, via a survey instrument sent to a range of colleagues. Our findings from the survey are consistent with our own experiences, namely, that curriculum change is driven or inhibited by factors such as vocal individuals and practical constraints rather than higher academic motives.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-thomas-effectivefeedbacktosmallandlargeclasses-2004\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Effective Feedback to Small and Large Classes.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Thomas, D.\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2004 ASEE/IEEE Frontiers in Education Conference (FIE2004)</i>, pages F1E-9–F1E-14, oct 2004. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/FIE.2004.1408573\"\n     onclick=\"log_download('sndergaard-thomas-effectivefeedbacktosmallandlargeclasses-2004', 'http://doi.org/10.1109/FIE.2004.1408573', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-thomas-effectivefeedbacktosmallandlargeclasses-2004\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-thomas-effectivefeedbacktosmallandlargeclasses-2004')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Son-Tho_FIE04,\n  author    = {Harald S{\\o}ndergaard and \n\t\tDoreen Thomas},\n  title     = {Effective Feedback to Small and Large Classes},\n  booktitle = {Proceedings of the 2004 ASEE/IEEE Frontiers in\n\t\tEducation Conference (FIE2004)},\n  pages     = {F1E-9--F1E-14},\n  location  = {Savannah GA},\n  month     = {oct},\n  year      = {2004},\n  doi       = {10.1109/FIE.2004.1408573},\n  abstract  = {Educational experts appear to be in broad agreement when it \n\t\tcomes to the importance of feedback for effective learning.  \n\t\tStudents benefit from plenty of opportunity and encouragement \n\t\tto express their understanding, and from informed, supportive, \n\t\tpossibly challenging, feedback. At the same time, we observe \n\t\tthat many students at our university do not find that they \n\t\treceive helpful feedback. One in three Engineering students \n\t\tdisagree or strongly disagree with the Quality of Teaching \n\t\tquestionnaire&#x27;s &#x60;&#x60;I received helpful feedback on how I was \n\t\tgoing&#x27;&#x27; in the individual course, and most other disciplines \n\t\tfind themselves in a similar situation. For the university as \n\t\ta whole, student responses to this question are clearly less \n\t\tpositive than to other questions on quality of teaching,\n\t\tintellectual stimulation, staff interest, workload, and so on,\n\t\tand this state of affairs seems quite common in the Australian\n\t\tcontext. We discuss best practice in feedback provision, partly\n\t\tbased on our interviews with students and staff. We have been \n\t\tparticularly interested in identifying cost-effective ways of \n\t\tproviding informed and constructive feedback to large classes.\n\t\tFeedback is often understood, by Engineering students and staff\n\t\talike, simply as comments on submitted work---typically written\n\t\tassignments. We argue in favour of a broader concept that \n\t\tcovers a multitude of ways for a student to develop deep \n\t\tlearning through conversation, including questions and answers\n\t\tprovided by others, team work, study groups, and formative\n\t\tteacher-provided feedback during an assessment task. We \n\t\temphasise the coaching role of the teacher, and feedback \n\t\tdesigned to encourage students to monitor own learning. Large \n\t\tclasses pose particular logistic problems. We identify staff \n\t\tdevelopment as a crucial factor for consistent, effective \n\t\tfeedback, and point to web-based feedback provision as a \n\t\tworkable solution to some logistic problems. We briefly discuss\n\t\tthe role of information technology more broadly, both for \n\t\tlearning enhancement and for automated feedback provision.},\n  keywords  = {Education},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Educational experts appear to be in broad agreement when it comes to the importance of feedback for effective learning. Students benefit from plenty of opportunity and encouragement to express their understanding, and from informed, supportive, possibly challenging, feedback. At the same time, we observe that many students at our university do not find that they receive helpful feedback. One in three Engineering students disagree or strongly disagree with the Quality of Teaching questionnaire's ``I received helpful feedback on how I was going'' in the individual course, and most other disciplines find themselves in a similar situation. For the university as a whole, student responses to this question are clearly less positive than to other questions on quality of teaching, intellectual stimulation, staff interest, workload, and so on, and this state of affairs seems quite common in the Australian context. We discuss best practice in feedback provision, partly based on our interviews with students and staff. We have been particularly interested in identifying cost-effective ways of providing informed and constructive feedback to large classes. Feedback is often understood, by Engineering students and staff alike, simply as comments on submitted work—typically written assignments. We argue in favour of a broader concept that covers a multitude of ways for a student to develop deep learning through conversation, including questions and answers provided by others, team work, study groups, and formative teacher-provided feedback during an assessment task. We emphasise the coaching role of the teacher, and feedback designed to encourage students to monitor own learning. Large classes pose particular logistic problems. We identify staff development as a crucial factor for consistent, effective feedback, and point to web-based feedback provision as a workable solution to some logistic problems. We briefly discuss the role of information technology more broadly, both for learning enhancement and for automated feedback provision.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2002\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2002')\"\n      onkeypress=\"toggleGroup('group_2002')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2002</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"codish-sndergaard-metacircularabstractinterpretationinprolog-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Meta-Circular Abstract Interpretation in Prolog.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Codish, M.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Mogensen, T.; Schmidt, D.;  and Sudborough, I. H., editor(s), <i>The Essence of Computation: Complexity, Analysis, Transformation</i>, volume 2566, of Lecture Notes in Computer Science, pages 109–134. Springer,  2002.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-36377-7_6\"\n     onclick=\"log_download('codish-sndergaard-metacircularabstractinterpretationinprolog-2002', 'http://doi.org/10.1007/3-540-36377-7_6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/codish-sndergaard-metacircularabstractinterpretationinprolog-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('codish-sndergaard-metacircularabstractinterpretationinprolog-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Incollection{Cod-Son_JonesFest02,\n  author    = {Michael Codish and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Meta-Circular Abstract Interpretation in {Prolog}},\n  editor    = {T. Mogensen and D. Schmidt and I. H. Sudborough},\n  booktitle = {The Essence of Computation: Complexity, Analysis, Transformation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {2566},\n  pages     = {109--134},\n  publisher = {Springer},\n  year      = {2002},\n  doi       = {10.1007/3-540-36377-7_6},\n  abstract  = {We give an introduction to the meta-circular approach to the\n\t\tabstract interpretation of logic programs.  This approach is\n\t\tparticularly useful for prototyping and for introductory \n\t\tclasses on abstract interpretation.  Using interpreters, \n\t\tstudents can immediately write, adapt, and experiment with \n\t\tinterpreters and working dataflow analysers.  We use a simple\n\t\tmeta-circular interpreter, based on a &#x60;&#x60;non-ground $T_P$&#x27;&#x27; \n\t\tsemantics, as a generic analysis engine.  Instantiating the\n\t\tengine is a matter of providing an appropriate domain of\n\t\tapproximations, together with definitions of &#x60;&#x60;abstract&#x27;&#x27; \n\t\tunification and disjunction.  Small changes of the interpreter\n\t\tlet us vary both what can be &#x60;&#x60;observed&#x27;&#x27; by an analyser, and\n\t\thow fixed point computation is done.  Amongst the dataflow \n\t\tanalyses used to exemplify this approach are a parity analysis,\n\t\tgroundness dependency analysis, call patterns, depth-$k$ \n\t\tanalysis, and a &#x60;&#x60;pattern&#x27;&#x27; analysis to establish most specific\n\t\tgeneralisations of calls and success sets.},\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Prolog},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We give an introduction to the meta-circular approach to the abstract interpretation of logic programs. This approach is particularly useful for prototyping and for introductory classes on abstract interpretation. Using interpreters, students can immediately write, adapt, and experiment with interpreters and working dataflow analysers. We use a simple meta-circular interpreter, based on a ``non-ground $T_P$'' semantics, as a generic analysis engine. Instantiating the engine is a matter of providing an appropriate domain of approximations, together with definitions of ``abstract'' unification and disjunction. Small changes of the interpreter let us vary both what can be ``observed'' by an analyser, and how fixed point computation is done. Amongst the dataflow analyses used to exemplify this approach are a parity analysis, groundness dependency analysis, call patterns, depth-$k$ analysis, and a ``pattern'' analysis to establish most specific generalisations of calls and success sets.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"glynn-stuckey-sulzmann-sndergaard-exceptionanalysisfornonstrictlanguages-2002\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Exception Analysis for Non-Strict Languages.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Glynn, K.; Stuckey, P. J.; Sulzmann, M.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming</i>, pages 98–109,  2002. ACM Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/581478.581488\"\n     onclick=\"log_download('glynn-stuckey-sulzmann-sndergaard-exceptionanalysisfornonstrictlanguages-2002', 'http://doi.org/10.1145/581478.581488', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/glynn-stuckey-sulzmann-sndergaard-exceptionanalysisfornonstrictlanguages-2002\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('glynn-stuckey-sulzmann-sndergaard-exceptionanalysisfornonstrictlanguages-2002')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Gly-Stu-Sul-Son_ICFP02,\n  author    = {Kevin Glynn and \n\t\tPeter J. Stuckey and \n\t\tMartin Sulzmann and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Exception Analysis for Non-Strict Languages},\n  booktitle = {Proceedings of the 2002 ACM SIGPLAN International Conference on\n        \tFunctional Programming},\n  pages     = {98--109},\n  publisher = {ACM Press},\n  year      = {2002},\n  doi       = {10.1145/581478.581488},\n  abstract  = {In this paper we present the first exception analysis\n\t\tfor a non-strict language. We augment a simply-typed \n\t\tfunctional language with exceptions, and show that we \n\t\tcan define a type-based inference system to detect \n\t\tuncaught exceptions. We have implemented this exception\n\t\tanalysis in the GHC compiler for Haskell, which has been\n\t\trecently extended with exceptions. We give empirical \n\t\tevidence that the analysis is practical.},\n  keywords  = {Exception analysis, Functional programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  In this paper we present the first exception analysis for a non-strict language. We augment a simply-typed functional language with exceptions, and show that we can define a type-based inference system to detect uncaught exceptions. We have implemented this exception analysis in the GHC compiler for Haskell, which has been recently extended with exceptions. We give empirical evidence that the analysis is practical.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2001\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2001')\"\n      onkeypress=\"toggleGroup('group_2001')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2001</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Higher-Precision Groundness Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Codish, M.; Genaim, S.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Codognet, P., editor(s), <i>Logic Programming: Proceedings of the 17th International Conference</i>, volume 2237, of <i>Lecture Notes in Computer Science</i>, pages 135–149,  2001. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-45635-x_17\"\n     onclick=\"log_download('codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001', 'http://doi.org/10.1007/3-540-45635-x_17', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('codish-genaim-sndergaard-stuckey-higherprecisiongroundnessanalysis-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Cod-Gen-Son-Stu_ICLP01,\n  author    = {Michael Codish and \n\t\tSamir Genaim and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Higher-Precision Groundness Analysis},\n  editor    = {P. Codognet},\n  booktitle = {Logic Programming: Proceedings of the 17th International \n\t\tConference},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {2237},\n  pages     = {135--149},\n  publisher = {Springer},\n  year      = {2001},\n  doi       = {10.1007/3-540-45635-x_17},\n  abstract  = {Groundness analysis of logic programs using Pos-based abstract\n\t\tinterpretation is one of the clear success stories of the last\n\t\tdecade in the area of logic program analysis. In this work we\n\t\tidentify two problems with the Pos domain, the multiplicity and\n\t\tsign problems, that arise independently in groundness and \n\t\tuniqueness analysis. We describe how these problems can be \n\t\tsolved using an analysis based on a domain Size for inferring \n\t\tterm size relations.  However this solution has its own \n\t\tshortcomings because it involves a widening operator which leads\n\t\tto a loss of Pos information. Inspired by Pos, Size and the\n\t\tLsign domain for abstract linear arithmetic constraints we\n\t\tintroduce a new domain Lpos, and show how it can be used for\n\t\tgroundness and uniqueness analysis. The idea is to use the sign\n\t\tinformation of Lsign to improve the widening of Size so that\n\t\tit does not lose Pos information. We prove that the resulting \n\t\tanalyses using Lpos are uniformly more precise than those using\n\t\tPos.},\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis. In this work we identify two problems with the Pos domain, the multiplicity and sign problems, that arise independently in groundness and uniqueness analysis. We describe how these problems can be solved using an analysis based on a domain Size for inferring term size relations. However this solution has its own shortcomings because it involves a widening operator which leads to a loss of Pos information. Inspired by Pos, Size and the Lsign domain for abstract linear arithmetic constraints we introduce a new domain Lpos, and show how it can be used for groundness and uniqueness analysis. The idea is to use the sign information of Lsign to improve the widening of Size so that it does not lose Pos information. We prove that the resulting analyses using Lpos are uniformly more precise than those using Pos.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"glynn-stuckey-sulzmann-sndergaard-booleanconstraintsforbindingtimeanalysis-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Boolean Constraints for Binding-Time Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Glynn, K.; Stuckey, P. J.; Sulzmann, M.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Danvy, O.;  and Filinsky, A., editor(s), <i>Programs as Data Objects: Proceedings of the Second Symposium</i>, volume 2053, of <i>Lecture Notes in Computer Science</i>, pages 39–63,  2001. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-44978-7_4\"\n     onclick=\"log_download('glynn-stuckey-sulzmann-sndergaard-booleanconstraintsforbindingtimeanalysis-2001', 'http://doi.org/10.1007/3-540-44978-7_4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/glynn-stuckey-sulzmann-sndergaard-booleanconstraintsforbindingtimeanalysis-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('glynn-stuckey-sulzmann-sndergaard-booleanconstraintsforbindingtimeanalysis-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Gly-Stu-Sul-Son_PADO01,\n  author    = {Kevin Glynn and \n\t\tPeter J. Stuckey and \n\t\tMartin Sulzmann and\n\t\tHarald S{\\o}ndergaard},\n  title     = {Boolean Constraints for Binding-Time Analysis},\n  editor    = {O. Danvy and A. Filinsky},\n  booktitle = {Programs as Data Objects: Proceedings of the Second Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {2053},\n  pages     = {39--63},\n  publisher = {Springer},\n  year      = {2001},\n  doi       = {10.1007/3-540-44978-7_4},\n  abstract  = {To achieve acceptable accuracy, many program analyses for\n\t\tfunctional programs are &#x60;&#x60;property polymorphic&#x27;&#x27;.\n\t\tThat is, they can infer different input-output relations \n\t\tfor a function at separate applications of the function, \n\t\tin a manner similar to type inference for a polymorphic \n\t\tlanguage. We extend a property polymorphic (or &#x60;&#x60;polyvariant&#x27;&#x27;)\n\t\tmethod for binding-time analysis, due to Dussart, Henglein, \n\t\tand Mossin, so that it applies to languages with ML-style \n\t\ttype polymorphism. The extension is non-trivial \n\t\tand we have implemented it for Haskell. While we follow \n\t\tothers in specifying the analysis as a non-standard type\n\t\tinference, we argue that it should be realised through a \n\t\ttranslation into the well-understood domain of Boolean \n\t\tconstraints. The expressiveness offered by Boolean \n\t\tconstraints opens the way for smooth extensions to \n\t\tsophisticated language features and it allows for \n\t\tmore accurate analysis.},\n  keywords  = {Boolean logic, Binding-time analysis, Haskell},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  To achieve acceptable accuracy, many program analyses for functional programs are ``property polymorphic''. That is, they can infer different input-output relations for a function at separate applications of the function, in a manner similar to type inference for a polymorphic language. We extend a property polymorphic (or ``polyvariant'') method for binding-time analysis, due to Dussart, Henglein, and Mossin, so that it applies to languages with ML-style type polymorphism. The extension is non-trivial and we have implemented it for Haskell. While we follow others in specifying the analysis as a non-standard type inference, we argue that it should be realised through a translation into the well-understood domain of Boolean constraints. The expressiveness offered by Boolean constraints opens the way for smooth extensions to sophisticated language features and it allows for more accurate analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gruba-sndergaard-aconstructivistapproachtocommunicationskillsinstructionincomputerscience-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Constructivist Approach to Communication Skills Instruction in Computer Science.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gruba, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Computer Science Education</i>, 11(3): 203–219.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1076/csed.11.3.203.3833\"\n     onclick=\"log_download('gruba-sndergaard-aconstructivistapproachtocommunicationskillsinstructionincomputerscience-2001', 'http://doi.org/10.1076/csed.11.3.203.3833', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gruba-sndergaard-aconstructivistapproachtocommunicationskillsinstructionincomputerscience-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gruba-sndergaard-aconstructivistapproachtocommunicationskillsinstructionincomputerscience-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Gru-Son_CSE01,\n  author    = {Paul Gruba and \n\t\tHarald S{\\o}ndergaard},\n  title     = {A Constructivist Approach to Communication Skills Instruction \n\t\tin Computer Science},\n  journal   = {Computer Science Education},\n  volume    = {11},\n  number    = {3},\n  pages     = {203--219},\n  year      = {2001},\n  doi       = {10.1076/csed.11.3.203.3833},\n  abstract  = {From the social constructivist perspective of education, \n\t\tlearning is best achieved when students face complex, real \n\t\tworld problems in which there are no clear answers. Faced with\n\t\ta sizable common goal, students work collaboratively towards \n\t\toutcomes and maintain ownership over key decisions. The role \n\t\tof staff is that of facilitators whose role is to challenge l\n\t\tearners to explore multiple aspects of the problem as they go \n\t\tabout reaching viable solutions. Such a role contrasts, for \n\t\texample, to an approach which sets out to lead students to a \n\t\tpresumed correct solution that is already possessed by the\n\t\tinstructor. Based on these principles we designed and \n\t\timplemented a course on communication skills in Computer \n\t\tScience. Here, we describe our experiences using a student-run \n\t\tconference as a means to teach communication skills. In this \n\t\tapproach, students were charged with the task of planning and \n\t\torganising a conference, including peer review, publicity, \n\t\tbudget, sponsorship, web design, conference program, \n\t\tpresentation schedule, speaker support, and catering. We \n\t\tdescribe the principles and their implementation and reflect \n\t\ton the outcome.},\n  keywords  = {Education, Communication skills instruction},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge l earners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-principlesandpracticeofdeclarativeprogramming-2001\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Principles and Practice of Declarative Programming.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>,\n  editor.\n  \n</span>\n\n  \n\n</span>\n\n  ACM Press.  2001.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-principlesandpracticeofdeclarativeprogramming-2001\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-principlesandpracticeofdeclarativeprogramming-2001')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Proceedings{Son_PPDP01,\n  editor    = {Harald S{\\o}ndergaard},\n  title     = {Principles and Practice of Declarative Programming},\n  publisher = {ACM Press},\n  year      = {2001},\n  keywords  = {PPDP 2001, logic programming, functional programming},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_2000\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_2000')\"\n      onkeypress=\"toggleGroup('group_2000')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>2000</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"gruba-sndergaard-transformingcommunicationskillsinstructiontheconferenceapproach-2000\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Transforming Communication Skills Instruction: The Conference Approach.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gruba, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Edwards, J., editor(s), <i>Proceedings of the 23rd Australasian Computer Science Conference</i>, of <i>Australian Computer Science Communications 22</i>, pages 88–94,  2000. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1109/ACSC.2000.824385\"\n     onclick=\"log_download('gruba-sndergaard-transformingcommunicationskillsinstructiontheconferenceapproach-2000', 'http://doi.org/10.1109/ACSC.2000.824385', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gruba-sndergaard-transformingcommunicationskillsinstructiontheconferenceapproach-2000\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gruba-sndergaard-transformingcommunicationskillsinstructiontheconferenceapproach-2000')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gru-Son_ACSC00,\n  author    = {Paul Gruba and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Transforming Communication Skills Instruction:\n                        The Conference Approach},\n  editor    = {J. Edwards},\n  booktitle = {Proceedings of the 23rd Australasian Computer Science \n\t\tConference},\n  series    = {Australian Computer Science Communications 22},\n  number    = {1},\n  pages     = {88--94},\n  year      = {2000},\n  publisher = {IEEE Computer Society},\n  location  = {Canberra, Australia},\n  doi       = {10.1109/ACSC.2000.824385},\n  abstract  = {From the social constructivist perspective of education, \n\t\tlearning is best achieved when students face complex, real \n\t\tworld problems in which there are no clear answers. Faced with\n\t\ta sizable common goal, students work collaboratively towards \n\t\toutcomes and maintain ownership over key decisions. The role \n\t\tof staff is that of facilitators whose role is to challenge \n\t\tlearners to explore multiple aspects of the problem as they go \n\t\tabout reaching viable solutions. Such a role contrasts, for \n\t\texample, to an approach which sets out to lead students to a \n\t\tpresumed correct solution that is already possessed by the\n\t\tinstructor. Based on these principles we designed and \n\t\timplemented a course on communication skills in Computer \n\t\tScience. Here, we describe our experiences using a student-run \n\t\tconference as a means to teach communication skills. In this \n\t\tapproach, students were charged with the task of planning and \n\t\torganising a conference, including peer review, publicity, \n\t\tbudget, sponsorship, web design, conference program, \n\t\tpresentation schedule, speaker support, and catering.\n\t\tWe describe the principles and their implementation and \n\t\treflect on the outcome.},\n  keywords  = {Education, Communication skills instruction},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  From the social constructivist perspective of education, learning is best achieved when students face complex, real world problems in which there are no clear answers. Faced with a sizable common goal, students work collaboratively towards outcomes and maintain ownership over key decisions. The role of staff is that of facilitators whose role is to challenge learners to explore multiple aspects of the problem as they go about reaching viable solutions. Such a role contrasts, for example, to an approach which sets out to lead students to a presumed correct solution that is already possessed by the instructor. Based on these principles we designed and implemented a course on communication skills in Computer Science. Here, we describe our experiences using a student-run conference as a means to teach communication skills. In this approach, students were charged with the task of planning and organising a conference, including peer review, publicity, budget, sponsorship, web design, conference program, presentation schedule, speaker support, and catering. We describe the principles and their implementation and reflect on the outcome.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1999\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1999')\"\n      onkeypress=\"toggleGroup('group_1999')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1999</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"codish-sndergaard-stuckey-sharingandgroundnessdependenciesinlogicprograms-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Sharing and Groundness Dependencies in Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Codish, M.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Programming Languages and Systems</i>, 21(5): 948–976.  1999.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/330249.330252\"\n     onclick=\"log_download('codish-sndergaard-stuckey-sharingandgroundnessdependenciesinlogicprograms-1999', 'http://doi.org/10.1145/330249.330252', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/codish-sndergaard-stuckey-sharingandgroundnessdependenciesinlogicprograms-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('codish-sndergaard-stuckey-sharingandgroundnessdependenciesinlogicprograms-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Cod-Son-Stu_TOPLAS99,\n  author   = {Michael Codish and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title    = {Sharing and Groundness Dependencies in Logic Programs},\n  journal  = {ACM Transactions on Programming Languages and Systems},\n  volume   = {21},\n  number   = {5},\n  pages    = {948--976},\n  year     = {1999},\n  doi      = {10.1145/330249.330252},\n  abstract = {We investigate Jacobs and Langen&#x27;s \\textsf{Sharing} domain, \n\t\tintroduced for the analysis of variable sharing in logic \n\t\tprograms, and show that it is isomorphic to Marriott and \n\t\tS{\\o}ndergaard&#x27;s \\textsf{Pos} domain, introduced for the \n\t\tanalysis of groundness dependencies.  Our key idea\n\t\tis to view the sets of variables in a \\textsf{Sharing} \n\t\tdomain element as the models of a corresponding Boolean \n\t\tfunction.  This leads to a recasting of sharing analysis \n\t\tin terms of the property of &#x60;&#x60;not being affected by the \n\t\tbinding of a \\emph{single} variable.&#x27;&#x27;  Such an\n\t\t&#x60;&#x60;unaffectedness dependency&#x27;&#x27; analysis has close \n\t\tconnections with groundness dependency analysis using \n\t\tpositive Boolean functions.  This new view improves our \n\t\tunderstanding of sharing analysis, and leads to an elegant\n\t\texpression of its combination with groundness dependency\n\t\tanalysis based on the reduced product of \\textsf{Sharing} \n\t\tand \\textsf{Pos}.  It also opens up new avenues for the \n\t\tefficient implementation of sharing analysis, for example \n\t\tusing reduced order binary decision diagrams, as well as\n\t\tefficient implementation of the reduced product, using \n\t\tdomain factorizations.},\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We investigate Jacobs and Langen's \\textsfSharing domain, introduced for the analysis of variable sharing in logic programs, and show that it is isomorphic to Marriott and Søndergaard's \\textsfPos domain, introduced for the analysis of groundness dependencies. Our key idea is to view the sets of variables in a \\textsfSharing domain element as the models of a corresponding Boolean function. This leads to a recasting of sharing analysis in terms of the property of ``not being affected by the binding of a \\emphsingle variable.'' Such an ``unaffectedness dependency'' analysis has close connections with groundness dependency analysis using positive Boolean functions. This new view improves our understanding of sharing analysis, and leads to an elegant expression of its combination with groundness dependency analysis based on the reduced product of \\textsfSharing and \\textsfPos. It also opens up new avenues for the efficient implementation of sharing analysis, for example using reduced order binary decision diagrams, as well as efficient implementation of the reduced product, using domain factorizations.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"gabri-glynn-sndergaard-strictnessanalysisasfinitedomainconstraintsolving-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Strictness Analysis as Finite-Domain Constraint Solving.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Gabrić, T.; Glynn, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Flener, P., editor(s), <i>Logic-Based Program Synthesis and Transformation</i>, volume 1559, of <i>Lecture Notes in Computer Science</i>, pages 255–270, Berlin, Germany,  1999. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-48958-4_14\"\n     onclick=\"log_download('gabri-glynn-sndergaard-strictnessanalysisasfinitedomainconstraintsolving-1999', 'http://doi.org/10.1007/3-540-48958-4_14', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/gabri-glynn-sndergaard-strictnessanalysisasfinitedomainconstraintsolving-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('gabri-glynn-sndergaard-strictnessanalysisasfinitedomainconstraintsolving-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Gab-Gly-Son_LOPSTR98,\n  author    = {Tihomir Gabri{\\&#x27;c} and \n\t\tKevin Glynn and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Strictness Analysis as Finite-Domain Constraint Solving},\n  editor    = {P. Flener},\n  booktitle = {Logic-Based Program Synthesis and Transformation},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1559},\n  pages     = {255--270},\n  publisher = {Springer},\n  address   = {Berlin, Germany},\n  year      = {1999},\n  doi       = {10.1007/3-540-48958-4_14},\n  abstract  = {It has become popular to express dataflow analyses in logical \n\t\tform. In this paper we investigate a new approach to the \n\t\tanalysis of functional programs, based on synthesis of \n\t\tconstraint logic programs. We sketch how the language Toupie,\n\t\toriginally designed with logic program analysis as one \n\t\tobjective, lends itself also to sophisticated strictness \n\t\tanalysis. Strictness analysis is straightforward in the \n\t\tsimplest case, that of analysing a first-order functional \n\t\tlanguage using just two strictness values, namely divergence \n\t\tand &#x60;&#x60;don&#x27;t know&#x27;&#x27;. Mycroft&#x27;s classical translation immediately\n\t\tyields perfectly valid Boolean constraint logic programs, \n\t\twhich, when run, provide the desired strictness information.\n\t\tHowever, more sophisticated analysis requires more complex \n\t\tdomains of strictness values. We recast Wadler&#x27;s classical \n\t\tanalysis over a $2n$-point domain as finite-domain \n\t\tconstraint solving. This approach has several advantages.\n\t\tFirst, the translation is relatively simple. We translate a \n\t\trecursive function definition into one or two constraint \n\t\tprogram clauses, in a manner which naturally extends Mycroft&#x27;s\n\t\ttranslation for the 2-point case, where the classical approach\n\t\ttranslate the definition of an $n$-place function over lists \n\t\tinto $4^n$ mutually recursive equations. Second, the resulting \n\t\tprogram produces \\emph{relational} information, allowing for \n\t\texample to ask which combinations of properties of input will \n\t\tproduce a given output. Third, the approach allows us to \n\t\tleverage from established technology, for solving finite-domain \n\t\tconstraints, as well as for finding fixed points. Finally, the\n\t\tuse of (disjunctive) constraints can yield a higher precision \n\t\tin the analysis of some programs.},\n  keywords  = {Strictness analysis, Abstract interpretation, Abstract domains, Functional programming, Constraint programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  It has become popular to express dataflow analyses in logical form. In this paper we investigate a new approach to the analysis of functional programs, based on synthesis of constraint logic programs. We sketch how the language Toupie, originally designed with logic program analysis as one objective, lends itself also to sophisticated strictness analysis. Strictness analysis is straightforward in the simplest case, that of analysing a first-order functional language using just two strictness values, namely divergence and ``don't know''. Mycroft's classical translation immediately yields perfectly valid Boolean constraint logic programs, which, when run, provide the desired strictness information. However, more sophisticated analysis requires more complex domains of strictness values. We recast Wadler's classical analysis over a $2n$-point domain as finite-domain constraint solving. This approach has several advantages. First, the translation is relatively simple. We translate a recursive function definition into one or two constraint program clauses, in a manner which naturally extends Mycroft's translation for the 2-point case, where the classical approach translate the definition of an $n$-place function over lists into $4^n$ mutually recursive equations. Second, the resulting program produces \\emphrelational information, allowing for example to ask which combinations of properties of input will produce a given output. Third, the approach allows us to leverage from established technology, for solving finite-domain constraints, as well as for finding fixed points. Finally, the use of (disjunctive) constraints can yield a higher precision in the analysis of some programs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"glynn-sndergaard-immediatefixpointsforstrictnessanalysis-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Immediate Fixpoints for Strictness Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Glynn, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Edwards, J., editor(s), <i>Proceedings of the 22nd Australasian Computer Science Conference</i>, volume 21, of <i>Australian Computer Science Communications</i>, pages 336–347,  1999. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/glynn-sndergaard-immediatefixpointsforstrictnessanalysis-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('glynn-sndergaard-immediatefixpointsforstrictnessanalysis-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Gly-Son_ACSC99,\n  author    = {Kevin Glynn and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Immediate Fixpoints for Strictness Analysis},\n  editor    = {J. Edwards},\n  booktitle = {Proceedings of the 22nd Australasian Computer Science \n\t\tConference},\n  series    = {Australian Computer Science Communications},\n  volume    = {21},\n  number    = {1},\n  year      = {1999},\n  pages     = {336--347},\n  publisher = {Springer},\n  abstract  = {This paper is concerned with the problem of finding fixpoints\n                without resorting to Kleene iteration. In many cases, a simple\n\t\tsyntactic test suffices to establish that a closed form can be \n\t\tfound without iteration. For example, if the function $F$, \n\t\twhose fixpoint we want to determine, is idempotent, then its \n\t\tleast fixpoint is simply the instantiation $F(0)$, where $0$ \n\t\tis the least element of the lattice. In many cases, idempotence\n\t\tcan be gleaned easily from $F$&#x27;s definition. In other cases, \n\t\tsimple symbolic manipulation of a recursive definition may \n\t\treveal shortcuts to a closed form. We explore such cases and \n\t\tshow how the faster fixpoint calculation can have applications\n\t\tin strictness analysis.},\n  keywords  = {Fixed points, Strictness analysis, Functional programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This paper is concerned with the problem of finding fixpoints without resorting to Kleene iteration. In many cases, a simple syntactic test suffices to establish that a closed form can be found without iteration. For example, if the function $F$, whose fixpoint we want to determine, is idempotent, then its least fixpoint is simply the instantiation $F(0)$, where $0$ is the least element of the lattice. In many cases, idempotence can be gleaned easily from $F$'s definition. In other cases, simple symbolic manipulation of a recursive definition may reveal shortcuts to a closed form. We explore such cases and show how the faster fixpoint calculation can have applications in strictness analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"stern-sndergaard-naish-astrategyformanagingcontentcomplexityinalgorithmanimation-1999\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Strategy for Managing Content Complexity in Algorithm Animation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Stern, L.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Naish, L.\n</span>\n\n  \n\n</span>\n\n  In Manaris, B., editor(s), <i>Proceedings of the Fourth Annual SIGCSE/SIGCUE Conference on Innovation and Technology in Computer Science Education</i>, pages 127–130, New York, NY,  1999. Association for Computing Machinery\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/305786.305891\"\n     onclick=\"log_download('stern-sndergaard-naish-astrategyformanagingcontentcomplexityinalgorithmanimation-1999', 'http://doi.org/10.1145/305786.305891', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/stern-sndergaard-naish-astrategyformanagingcontentcomplexityinalgorithmanimation-1999\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('stern-sndergaard-naish-astrategyformanagingcontentcomplexityinalgorithmanimation-1999')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@InProceedings{Ste-Son-Nai_ITiCSE99,\n  author    = {Linda Stern and \n\t\tHarald S{\\o}ndergaard and \n\t\tLee Naish},\n  title     = {A Strategy for Managing Content Complexity in\n\t\tAlgorithm Animation},\n  editor    = {B. Manaris},\n  booktitle = {Proceedings of the Fourth Annual SIGCSE/SIGCUE Conference on\n\t\tInnovation and Technology in Computer Science Education},\n  pages     = {127--130},\n  publisher = {Association for Computing Machinery},\n  address   = {New York, NY},\n  year      = {1999},\n  location  = {Cracow, Poland},\n  doi       = {10.1145/305786.305891},\n  abstract  = {Computer animation is an excellent medium for capturing \n\t\tthe dynamic nature of data structure manipulations, and \n\t\tcan be used to advantage in the teaching of algorithms \n\t\tand data structures. A major educational issue is the \n\t\tnecessity of providing a means for the student to manage \n\t\tthe complexity of the material. We have addressed this\n\t\tissue in a multimedia teaching tool called &#x60;&#x60;Algorithms in\n\t\tAction&#x27;&#x27; by allowing students to view an algorithm at \n\t\tvarying levels of detail. Starting with a high level \n\t\tpseudocode description of the algorithm, with accompanying \n\t\thigh level animation and textual explanation, students can \n\t\texpand sections of the pseudocode to expose more detail.\n\t\tAnimation and explanation are controlled in coordinate\n\t\tfashion, becoming correspondingly more detailed as the \n\t\tpseudocode is expanded. Student feedback suggests that the\n\t\tavailability of multiple levels detail and the facility\n\t\tfor the user to control the level of detail being viewed\n\t\tis an effective way to manage content complexity.},\n  keywords  = {Education, Algorithm visualisation, Web-based learning},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Computer animation is an excellent medium for capturing the dynamic nature of data structure manipulations, and can be used to advantage in the teaching of algorithms and data structures. A major educational issue is the necessity of providing a means for the student to manage the complexity of the material. We have addressed this issue in a multimedia teaching tool called ``Algorithms in Action'' by allowing students to view an algorithm at varying levels of detail. Starting with a high level pseudocode description of the algorithm, with accompanying high level animation and textual explanation, students can expand sections of the pseudocode to expose more detail. Animation and explanation are controlled in coordinate fashion, becoming correspondingly more detailed as the pseudocode is expanded. Student feedback suggests that the availability of multiple levels detail and the facility for the user to control the level of detail being viewed is an effective way to manage content complexity.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1998\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1998')\"\n      onkeypress=\"toggleGroup('group_1998')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1998</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"armstrong-marriott-schachte-sndergaard-twoclassesofbooleanfunctionsfordependencyanalysis-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Two Classes of Boolean Functions for Dependency Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Armstrong, T.; Marriott, K.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Science of Computer Programming</i>, 31(1): 3–45.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1016/S0167-6423(96)00039-1\"\n     onclick=\"log_download('armstrong-marriott-schachte-sndergaard-twoclassesofbooleanfunctionsfordependencyanalysis-1998', 'http://doi.org/10.1016/S0167-6423(96)00039-1', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/armstrong-marriott-schachte-sndergaard-twoclassesofbooleanfunctionsfordependencyanalysis-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('armstrong-marriott-schachte-sndergaard-twoclassesofbooleanfunctionsfordependencyanalysis-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Arm-Mar-Sch-Son_SCP98,\n  author   = {Tania Armstrong and \n\t\tKim Marriott and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title\t   = {Two Classes of {Boolean} Functions for Dependency Analysis},\n  journal  = {Science of Computer Programming},\n  volume   = {31},\n  number   = {1},\n  pages    = {3--45},\n  year\t   = {1998},\n  doi       = {10.1016/S0167-6423(96)00039-1},\n  abstract = {Many static analyses for declarative programming/database \n\t\tlanguages use Boolean functions to express dependencies \n\t\tamong variables or argument positions. Examples include \n\t\tgroundness analysis, arguably the most important analysis for \n\t\tlogic programs, finiteness analysis and functional dependency \n\t\tanalysis for databases. We identify two classes of Boolean \n\t\tfunctions that have been used: positive and definite functions,\n\t\tand we systematically investigate these classes and their \n\t\tefficient implementation for dependency analyses. On the \n\t\ttheoretical side we provide syntactic characterizations and\n\t\tstudy the expressiveness and algebraic properties of the \n\t\tclasses. In particular, we show that both are closed under \n\t\texistential quantification. On the practical side we \n\t\tinvestigate various representations for the classes based on \n\t\treduced ordered binary decision diagrams (ROBDDs), disjunctive \n\t\tnormal form, conjunctive normal form, Blake canonical form, \n\t\tdual Blake canonical form, and a form specific to definite \n\t\tfunctions. We compare the resulting implementations of \n\t\tgroundness analyzers based on the representations for precision\n\t\tand efficiency.},\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many static analyses for declarative programming/database languages use Boolean functions to express dependencies among variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis for databases. We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. On the theoretical side we provide syntactic characterizations and study the expressiveness and algebraic properties of the classes. In particular, we show that both are closed under existential quantification. On the practical side we investigate various representations for the classes based on reduced ordered binary decision diagrams (ROBDDs), disjunctive normal form, conjunctive normal form, Blake canonical form, dual Blake canonical form, and a form specific to definite functions. We compare the resulting implementations of groundness analyzers based on the representations for precision and efficiency.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"codish-sndergaard-thebooleanlogicofsetsharinganalysis-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  The Boolean Logic of Set Sharing Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Codish, M.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Palamidessi, C.; Glaser, H.;  and Meinke, K., editor(s), <i>Principles of Declarative Programming</i>, volume 1490, of <i>Lecture Notes in Computer Science</i>, pages 89–101,  1998. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/bfb0056609\"\n     onclick=\"log_download('codish-sndergaard-thebooleanlogicofsetsharinganalysis-1998', 'http://doi.org/10.1007/bfb0056609', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/codish-sndergaard-thebooleanlogicofsetsharinganalysis-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('codish-sndergaard-thebooleanlogicofsetsharinganalysis-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Cod-Son_PLILP98,\n  author    = {Michael Codish and \n\t\tHarald S{\\o}ndergaard},\n  title     = {The {Boolean} Logic of Set Sharing Analysis},\n  editor    = {C. Palamidessi and H. Glaser and K. Meinke},\n  booktitle = {Principles of Declarative Programming},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1490},\n  pages     = {89--101},\n  publisher = {Springer},\n  year      = {1998},\n  doi       = {10.1007/bfb0056609},\n  abstract  = {We show that Jacobs and Langen&#x27;s domain for set-sharing \n\t\tanalysis is isomorphic to the domain of positive Boolean \n\t\tfunctions, introduced by Marriott and S{\\o}ndergaard for \n\t\tgroundness dependency analysis. Viewing a set-sharing \n\t\tdescription as a minterm representation of a Boolean \n\t\tfunction leads to re-casting sharing analysis as an\n\t\tinstantiation dependency analysis. The key idea is to \n\t\tview the sets of variables in a sharing domain element \n\t\tas the models of a Boolean function. In this way, sharing \n\t\tsets are precisely dual negated positive Boolean functions. \n\t\tThis new view improves our understanding of sharing \n\t\tanalysis considerably and opens up new avenues for the\n\t\tefficient implementation of this kind of analysis, for \n\t\texample using ROBDDs. To this end we express Jacobs and \n\t\tLangen&#x27;s abstract operations for set sharing in logical form.},\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show that Jacobs and Langen's domain for set-sharing analysis is isomorphic to the domain of positive Boolean functions, introduced by Marriott and Søndergaard for groundness dependency analysis. Viewing a set-sharing description as a minterm representation of a Boolean function leads to re-casting sharing analysis as an instantiation dependency analysis. The key idea is to view the sets of variables in a sharing domain element as the models of a Boolean function. In this way, sharing sets are precisely dual negated positive Boolean functions. This new view improves our understanding of sharing analysis considerably and opens up new avenues for the efficient implementation of this kind of analysis, for example using ROBDDs. To this end we express Jacobs and Langen's abstract operations for set sharing in logical form.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"garcadelabanda-marriott-stuckey-sndergaard-differentialmethodsinlogicprogramanalysis-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Differential Methods in Logic Program Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Garcı́a de la Banda, M.; Marriott, K.; Stuckey, P. J.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Logic Programming</i>, 35(1): 1–37.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1016/s0743-1066(97)10002-4\"\n     onclick=\"log_download('garcadelabanda-marriott-stuckey-sndergaard-differentialmethodsinlogicprogramanalysis-1998', 'http://doi.org/10.1016/s0743-1066(97)10002-4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/garcadelabanda-marriott-stuckey-sndergaard-differentialmethodsinlogicprogramanalysis-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('garcadelabanda-marriott-stuckey-sndergaard-differentialmethodsinlogicprogramanalysis-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@article{Gar-Mar-Stu-Son_JLP98,\n  author    = {Maria {Garc{\\&#x27;\\i}a de la Banda} and \n\t\tKim Marriott and\n\t\tPeter J. Stuckey and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Differential Methods in Logic Program Analysis},\n  journal   = {Journal of Logic Programming},\n  volume    = {35},\n  number    = {1},\n  pages     = {1--37},\n  year      = {1998},\n  doi       = {10.1016/s0743-1066(97)10002-4},\n  abstract  = {Program analysis based on abstract interpretation has proven\n\t\tvery useful in compilation of constraint and logic programming\n\t\tlanguages. Unfortunately, the traditional goal-dependent \n\t\tframework is inherently imprecise. This is because it handles \n\t\tcall and return in such a way that dataflow information may be \n\t\tre-asserted unnecessarily, leading to a loss of precision for\n\t\tmany description domains. For a few specific domains, the \n\t\tliterature contains proposals to overcome the problem, and some\n\t\timplementations use various unpublished tricks that sometimes \n\t\tavoid the precision loss. The purpose of this paper is to map \n\t\tthe landscape of goal-dependent, goal-independent, and combined\n\t\tapproaches to generic analysis of logic programs. This includes\n\t\tformalising existing methods and tricks in a way that is \n\t\tindependent of specific description domains. Moreover, we \n\t\tsuggest new methods for overcoming the loss of \n\t\tprecision---altogether eight different semantics are \n\t\tconsidered and compared. We provide theoretical results \n\t\tdetermining the relative accuracy of the approaches. These \n\t\tshow that two of our new semantics are uniformally more \n\t\taccurate than existing approaches. Experiments that we have \n\t\tperformed (for two description domains) with implementations \n\t\tof the eight different approaches enable a discussion of their\n\t\trelative runtime performances. We discuss the expected effect \n\t\ton other domains as well and conclude that our new methods \n\t\tcan be trusted to yield significantly more accurate analysis \n\t\tfor a small extra implementation effort, without compromising \n\t\tthe efficiency of analysis.},\n  keywords  = {Abstract interpretation, Logic programming, Sharing analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Program analysis based on abstract interpretation has proven very useful in compilation of constraint and logic programming languages. Unfortunately, the traditional goal-dependent framework is inherently imprecise. This is because it handles call and return in such a way that dataflow information may be re-asserted unnecessarily, leading to a loss of precision for many description domains. For a few specific domains, the literature contains proposals to overcome the problem, and some implementations use various unpublished tricks that sometimes avoid the precision loss. The purpose of this paper is to map the landscape of goal-dependent, goal-independent, and combined approaches to generic analysis of logic programs. This includes formalising existing methods and tricks in a way that is independent of specific description domains. Moreover, we suggest new methods for overcoming the loss of precision—altogether eight different semantics are considered and compared. We provide theoretical results determining the relative accuracy of the approaches. These show that two of our new semantics are uniformally more accurate than existing approaches. Experiments that we have performed (for two description domains) with implementations of the eight different approaches enable a discussion of their relative runtime performances. We discuss the expected effect on other domains as well and conclude that our new methods can be trusted to yield significantly more accurate analysis for a small extra implementation effort, without compromising the efficiency of analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kelly-marriott-sndergaard-stuckey-apracticalobjectorientedanalysisengineforconstraintlogicprograms-1998\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Practical Object-Oriented Analysis Engine for Constraint Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kelly, A. D.; Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  <i>Software—Practice and Experience</i>, 28(2): 199–224.  1998.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1002/(SICI)1097-024X(199802)28:2&lt;199::AID-SPE150&gt;3.0.CO;2-4\"\n     onclick=\"log_download('kelly-marriott-sndergaard-stuckey-apracticalobjectorientedanalysisengineforconstraintlogicprograms-1998', 'http://doi.org/10.1002/(SICI)1097-024X(199802)28:2&lt;199::AID-SPE150&gt;3.0.CO;2-4', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kelly-marriott-sndergaard-stuckey-apracticalobjectorientedanalysisengineforconstraintlogicprograms-1998\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kelly-marriott-sndergaard-stuckey-apracticalobjectorientedanalysisengineforconstraintlogicprograms-1998')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Kel-Mar-Son-Stu_SPE98,\n  author    = {Andrew D. Kelly and \n\t\tKim Marriott and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Practical Object-Oriented Analysis Engine for Constraint\n                Logic Programs},\n  journal   = {Software---Practice and Experience},\n  volume    = {28},\n  number    = {2},\n  pages     = {199--224},\n  year      = {1998},\n  doi       = {10.1002/(SICI)1097-024X(199802)28:2&lt;199::AID-SPE150&gt;3.0.CO;2-4},\n  abstract  = {The incorporation of global program analysis into recent \n\t\tcompilers for constraint logic programming (CLP) languages has \n\t\tgreatly improved the efficiency of these new languages. We \n\t\tpresent a global analyzer based on abstract interpretation.\n\t\tUnlike traditional optimizers, whose designs tend to be ad hoc,\n\t\tthe analyzer has been designed with maxiaml flexibility in\n\t\tmind. The analyzer is incremental, allowing substantial program\n\t\ttransformations by a compiler without requiring redundant\n\t\tre-computation of analysis data. The anayser is also\n\t\tgeneric in that it can perform a large number of different\n\t\tprogram analyses. Furthermore, the analyzer has an\n\t\tobject-oriented design, enabling it to be adapted to different\n\t\tapplications and allowing it to be used with various CLP \n\t\tlanguages with simple modifications. As an example of this \n\t\tgenerality, we sketch the use of the analyzer in two different\n\t\tapplications involving two different CLP languages: an \n\t\toptimizing compiler for CLP(${\\cal R}$) programs and an \n\t\tapplication for detecting occur-check problems in Prolog \n\t\tprograms.},\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The incorporation of global program analysis into recent compilers for constraint logic programming (CLP) languages has greatly improved the efficiency of these new languages. We present a global analyzer based on abstract interpretation. Unlike traditional optimizers, whose designs tend to be ad hoc, the analyzer has been designed with maxiaml flexibility in mind. The analyzer is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The anayser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyzer has an object-oriented design, enabling it to be adapted to different applications and allowing it to be used with various CLP languages with simple modifications. As an example of this generality, we sketch the use of the analyzer in two different applications involving two different CLP languages: an optimizing compiler for CLP(${a̧l R}$) programs and an application for detecting occur-check problems in Prolog programs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1997\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1997')\"\n      onkeypress=\"toggleGroup('group_1997')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1997</span>\n      <span class=\"bibbase_group_count\">\n        \n        (3)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"bailey-crnogorac-ramamohanarao-sndergaard-abstractinterpretationofactiverulesanditsuseinterminationanalysis-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Abstract Interpretation of Active Rules and Its Use in Termination Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Bailey, J.; Crnogorac, L.; Ramamohanarao, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Afrati, F.;  and Kolaitis, P., editor(s), <i>Database Theory—ICDT'97</i>, volume 1186, of <i>Lecture Notes in Computer Science</i>, pages 188–202,  1997. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-62222-5_45\"\n     onclick=\"log_download('bailey-crnogorac-ramamohanarao-sndergaard-abstractinterpretationofactiverulesanditsuseinterminationanalysis-1997', 'http://doi.org/10.1007/3-540-62222-5_45', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/bailey-crnogorac-ramamohanarao-sndergaard-abstractinterpretationofactiverulesanditsuseinterminationanalysis-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('bailey-crnogorac-ramamohanarao-sndergaard-abstractinterpretationofactiverulesanditsuseinterminationanalysis-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Bai-Crn-Ram-Son_ICDT97,\n  author    = {James Bailey and \n\t\tLobel Crnogorac and \n\t\tKotagiri Ramamohanarao and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Abstract Interpretation of Active Rules and Its Use in\n\t\tTermination Analysis},\n  editor    = {F. Afrati and P. Kolaitis},\n  booktitle = {Database Theory---ICDT&#x27;97},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1186},\n  pages     = {188--202},\n  publisher = {Springer},\n  year      = {1997},\n  doi       = {10.1007/3-540-62222-5_45},\n  abstract  = {The behaviour of rules in an active database system can be\n\t\tdifficult to predict, and much work has been devoted to the\n\t\tdevelopment of automatic support for reasoning about properties\n\t\tsuch as confluence and termination. We show how abstract \n\t\tinterpretation can provide a generic framework for analysis of\n\t\tactive rules. Abstract interpretation is a well-understood, \n\t\tsemantics-based method for static analysis. Its advantage, \n\t\tapart from generality, lies in the separation of concerns: \n\t\tOnce the underlying semantics has been captured formally, a \n\t\tvariety of analyses can be derived, almost for free, as \n\t\t\\emph{approximations} to the semantics. Moreover, powerful \n\t\tgeneral theorems enable simple proofs of global correctness \n\t\tand uniform termination of specific analyses. We outline these\n\t\tideas and present, as an example application, a new method for \n\t\ttermination analysis. In terms of precision, the method \n\t\tcompares favourably with previous solutions to the problem.\n\t\tThis is because the method investigates the flow of data \n\t\trather than just the syntax of conditions and actions.},\n  keywords  = {Termination analysis, Abstract interpretation, Active databases},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The behaviour of rules in an active database system can be difficult to predict, and much work has been devoted to the development of automatic support for reasoning about properties such as confluence and termination. We show how abstract interpretation can provide a generic framework for analysis of active rules. Abstract interpretation is a well-understood, semantics-based method for static analysis. Its advantage, apart from generality, lies in the separation of concerns: Once the underlying semantics has been captured formally, a variety of analyses can be derived, almost for free, as \\emphapproximations to the semantics. Moreover, powerful general theorems enable simple proofs of global correctness and uniform termination of specific analyses. We outline these ideas and present, as an example application, a new method for termination analysis. In terms of precision, the method compares favourably with previous solutions to the problem. This is because the method investigates the flow of data rather than just the syntax of conditions and actions.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kelly-marriott-sndergaard-stuckey-agenericobjectorientedincrementalanalyserforconstraintlogicprograms-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Generic Object-Oriented Incremental Analyser for Constraint Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kelly, A. D.; Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Kotagiri, R.;  and Zobel, J., editor(s), <i>Proceedings of the 20th Australasian Computer Science Conference</i>, volume 19, of <i>Australian Computer Science Communications</i>, pages 92–101,  1997. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kelly-marriott-sndergaard-stuckey-agenericobjectorientedincrementalanalyserforconstraintlogicprograms-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kelly-marriott-sndergaard-stuckey-agenericobjectorientedincrementalanalyserforconstraintlogicprograms-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Kel-Mar-Son-Stu_ACSC97,\n  author    = {Andrew D. Kelly and \n\t\tKim Marriott and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {A Generic Object-Oriented Incremental Analyser for Constraint\n             \tLogic Programs},\n  editor    = {R. Kotagiri and J. Zobel},\n  booktitle = {Proceedings of the 20th Australasian Computer Science Conference},\n  series    = {Australian Computer Science Communications},\n  volume    = {19},\n  number    = {1},\n  pages     = {92--101},\n  year      = {1997},\n  abstract  = {The incorporation of global program analysis into compilers \n\t\tfor constraint logic programming (CLP) languages has greatly\n\t\timproved the efficiency of these new languages. We present\n\t\ta global analyser based on abstract interpretation.  The \n\t\tanalyser is incremental, allowing substantial program \n\t\ttransformations by a compiler without requiring redundant\n\t\tre-computation of analysis data. The anayser is also\n\t\tgeneric in that it can perform a large number of different\n\t\tprogram analyses. Furthermore, the analyser has an \n\t\tobject-oriented design, enabling it to be easily adapted to\n\t\tdifferent applications and allowing it to be used with various\n\t\tCLP languages. As an example of this generality, we outline \n\t\tthe analyser&#x27;s role in two different applications each for a\n\t\tdifferent CLP language: an optimizing compiler for CLP(R) \n\t\tprograms and an application for detecting occur-check problems\n\t\tin Prolog programs.},\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Prolog, Static analysis, Program transformation, Compilation, Unification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The incorporation of global program analysis into compilers for constraint logic programming (CLP) languages has greatly improved the efficiency of these new languages. We present a global analyser based on abstract interpretation. The analyser is incremental, allowing substantial program transformations by a compiler without requiring redundant re-computation of analysis data. The anayser is also generic in that it can perform a large number of different program analyses. Furthermore, the analyser has an object-oriented design, enabling it to be easily adapted to different applications and allowing it to be used with various CLP languages. As an example of this generality, we outline the analyser's role in two different applications each for a different CLP language: an optimizing compiler for CLP(R) programs and an application for detecting occur-check problems in Prolog programs.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"speirs-somogyi-sndergaard-terminationanalysisformercury-1997\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Termination Analysis for Mercury.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Speirs, C.; Somogyi, Z.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Van Hentenryck, P., editor(s), <i>Static Analysis: Proceedings of the Fourth International Symposium</i>, volume 1302, of <i>Lecture Notes in Computer Science</i>, pages 157–171,  1997. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/bfb0032740\"\n     onclick=\"log_download('speirs-somogyi-sndergaard-terminationanalysisformercury-1997', 'http://doi.org/10.1007/bfb0032740', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/speirs-somogyi-sndergaard-terminationanalysisformercury-1997\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('speirs-somogyi-sndergaard-terminationanalysisformercury-1997')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Spe-Som-Son_SAS97,\n  author    = {Chris Speirs and \n\t\tZoltan Somogyi and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Termination Analysis for {Mercury}},\n  editor    = {P. {Van Hentenryck}},\n  booktitle = {Static Analysis: \n\t\tProceedings of the Fourth International Symposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1302},\n  pages     = {157--171},\n  publisher = {Springer},\n  year      = {1997},\n  doi       = {10.1007/bfb0032740},\n  abstract  = {Since the late eighties, much progress has been made in the \n\t\ttheory of termination analysis for logic programs. However, the\n\t\tpractical significance of much of this work is hard to judge, \n\t\tsince experimental evaluations rarely get published. Here we \n\t\tdescribe and evaluate a termination analyzer for Mercury, a \n\t\tstrongly typed and moded logic-functional programming language.\n\t\tMercury&#x27;s high degree of referential transparency and the \n\t\tguaranteed availability of reliable mode information simplify \n\t\ttermination analysis. Our analyzer uses a variant of a method \n\t\tdeveloped by Pl{\\&quot;u}mer. It deals with full Mercury, including \n\t\tmodules and I/O. In spite of these obstacles, it produces \n\t\tstate-of-the-art termination information, while having a \n\t\tnegligible impact on the running time of the compiler of which\n\t\tit is part, even for large programs.},\n  keywords  = {Logic programming, Mercury, Termination analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Since the late eighties, much progress has been made in the theory of termination analysis for logic programs. However, the practical significance of much of this work is hard to judge, since experimental evaluations rarely get published. Here we describe and evaluate a termination analyzer for Mercury, a strongly typed and moded logic-functional programming language. Mercury's high degree of referential transparency and the guaranteed availability of reliable mode information simplify termination analysis. Our analyzer uses a variant of a method developed by Plümer. It deals with full Mercury, including modules and I/O. In spite of these obstacles, it produces state-of-the-art termination information, while having a negligible impact on the running time of the compiler of which it is part, even for large programs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1996\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1996')\"\n      onkeypress=\"toggleGroup('group_1996')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1996</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"crnogorac-kelly-sndergaard-acomparisonofthreeoccurcheckanalysers-1996\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Comparison of Three Occur-Check Analysers.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Crnogorac, L.; Kelly, A.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Cousot, R.;  and Schmidt, D. A., editor(s), <i>Static Analysis: Proceedings of the Third International Symposium</i>, volume 1145, of <i>Lecture Notes in Computer Science</i>, pages 159–173,  1996. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-61739-6_40\"\n     onclick=\"log_download('crnogorac-kelly-sndergaard-acomparisonofthreeoccurcheckanalysers-1996', 'http://doi.org/10.1007/3-540-61739-6_40', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/crnogorac-kelly-sndergaard-acomparisonofthreeoccurcheckanalysers-1996\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('crnogorac-kelly-sndergaard-acomparisonofthreeoccurcheckanalysers-1996')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Crn-Kel-Son_SAS96,\n  author    = {Lobel Crnogorac and \n\t\tAndrew Kelly and \n\t\tHarald S{\\o}ndergaard},\n  title     = {A Comparison of Three Occur-Check Analysers},\n  editor    = {R. Cousot and D. A. Schmidt},\n  booktitle = {Static Analysis: Proceedings of the Third International \n\t\tSymposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1145},\n  pages     = {159--173},\n  publisher = {Springer},\n  year      = {1996},\n  doi       = {10.1007/3-540-61739-6_40},\n  abstract  = {A well known problem with many Prolog interpreters and compilers\n\t\tis the lack of occur-check in the implementation of the \n\t\tunification algorithm. This means that such systems are unsound\n\t\twith respect to first-order predicate logic. Static analysis \n\t\toffers an appealing approach to the problem of occur-check \n\t\treduction, that is, the safe omission of occur-checks in \n\t\tunification. We compare, for the first time, three static \n\t\tmethods that have been suggested for occur-check reduction, \n\t\ttwo based on assigning &#x60;&#x60;modes&#x27;&#x27; to programs and one which \n\t\tuses abstract interpretation. In each case, the analysis or \n\t\tsome essential part of it had not been implemented so far.\n\t\tOf the mode-based methods, one is due to Chadha and Plaisted\n\t\tand the other is due to Apt and Pellegrini. The method using \n\t\tabstract interpretation is based on earlier work by Plaisted, \n\t\tS{\\o}ndergaard and others who have developed groundness and \n\t\tsharing analyses for logic programs. The conclusion is that a \n\t\ttruly global analysis based on abstract interpretation leads \n\t\tto markedly higher precision and hence fewer occur-checks at \n\t\trun-time. Given the potential run-time speedups, a precise \n\t\tanalysis would be well worth the extra time.},\n  keywords  = {Abstract interpretation, Groundness analysis, Sharing analysis, Unification, Prolog, Compilation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A well known problem with many Prolog interpreters and compilers is the lack of occur-check in the implementation of the unification algorithm. This means that such systems are unsound with respect to first-order predicate logic. Static analysis offers an appealing approach to the problem of occur-check reduction, that is, the safe omission of occur-checks in unification. We compare, for the first time, three static methods that have been suggested for occur-check reduction, two based on assigning ``modes'' to programs and one which uses abstract interpretation. In each case, the analysis or some essential part of it had not been implemented so far. Of the mode-based methods, one is due to Chadha and Plaisted and the other is due to Apt and Pellegrini. The method using abstract interpretation is based on earlier work by Plaisted, Søndergaard and others who have developed groundness and sharing analyses for logic programs. The conclusion is that a truly global analysis based on abstract interpretation leads to markedly higher precision and hence fewer occur-checks at run-time. Given the potential run-time speedups, a precise analysis would be well worth the extra time.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"johnston-moffat-sndergaard-stuckey-lowcontactlearninginafirstyearprogrammingcourse-1996\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Low-Contact Learning in a First Year Programming Course.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Johnston, R.; Moffat, A.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Rosenberg, J., editor(s), <i>Proceedings of the First Australasian Conference on Computer Science Education</i>, pages 19–26,  1996. ACM Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/369585.369589\"\n     onclick=\"log_download('johnston-moffat-sndergaard-stuckey-lowcontactlearninginafirstyearprogrammingcourse-1996', 'http://doi.org/10.1145/369585.369589', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/johnston-moffat-sndergaard-stuckey-lowcontactlearninginafirstyearprogrammingcourse-1996\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('johnston-moffat-sndergaard-stuckey-lowcontactlearninginafirstyearprogrammingcourse-1996')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Joh-Mof-Son-Stu_ACSE96,\n  author    = {Roy Johnston and \n\t\tAlistair Moffat and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title\t    = {Low-Contact Learning in a First Year Programming Course},\n  editor    = {J. Rosenberg},\n  booktitle = {Proceedings of the First Australasian Conference on \n\t\tComputer Science Education},\n  pages     = {19--26},\n  publisher = {ACM Press},\n  year      = {1996},\n  location  = {Sydney, Australia},\n  doi       = {10.1145/369585.369589},\n  abstract  = {Very large class sizes for introductory programming subjects pose\n\t\ta variety of problems, logistic and pedagogic.\n\t\tIn response to these problems, we are experimenting with \n\t\tlow-contact streams in a class of 750 first year students.\n\t\tMotivated and disciplined students are offered the alternative \n\t\tof fewer lectures and tutorials, that is, less direct contact, \n\t\tin return for more (compulsory) homework and increased \n\t\tfeed-back, that is, more indirect contact.\n\t\tWith a home computer and a link to the University, such \n\t\tstudents can take the subject with more flexible timetabling.\n\t\tWe provide material to support the higher degree of self-study \n\t\tand tools for students to monitor their own progress.\n\t\tThis paper describes how the low-contact streams are organised \n\t\tand discusses the advantages and disadvantages of the approach.\n\t\tA thorough evaluation is not possible yet, but our initial \n\t\timpression is that both traditional and self-paced students \n\t\tbenefit---the traditional students are better catered for in \n\t\ta course that is pitched at a slightly lower and less \n\t\tchallenging level, and the self-paced students respond to the \n\t\tchallenge and extend themselves in a manner that might not \n\t\toccur in a large lecture group.},\n  keywords  = {Education},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Very large class sizes for introductory programming subjects pose a variety of problems, logistic and pedagogic. In response to these problems, we are experimenting with low-contact streams in a class of 750 first year students. Motivated and disciplined students are offered the alternative of fewer lectures and tutorials, that is, less direct contact, in return for more (compulsory) homework and increased feed-back, that is, more indirect contact. With a home computer and a link to the University, such students can take the subject with more flexible timetabling. We provide material to support the higher degree of self-study and tools for students to monitor their own progress. This paper describes how the low-contact streams are organised and discusses the advantages and disadvantages of the approach. A thorough evaluation is not possible yet, but our initial impression is that both traditional and self-paced students benefit—the traditional students are better catered for in a course that is pitched at a slightly lower and less challenging level, and the self-paced students respond to the challenge and extend themselves in a manner that might not occur in a large lecture group.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kelly-marriott-sndergaard-stuckey-twoapplicationsofanincrementalanalysisengineforconstraintlogicprogramssystemdescription-1996\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (System Description).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kelly, A. D.; Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  In Cousot, R.;  and Schmidt, D. A., editor(s), <i>Static Analysis: Proceedings of the Third International Symposium</i>, volume 1145, of <i>Lecture Notes in Computer Science</i>, pages 385–386,  1996. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-61739-6_55\"\n     onclick=\"log_download('kelly-marriott-sndergaard-stuckey-twoapplicationsofanincrementalanalysisengineforconstraintlogicprogramssystemdescription-1996', 'http://doi.org/10.1007/3-540-61739-6_55', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kelly-marriott-sndergaard-stuckey-twoapplicationsofanincrementalanalysisengineforconstraintlogicprogramssystemdescription-1996\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kelly-marriott-sndergaard-stuckey-twoapplicationsofanincrementalanalysisengineforconstraintlogicprogramssystemdescription-1996')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Kel-Mar-Son-Stu_SAS96,\n  author    = {Andrew D. Kelly and \n\t\tKim Marriott and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title     = {Two Applications of an Incremental Analysis Engine for\n                (Constraint) Logic Programs (System Description)},\n  editor    = {R. Cousot and D. A. Schmidt},\n  booktitle = {Static Analysis: Proceedings of the Third International \n\t\tSymposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1145},\n  pages     = {385--386},\n  publisher = {Springer},\n  year      = {1996},\n  doi       = {10.1007/3-540-61739-6_55},\n  keywords  = {Constraint programming, Logic programming, Prolog, Static analysis, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-immediatefixpointsandtheiruseingroundnessanalysis-1996\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Immediate Fixpoints and Their Use in Groundness Analysis.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Chandru, V.;  and Vinay, V., editor(s), <i>Foundations of Software Technology and Theoretical Computer Science</i>, volume 1180, of <i>Lecture Notes in Computer Science</i>, pages 359–370,  1996. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-62034-6_63\"\n     onclick=\"log_download('sndergaard-immediatefixpointsandtheiruseingroundnessanalysis-1996', 'http://doi.org/10.1007/3-540-62034-6_63', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-immediatefixpointsandtheiruseingroundnessanalysis-1996\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-immediatefixpointsandtheiruseingroundnessanalysis-1996')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Son_FSTTCS96,\n  author    = {Harald S{\\o}ndergaard},\n  title     = {Immediate Fixpoints and Their Use in Groundness Analysis},\n  editor    = {V. Chandru and V. Vinay},\n  booktitle = {Foundations of Software Technology and \n\t\tTheoretical Computer Science},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {1180},\n  pages     = {359--370},\n  publisher = {Springer},\n  year      = {1996},\n  doi       = {10.1007/3-540-62034-6_63},\n  abstract  = {A theorem by Schr{\\&quot;o}der says that for a certain natural \n\t\tclass of functions $F : B \\rightarrow B$ defined on a Boolean \n\t\tlattice $B$, $F(x) = F(F(F(x)))$ for all $x \\in B$.\n\t\tAn immediate corollary is that if such a function is monotonic \n\t\tthen it is also idempotent, that is, $F(x) = F(F(x))$.\n\t\tWe show how this corollary can be extended to recognize cases\n\t\twhere recursive definitions can immediately be replaced by an \n\t\tequivalent closed form, that is, they can be solved without \n\t\tKleene iteration. Our result applies more generally to \n\t\tdistributive lattices. It has applications for example in the \n\t\tabstract interpretation of declarative programs and deductive \n\t\tdatabases. We exemplify this by showing how to accelerate \n\t\tsimple cases of strictness analysis for first-order functional \n\t\tprograms and, perhaps more successfully, groundness analysis \n\t\tfor logic programs.},\n  keywords  = {Fixed points, Logic programming, Groundness analysis, Lattice theory},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A theorem by Schröder says that for a certain natural class of functions $F : B → B$ defined on a Boolean lattice $B$, $F(x) = F(F(F(x)))$ for all $x ∈ B$. An immediate corollary is that if such a function is monotonic then it is also idempotent, that is, $F(x) = F(F(x))$. We show how this corollary can be extended to recognize cases where recursive definitions can immediately be replaced by an equivalent closed form, that is, they can be solved without Kleene iteration. Our result applies more generally to distributive lattices. It has applications for example in the abstract interpretation of declarative programs and deductive databases. We exemplify this by showing how to accelerate simple cases of strictness analysis for first-order functional programs and, perhaps more successfully, groundness analysis for logic programs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1995\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1995')\"\n      onkeypress=\"toggleGroup('group_1995')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1995</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"garcadelabanda-marriott-sndergaard-stuckey-improvedanalysisoflogicprogramsusingadifferentialapproach-1995\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Improved Analysis of Logic Programs Using a Differential Approach.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Garcı́a de la Banda, M.; Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Stuckey, P. J.\n</span>\n\n  \n\n</span>\n\n  Technical Report 95/15, Department of Computer Science, The University of Melbourne,  1995.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/garcadelabanda-marriott-sndergaard-stuckey-improvedanalysisoflogicprogramsusingadifferentialapproach-1995\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('garcadelabanda-marriott-sndergaard-stuckey-improvedanalysisoflogicprogramsusingadifferentialapproach-1995')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Techreport{Garcia_TR95,\n  author      = {Maria {Garc{\\&#x27;\\i}a de la Banda} and \n\t\tKim Marriott and\n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey},\n  title       = {Improved Analysis of Logic Programs Using a Differential\n\t\tApproach},\n  number      = {95/15},\n  institution = {Department of Computer Science, The University of Melbourne},\n  year        = {1995},\n  abstract    = {Abstract interpretation based program analysis has proven\n\t\tvery useful in compilation of constraint and logic programming\n\t\tlanguages. Unfortunately, existing theoretical frameworks are \n\t\tinherently imprecise. This is because of the way the frameworks\n\t\thandle call and return from an atom evaluation---in effect the \n\t\tsame information may be added twice, leading to a loss of \n\t\tprecision in many description domains. For this reason some \n\t\timplementations use seemingly \\emph{ad hoc} tricks. Here we \n\t\tformalize these tricks and suggest three methods for overcoming\n\t\tthis loss of precision. Experimental and theoretical results \n\t\tindicate that use of these methods leads to more accurate and \n\t\tfaster analyses for little extra implementation effort.},\n  keywords  = {Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstract interpretation based program analysis has proven very useful in compilation of constraint and logic programming languages. Unfortunately, existing theoretical frameworks are inherently imprecise. This is because of the way the frameworks handle call and return from an atom evaluation—in effect the same information may be added twice, leading to a loss of precision in many description domains. For this reason some implementations use seemingly \\emphad hoc tricks. Here we formalize these tricks and suggest three methods for overcoming this loss of precision. Experimental and theoretical results indicate that use of these methods leads to more accurate and faster analyses for little extra implementation effort.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"kelly-macdonald-marriott-sndergaard-stuckey-yap-anoptimizingcompilerforclpr-1995\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Optimizing Compiler for CLP(R).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Kelly, A. D.; Macdonald, A.; Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Stuckey, P. J.;  and Yap, R. H. C.\n</span>\n\n  \n\n</span>\n\n  In Montanari, U.;  and Rossi, F., editor(s), <i>Principles and Practice of Constraint Programming—CP'95</i>, volume 976, of <i>Lecture Notes in Computer Science</i>, pages 222–239,  1995. Springer\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-60299-2_14\"\n     onclick=\"log_download('kelly-macdonald-marriott-sndergaard-stuckey-yap-anoptimizingcompilerforclpr-1995', 'http://doi.org/10.1007/3-540-60299-2_14', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/kelly-macdonald-marriott-sndergaard-stuckey-yap-anoptimizingcompilerforclpr-1995\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('kelly-macdonald-marriott-sndergaard-stuckey-yap-anoptimizingcompilerforclpr-1995')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Kel-Mac-Mar-Son-Stu-Yap_CP95,\n  author    = {Andrew D. Kelly and \n\t\tAndrew Macdonald and \n\t\tKim Marriott and\n            \tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey and \n\t\tRoland H. C. Yap},\n  title     = {An Optimizing Compiler for {CLP(R)}},\n  editor    = {U. Montanari and F. Rossi},\n  booktitle = {Principles and Practice of Constraint Programming---CP&#x27;95},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {976},\n  pages     = {222--239},\n  publisher = {Springer},\n  year      = {1995},\n  doi       = {10.1007/3-540-60299-2_14},\n  abstract  = {The considerable expressive power and flexibility gained by \n\t\tcombining constraint programming with logic programming\n\t\tis not without cost. Implementations of constraint logic \n\t\tprogramming (CLP) languages must include expensive constraint \n\t\tsolving algorithms tailored to specific domains, such as trees,\n\t\tBooleans, or real numbers. The performance of many current CLP\n\t\tcompilers and interpreters does not encourage the widespread \n\t\tuse of CLP. We outline an optimizing compiler for \n\t\tCLP(${\\cal R}$), a CLP language which extends Prolog by \n\t\tallowing linear arithmetic constraints. The compiler uses \n\t\tsophisticated global analyses to determine the applicability of\n\t\tdifferent program transformations. Two important components of \n\t\tthe compiler, the \\emph{analyzer} and the \\emph{optimizer}, \n\t\twork in continual interaction in order to apply \n\t\tsemantics-preserving transformations to the source program.\n\t\tA large suite of transformations are planned. Currently the \n\t\tcompiler applies three powerful transformations, namely \n\t\t&#x60;&#x60;solver bypass&#x27;&#x27;, &#x60;&#x60;dead variable elimination&#x27;&#x27; and\n\t\t&#x60;&#x60;nofail constraint detection&#x27;&#x27;. We explain these optimizations\n\t\tand their place in the overall compiler design and show how \n\t\tthey lead to performance improvements on a set of benchmark \n\t\tprograms.},\n  keywords  = {Constraint programming, Logic programming, Static analysis, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The considerable expressive power and flexibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include expensive constraint solving algorithms tailored to specific domains, such as trees, Booleans, or real numbers. The performance of many current CLP compilers and interpreters does not encourage the widespread use of CLP. We outline an optimizing compiler for CLP(${a̧l R}$), a CLP language which extends Prolog by allowing linear arithmetic constraints. The compiler uses sophisticated global analyses to determine the applicability of different program transformations. Two important components of the compiler, the \\emphanalyzer and the \\emphoptimizer, work in continual interaction in order to apply semantics-preserving transformations to the source program. A large suite of transformations are planned. Currently the compiler applies three powerful transformations, namely ``solver bypass'', ``dead variable elimination'' and ``nofail constraint detection''. We explain these optimizations and their place in the overall compiler design and show how they lead to performance improvements on a set of benchmark programs.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1994\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1994')\"\n      onkeypress=\"toggleGroup('group_1994')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1994</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"armstrong-marriott-schachte-sndergaard-booleanfunctionsfordependencyanalysisalgebraicpropertiesandefficientrepresentation-1994\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Armstrong, T.; Marriott, K.; Schachte, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Le Charlier, B., editor(s), <i>Static Analysis: Proceedings of the First International Symposium</i>, volume 864, of <i>Lecture Notes in Computer Science</i>, pages 266–280,  1994. Springer-Verlag\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-58485-4_46\"\n     onclick=\"log_download('armstrong-marriott-schachte-sndergaard-booleanfunctionsfordependencyanalysisalgebraicpropertiesandefficientrepresentation-1994', 'http://doi.org/10.1007/3-540-58485-4_46', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/armstrong-marriott-schachte-sndergaard-booleanfunctionsfordependencyanalysisalgebraicpropertiesandefficientrepresentation-1994\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('armstrong-marriott-schachte-sndergaard-booleanfunctionsfordependencyanalysisalgebraicpropertiesandefficientrepresentation-1994')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Arm-Mar-Sch-Son_SAS94,\n  author    = {Tania Armstrong and \n\t\tKim Marriott and \n\t\tPeter Schachte and \n\t\tHarald S{\\o}ndergaard},\n  title     = {{Boolean} Functions for Dependency Analysis:\n\t\tAlgebraic Properties and Efficient Representation},\n  editor    = {B. {Le Charlier}},\n  booktitle = {Static Analysis: Proceedings of the First International \n\t\tSymposium},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {864},\n  pages     = {266--280},\n  publisher = {Springer-Verlag},\n  year      = {1994},\n  doi       = {10.1007/3-540-58485-4_46},\n  abstract  = {Many analyses for logic programming languages use Boolean \n\t\tfunctions to express dependencies between variables or argument\n\t\tpositions. Examples include groundness analysis, arguably the \n\t\tmost important analysis for logic programs, finiteness analysis \n\t      \tand functional dependency analysis. We identify two classes of \n\t\tBoolean functions that have been used: positive and definite \n\t\tfunctions, and we systematically investigate these classes and \n\t\ttheir efficient implementation for dependency analyses. We \n\t\tprovide syntactic characterizations and study their algebraic \n\t\tproperties. In particular, we show that both classes are closed\n\t\tunder existential quantification. We investigate representations\n\t\tfor these classes based on: reduced ordered binary decision \n\t\tdiagrams (ROBDDs), disjunctive normal form, conjunctive normal \n\t\tform, Blake canonical form, dual Blake canonical form, and a \n\t\tform specific to definite functions. We give an  empirical \n\t\tcomparison of these different representations for groundness \n\t\tanalysis.},\n  keywords  = {Boolean logic, Abstract domains, Abstract interpretation, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Many analyses for logic programming languages use Boolean functions to express dependencies between variables or argument positions. Examples include groundness analysis, arguably the most important analysis for logic programs, finiteness analysis and functional dependency analysis. We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. We provide syntactic characterizations and study their algebraic properties. In particular, we show that both classes are closed under existential quantification. We investigate representations for these classes based on: reduced ordered binary decision diagrams (ROBDDs), disjunctive normal form, conjunctive normal form, Blake canonical form, dual Blake canonical form, and a form specific to definite functions. We give an empirical comparison of these different representations for groundness analysis.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-jones-denotationalabstractinterpretationoflogicprograms-1994\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Denotational Abstract Interpretation of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Jones, N. D.\n</span>\n\n  \n\n</span>\n\n  <i>ACM Transactions on Programming Languages and Systems</i>, 16(3): 607–648.  1994.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/177492.177650\"\n     onclick=\"log_download('marriott-sndergaard-jones-denotationalabstractinterpretationoflogicprograms-1994', 'http://doi.org/10.1145/177492.177650', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-jones-denotationalabstractinterpretationoflogicprograms-1994\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-jones-denotationalabstractinterpretationoflogicprograms-1994')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Mar-Son-Jon_TOPLAS94,\n  author    = {Kim Marriott and\n\t\tHarald S{\\o}ndergaard and \n\t\tNeil D. Jones},\n  title     = {Denotational Abstract Interpretation of Logic Programs},\n  journal   = {ACM Transactions on Programming Languages and Systems},\n  volume    = {16},\n  number    = {3},\n  pages     = {607--648},\n  year      = {1994},\n  doi       = {10.1145/177492.177650},\n  abstract  = {Logic programming languages are based on a principle of \n\t\tseparation of &#x60;&#x60;logic&#x27;&#x27; and &#x60;&#x60;control.&#x27;&#x27; This means that they\n\t\tcan be given simple model-theoretic semantics without regard to\n\t\tany particular execution mechanism (or proof procedure, viewing\n\t\texecution as theorem proving). While the separation is desirable\n\t\tfrom a semantical point of view, it does, however, make sound, \n\t\tefficient implementation of logic programming languages \n\t\tdifficult. The lack of &#x60;&#x60;control information&#x27;&#x27; in programs \n\t\tcalls for complex dataflow analysis techniques to guide \n\t\texecution. Since dataflow analysis furthermore finds extensive \n\t\tuse in error-finding and transformation tools, there is a need \n\t\tfor a simple and powerful theory of dataflow analysis of logic \n\t\tprograms. The present paper offers such a theory, based on \n\t\tF. Nielson&#x27;s extension of P. and R. Cousot&#x27;s abstract \n\t\tinterpretation. We present a denotational definition of the \n\t\tsemantics of definite logic programs. This definition is of \n\t\tinterest in its own right because of its compactness.\n\t\tStepwise we develop the definition into a generic dataflow \n\t\tanalysis which encompasses a large class of dataflow analyses\n\t\tbased on the SLD execution model. We exemplify one instance of\n\t\tthe definition by developing a provably correct groundness \n\t\tanalysis to predict how variables may be bound to ground terms \n\t\tduring execution. We also discuss implementation issues and \n\t\trelated work.},\n  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Logic programming languages are based on a principle of separation of ``logic'' and ``control.'' This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism (or proof procedure, viewing execution as theorem proving). While the separation is desirable from a semantical point of view, it does, however, make sound, efficient implementation of logic programming languages difficult. The lack of ``control information'' in programs calls for complex dataflow analysis techniques to guide execution. Since dataflow analysis furthermore finds extensive use in error-finding and transformation tools, there is a need for a simple and powerful theory of dataflow analysis of logic programs. The present paper offers such a theory, based on F. Nielson's extension of P. and R. Cousot's abstract interpretation. We present a denotational definition of the semantics of definite logic programs. This definition is of interest in its own right because of its compactness. Stepwise we develop the definition into a generic dataflow analysis which encompasses a large class of dataflow analyses based on the SLD execution model. We exemplify one instance of the definition by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution. We also discuss implementation issues and related work.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-stuckey-yap-optimizingcompilationforclpr-1994\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Optimizing Compilation for CLP(R).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>; Stuckey, P. J.;  and Yap, R.\n</span>\n\n  \n\n</span>\n\n  In Gupta, G., editor(s), <i>Proceedings of the 17th Australian Computer Science Conference</i>, volume 16, of <i>Australian Computer Science Communications</i>, pages 551–560,  1994. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-stuckey-yap-optimizingcompilationforclpr-1994\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-stuckey-yap-optimizingcompilationforclpr-1994')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son-Stu-Yap_ACSC94,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard and \n\t\tPeter J. Stuckey and \n\t\tRoland Yap},\n  title\t    = {Optimizing Compilation for {CLP(R)}},\n  editor    = {G. Gupta},\n  booktitle = {Proceedings of the 17th Australian Computer Science Conference},\n  series    = {Australian Computer Science Communications},\n  volume    = {16},\n  number    = {1},\n  pages     = {551--560},\n  year\t    = {1994},\n  abstract  = {Constraint Logic Programming (CLP) is a recent innovation in\n\t\tprogramming language design. CLP languages extend logic\n\t\tprogramming by allowing constraints from different domains\n\t\tsuch as real numbers or Boolean functions. This gives\n\t\tconsiderable expressive power and flexibility and CLP\n\t\tprograms have proven to be a high-level programming\n\t\tparadigm for applications based on interactive mathematical\n\t\tmodelling. These advantages, however, are not without cost.\n\t\tImplementations of CLP languages must include expensive\n\t\tconstraint solving algorithms tailored to the specific\n\t\tdomains. Indeed, performance of the current generation of\n\t\tCLP compilers and interpreters is one of the main obstacles\n\t\tto the widespread use of CLP. Here we outline the design\n\t\tof a highly optimizing compiler for CLP($\\Re$), a CLP\n\t\tlanguage which extends Prolog by allowing linear arithmetic\n\t\tconstraints. This compiler is intended to overcome the\n\t\tefficiency problems of the current implementation\n\t\ttechnology. The main innovation in the compiler is a\n\t\tcomprehensive suite of program optimizations and associated\n\t\tglobal analyses which determine applicability of each\n\t\toptimization. We describe these optimizations and report\n\t\tvery promising results from preliminary experiments.},\n  keywords  = {Constraint programming, Logic programming, Compilation, Static analysis},\n}\n\t\t\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Constraint Logic Programming (CLP) is a recent innovation in programming language design. CLP languages extend logic programming by allowing constraints from different domains such as real numbers or Boolean functions. This gives considerable expressive power and flexibility and CLP programs have proven to be a high-level programming paradigm for applications based on interactive mathematical modelling. These advantages, however, are not without cost. Implementations of CLP languages must include expensive constraint solving algorithms tailored to the specific domains. Indeed, performance of the current generation of CLP compilers and interpreters is one of the main obstacles to the widespread use of CLP. Here we outline the design of a highly optimizing compiler for CLP($\\Re$), a CLP language which extends Prolog by allowing linear arithmetic constraints. This compiler is intended to overcome the efficiency problems of the current implementation technology. The main innovation in the compiler is a comprehensive suite of program optimizations and associated global analyses which determine applicability of each optimization. We describe these optimizations and report very promising results from preliminary experiments.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sestoft-sndergaard-pepm94proceedingsoftheacmsigplanworkshoponpartialevaluationandsemanticsbasedprogrammanipulation-1994\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  PEPM '94: Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>,\n  editors.\n  \n</span>\n\n  \n\n</span>\n\n   1994.\n  <span class=\"note\">Technical Report 94/9, Department of Computer Science, The University of Melbourne</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/BF01019002\"\n     onclick=\"log_download('sestoft-sndergaard-pepm94proceedingsoftheacmsigplanworkshoponpartialevaluationandsemanticsbasedprogrammanipulation-1994', 'http://doi.org/10.1007/BF01019002', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sestoft-sndergaard-pepm94proceedingsoftheacmsigplanworkshoponpartialevaluationandsemanticsbasedprogrammanipulation-1994\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sestoft-sndergaard-pepm94proceedingsoftheacmsigplanworkshoponpartialevaluationandsemanticsbasedprogrammanipulation-1994')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Proceedings{Ses-Son_PEPM94,\n  editor    = {Peter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {PEPM &#x27;94: Proceedings of the ACM SIGPLAN Workshop on Partial \n\t\tEvaluation and Semantics-Based Program Manipulation},\n  location  = {Orlando, Florida},\n  year      = {1994},\n  doi       = {10.1007/BF01019002},\n  note\t    = {Technical Report 94/9, Department of Computer Science, \n\t\tThe University of Melbourne},\n  keywords  = {Partial evaluation, Program transformation, Static analysis},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1993\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1993')\"\n      onkeypress=\"toggleGroup('group_1993')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1993</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"baker-sndergaard-definitenessanalysisforclpr-1993\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Definiteness Analysis for CLP(R).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Baker, N.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Gupta, G.; Mohay, G.;  and Topor, R., editor(s), <i>Proceedings of the Sixteenth Australian Computer Science Conference</i>, volume 15, of <i>Australian Computer Science Communications</i>, pages 321–332,  1993. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/baker-sndergaard-definitenessanalysisforclpr-1993\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('baker-sndergaard-definitenessanalysisforclpr-1993')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@inproceedings{Bak-Son_ACSC93,\n  author    = {Naomi Baker and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Definiteness Analysis for {CLP(R)}},\n  editor    = {G. Gupta and G. Mohay and R. Topor},\n  booktitle = {Proceedings of the Sixteenth Australian Computer Science \n\t\tConference},\n  series    = {Australian Computer Science Communications},\n  volume    = {15},\n  number    = {1},\n  pages     = {321--332},\n  year      = {1993},\n  abstract  = {Constraint logic programming (CLP) languages generalise\n\t\tlogic programming languages, amalgamating logic programming\n\t\tand constraint programming.  Combining the best of two\n\t\tworlds, they provide powerful tools for wide classes\n\t\tof problems.  As with logic programming languages, code\n\t\toptimization by compilers is an important issue in the\n\t\timplementation of CLP languages.  A compiler needs\n\t\tsophisticated global information, collected by dataflow\n\t\tanalyses, to generate competitive code.\n\t\tOne kind of useful dataflow information concerns the point\n\t\tat which variables become definite, that is, constrained\n\t\tto take a unique value.  In this paper we present a very\n\t\tprecise dataflow analysis to determine definiteness, and we\n\t\tdiscuss its applications.  By separating the two concerns:\n\t\tcorrectness and implementation techniques, abstract\n\t\tinterpretation enables us to develop a sophisticated\n\t\tdataflow analysis in a straightforward manner, in fact in\n\t\ta framework where the correctness of the analysis is easily\n\t\testablished---a feature which is uncommon when complex\n\t\tanalyses are developed in an ad hoc way.\n\t\tWe use a class of Boolean functions, the positive functions,\n\t\tto represent the definiteness relationship between variables.\n\t\tA Boolean function is interpreted as expressing a relation\n\t\twhich holds not simply at the given point in an evaluation,\n\t\tbut in fact during the rest of the evaluation branch.\n\t\tThe nature of variables in a CLP language makes this\n\t\ttreatment both possible and natural.},\n  keywords  = {Constraint logic programming, Boolean logic, Abstract interpretation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Constraint logic programming (CLP) languages generalise logic programming languages, amalgamating logic programming and constraint programming. Combining the best of two worlds, they provide powerful tools for wide classes of problems. As with logic programming languages, code optimization by compilers is an important issue in the implementation of CLP languages. A compiler needs sophisticated global information, collected by dataflow analyses, to generate competitive code. One kind of useful dataflow information concerns the point at which variables become definite, that is, constrained to take a unique value. In this paper we present a very precise dataflow analysis to determine definiteness, and we discuss its applications. By separating the two concerns: correctness and implementation techniques, abstract interpretation enables us to develop a sophisticated dataflow analysis in a straightforward manner, in fact in a framework where the correctness of the analysis is easily established—a feature which is uncommon when complex analyses are developed in an ad hoc way. We use a class of Boolean functions, the positive functions, to represent the definiteness relationship between variables. A Boolean function is interpreted as expressing a relation which holds not simply at the given point in an evaluation, but in fact during the rest of the evaluation branch. The nature of variables in a CLP language makes this treatment both possible and natural.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-onpropagationbasedanalysisoflogicprograms-1993\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Propagation-Based Analysis of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Michaylov, S.;  and Winsborough, W., editor(s), <i>Proceedings of the ILPS 93 Workshop on Global Compilation, Vancouver, Canada</i>, pages 47–65,  1993. \n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-onpropagationbasedanalysisoflogicprograms-1993\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-onpropagationbasedanalysisoflogicprograms-1993')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_ILPSworkshop93,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {On Propagation-Based Analysis of Logic Programs},\n  editor    = {S. Michaylov and W. Winsborough},\n  booktitle = {Proceedings of the ILPS 93 Workshop on Global Compilation,\n\t\t\tVancouver, Canada},\n  pages     = {47--65},\n  year\t    = {1993},\n  abstract  = {Notions such as &#x60;&#x60;reexecution&#x27;&#x27; and &#x60;&#x60;propagation&#x27;&#x27; have recently\n\t\tattracted attention in dataflow analysis of logic programs. \n\t\tBoth techniques promise more accurate dataflow analysis without \n\t\trequiring more complex description domains. Propagation, \n\t\thowever, has never been given a formal definition. It has \n\t\ttherefore been difficult to discuss properties such as \n\t\tcorrectness, precision, and termination of propagation. \n\t\tWe suggest a definition of propagation. Comparing \n\t\tpropagation-based analysis with the more conventional\n\t\tapproach based on abstract interpretation, we find that \n\t\tpropagation involves a certain inherent loss of precision \n\t\twhen dataflow analyses are based on description domains\n\t\twhich are not &#x60;&#x60;downwards closed&#x27;&#x27; (including mode analysis).\n\t\tIn the archetypical downwards closed case, groundness \n\t\tanalysis, we contrast approaches using Boolean functions as\n\t\tdescriptions with those using propagation or reexecution.},\n  keywords  = {Abstract interpretation, Boolean logic, Logic programming, Mode analysis, Groundness analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Notions such as ``reexecution'' and ``propagation'' have recently attracted attention in dataflow analysis of logic programs. Both techniques promise more accurate dataflow analysis without requiring more complex description domains. Propagation, however, has never been given a formal definition. It has therefore been difficult to discuss properties such as correctness, precision, and termination of propagation. We suggest a definition of propagation. Comparing propagation-based analysis with the more conventional approach based on abstract interpretation, we find that propagation involves a certain inherent loss of precision when dataflow analyses are based on description domains which are not ``downwards closed'' (including mode analysis). In the archetypical downwards closed case, groundness analysis, we contrast approaches using Boolean functions as descriptions with those using propagation or reexecution.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Precise and Efficient Groundness Analysis for Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>ACM Letters on Programming Languages and Systems</i>, 2(1–4): 181–196.  1993.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/176454.176519\"\n     onclick=\"log_download('marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993', 'http://doi.org/10.1145/176454.176519', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-preciseandefficientgroundnessanalysisforlogicprograms-1993')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Mar-Son_LOPLAS93,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Precise and Efficient Groundness Analysis for Logic Programs},\n  journal   = {ACM Letters on Programming Languages and Systems},\n  volume    = {2},\n  number    = {1--4},\n  pages\t    = {181--196},\n  year\t    = {1993},\n  doi       = {10.1145/176454.176519},\n  abstract  = {We show how precise groundness information can be extracted from\n\t\tlogic programs. The idea is to use abstract interpretation with\n\t\tBoolean functions as &#x60;&#x60;approximations&#x27;&#x27; to groundness \n\t\tdependencies between variables. This idea is not new, and \n\t\tdifferent classes of Boolean functions have been used. We argue,\n\t\thowever, that one class, the \\emph{positive} functions, is more \n\t\tsuitable than others. Positive Boolean functions have a certain\n\t\tproperty which we (inspired by A. Langen) call &#x60;&#x60;condensation.&#x27;&#x27;\n\t\tThis property allows for rapid computation of groundness \n\t\tinformation.},\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Boolean logic, Groundness analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as ``approximations'' to groundness dependencies between variables. This idea is not new, and different classes of Boolean functions have been used. We argue, however, that one class, the \\emphpositive functions, is more suitable than others. Positive Boolean functions have a certain property which we (inspired by A. Langen) call ``condensation.'' This property allows for rapid computation of groundness information.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-differencelisttransformationforprolog-1993\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Difference-List Transformation for Prolog.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>New Generation Computing</i>, 11(2): 125–157.  1993.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/BF03037156\"\n     onclick=\"log_download('marriott-sndergaard-differencelisttransformationforprolog-1993', 'http://doi.org/10.1007/BF03037156', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-differencelisttransformationforprolog-1993\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-differencelisttransformationforprolog-1993')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Mar-Son_NGC93,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Difference-List Transformation for {Prolog}},\n  journal   = {New Generation Computing},\n  volume    = {11},\n  number    = {2},\n  pages     = {125--157}, \n  year\t    = {1993},\n  doi       = {10.1007/BF03037156},\n  abstract  = {Difference-lists are terms that represent lists.\n\t\tThe use of difference-lists can speed up most list-processing \n\t\tprograms considerably. Prolog programmers routinely use \n\t\t&#x60;&#x60;difference-list versions&#x27;&#x27; of programs, but very little \n\t\tinvestigation has taken place into difference-list \n\t\ttransformation. Thus, to most programmers it is either \n\t\tunknown that the use of difference-lists is far from safe in \n\t\tall contexts, or else this fact is known but attributed to \n\t\tProlog&#x27;s infamous &#x60;&#x60;occur check problem.&#x27;&#x27; In this paper we \n\t\tstudy the transformation of list-processing programs into \n\t\tprograms that use difference-lists. In particular we are \n\t\tconcerned with finding circumstances under which the \n\t\ttransformation is safe. We show that dataflow analysis can \n\t\tbe used to determine whether the transformation is applicable \n\t\tto a given program, thereby allowing for automatic \n\t\ttransformation. We prove that our transformation preserves \n\t\tstrong operational equivalence.},\n  keywords  = {Program transformation, Static analysis, Logic programming, Prolog},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Difference-lists are terms that represent lists. The use of difference-lists can speed up most list-processing programs considerably. Prolog programmers routinely use ``difference-list versions'' of programs, but very little investigation has taken place into difference-list transformation. Thus, to most programmers it is either unknown that the use of difference-lists is far from safe in all contexts, or else this fact is known but attributed to Prolog's infamous ``occur check problem.'' In this paper we study the transformation of list-processing programs into programs that use difference-lists. In particular we are concerned with finding circumstances under which the transformation is safe. We show that dataflow analysis can be used to determine whether the transformation is applicable to a given program, thereby allowing for automatic transformation. We prove that our transformation preserves strong operational equivalence.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1992\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1992')\"\n      onkeypress=\"toggleGroup('group_1992')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1992</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-bottomupdataflowanalysisofnormallogicprograms-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bottom-Up Dataflow Analysis of Normal Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Journal of Logic Programming</i>, 13(2 & 3): 181–204.  1992.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1016/0743-1066(92)90031-W\"\n     onclick=\"log_download('marriott-sndergaard-bottomupdataflowanalysisofnormallogicprograms-1992', 'http://doi.org/10.1016/0743-1066(92)90031-W', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-bottomupdataflowanalysisofnormallogicprograms-1992\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-bottomupdataflowanalysisofnormallogicprograms-1992')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Mar-Son_JLP92,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Bottom-Up Dataflow Analysis of Normal Logic Programs},\n  journal   = {Journal of Logic Programming},\n  volume    = {13},\n  number    = {2 \\&amp; 3},\n  pages\t    = {181--204}, \n  year\t    = {1992},\n  doi       = {10.1016/0743-1066(92)90031-W},\n  abstract  = {A theory of semantics-based dataflow analysis using a notion of\n\t\t&#x60;&#x60;insertion&#x27;&#x27; is presented. This notion relaxes the Galois \n\t\tconnections used in P. and R. Cousot&#x27;s theory of abstract \n\t\tinterpretation. The aim is to obtain a firm basis for the \n\t\tdevelopment of dataflow analyses of normal logic programs.\n\t\tA dataflow analysis is viewed as a non-standard semantics that\n\t\tapproximates the standard semantics by manipulating descriptions\n\t\tof data objects rather than the objects themselves. A Kleene \n\t\tlogic-based semantics for normal logic programs is defined, \n\t\tsimilar to Fitting&#x27;s $\\Phi_P$ semantics. This provides the \n\t\tneeded semantic base for &#x60;&#x60;bottom-up&#x27;&#x27; dataflow analyses. \n\t\tSuch analyses give information about the success and failure \n\t\tsets of a program. A major application of bottom-up analysis \n\t\tis therefore type inference. We detail a dataflow analysis \n\t\tusing descriptions similar to Sato and Tamaki&#x27;s depth $k$ \n\t\tabstractions and another using Marriott, Naish and Lassez&#x27;s\n\t\t&#x60;&#x60;singleton&#x27;&#x27; abstractions. We show that both are sound with \n\t\trespect to our semantics and outline various uses of the \n\t\tanalyses. Finally we justify our choice of semantics by showing\n\t\tthat it is the most abstract of a number of possible semantics.\n\t\tThis means that every analysis based on our semantics is \n\t\tcorrect with respect to these other semantics, including \n\t\tKunen&#x27;s semantics, SLDNF resolution, and the common (sound) \n\t\tProlog semantics.},\n  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Semantics},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  A theory of semantics-based dataflow analysis using a notion of ``insertion'' is presented. This notion relaxes the Galois connections used in P. and R. Cousot's theory of abstract interpretation. The aim is to obtain a firm basis for the development of dataflow analyses of normal logic programs. A dataflow analysis is viewed as a non-standard semantics that approximates the standard semantics by manipulating descriptions of data objects rather than the objects themselves. A Kleene logic-based semantics for normal logic programs is defined, similar to Fitting's $Φ_P$ semantics. This provides the needed semantic base for ``bottom-up'' dataflow analyses. Such analyses give information about the success and failure sets of a program. A major application of bottom-up analysis is therefore type inference. We detail a dataflow analysis using descriptions similar to Sato and Tamaki's depth $k$ abstractions and another using Marriott, Naish and Lassez's ``singleton'' abstractions. We show that both are sound with respect to our semantics and outline various uses of the analyses. Finally we justify our choice of semantics by showing that it is the most abstract of a number of possible semantics. This means that every analysis based on our semantics is correct with respect to these other semantics, including Kunen's semantics, SLDNF resolution, and the common (sound) Prolog semantics.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-sestoft-nondeterminisminfunctionallanguages-1992\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Non-Determinism in Functional Languages.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Sestoft, P.\n</span>\n\n  \n\n</span>\n\n  <i>The Computer Journal</i>, 35(5): 514–523.  1992.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1093/comjnl/35.5.514\"\n     onclick=\"log_download('sndergaard-sestoft-nondeterminisminfunctionallanguages-1992', 'http://doi.org/10.1093/comjnl/35.5.514', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-sestoft-nondeterminisminfunctionallanguages-1992\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-sestoft-nondeterminisminfunctionallanguages-1992')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Son-Ses_CJ92,\n  author    = {Harald S{\\o}ndergaard and \n\t\tPeter Sestoft},\n  title     = {Non-Determinism in Functional Languages},\n  journal   = {The Computer Journal},\n  volume    = {35},\n  number    = {5},\n  pages\t    = {514--523},\n  year\t    = {1992},\n  doi       = {10.1093/comjnl/35.5.514},\n  abstract  = {The introduction of a non-deterministic operator in even a\n\t\tvery simple functional programming language gives rise to\n\t\ta plethora of semantic questions. These questions are not \n\t\tonly concerned with the choice operator itself. A\n\t\tsurprisingly large number of different parameter passing\n\t\tmechanisms are made possible by the introduction of bounded\n\t\tnon-determinism. The diversity of semantic possibilities\n\t\tis examined systematically using denotational definitions\n\t\tbased on mathematical structures called powerdomains. This\n\t\tresults in an improved understanding of the different kinds\n\t\tof non-determinism and the properties of different kinds of\n\t\tnon-deterministic languages.},\n  keywords  = {Programming language concepts, Nondeterminism, Functional programming, Semantics},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The introduction of a non-deterministic operator in even a very simple functional programming language gives rise to a plethora of semantic questions. These questions are not only concerned with the choice operator itself. A surprisingly large number of different parameter passing mechanisms are made possible by the introduction of bounded non-determinism. The diversity of semantic possibilities is examined systematically using denotational definitions based on mathematical structures called powerdomains. This results in an improved understanding of the different kinds of non-determinism and the properties of different kinds of non-deterministic languages.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1990\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1990')\"\n      onkeypress=\"toggleGroup('group_1990')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1990</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"cremonini-marriott-sndergaard-ageneraltheoryforabstraction-1990\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A General Theory for Abstraction.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Cremonini, R.; Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Tsang, C. P., editor(s), <i>AI '90: Proceedings of the Fourth Australian Joint Conference on Artificial Intelligence</i>, pages 121–134,  1990. World Scientific Publ.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/cremonini-marriott-sndergaard-ageneraltheoryforabstraction-1990\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('cremonini-marriott-sndergaard-ageneraltheoryforabstraction-1990')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Cre-Mar-Son_AI90,\n  author    = {Roberto Cremonini and \n\t\tKim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {A General Theory for Abstraction},\n  editor    = {C. P. Tsang},\n  booktitle = {AI &#x27;90: Proceedings of the Fourth Australian Joint Conference on \n\t\t\tArtificial Intelligence}, \n  pages     = {121--134},\n  publisher = {World Scientific Publ.},\n  year\t    = {1990},\n  abstract  = {Abstraction is the process of mapping one representation of \n\t\ta problem into another representation so as to simplify \n\t\treasoning while preserving the essence of the problem.\n\t\tIt has been investigated in many different areas of computer\n\t\tscience. In artificial intelligence, abstraction is used in\n\t\tautomated theorem proving, problem solving, planning, common\n\t\tsense reasoning and qualitative reasoning. In dataflow \n\t\tanalysis of programs, it has been formalized in the theory \n\t\tof abstract interpretation. However, the possible \n\t\tconnections between research on abstraction in artificial \n\t\tintelligence and dataflow analysis have gone unnoticed until\n\t\tnow. This paper investigates these connections and\n\t\tprovides a general theory of abstraction for artificial \n\t\tintelligence. In particular, we present a method for \n\t\tbuilding an &#x60;&#x60;optimal&#x27;&#x27; abstraction and give general \n\t\tsufficient conditions for the abstraction to be &#x60;&#x60;safe.&#x27;&#x27;\n\t\tThe usefulness and generality of our theory is illustrated \n\t\twith a number of example applications and by comparisons \n\t\twith related work.},\n  keywords  = {Abstract interpretation, Artificial intelligence},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstraction is the process of mapping one representation of a problem into another representation so as to simplify reasoning while preserving the essence of the problem. It has been investigated in many different areas of computer science. In artificial intelligence, abstraction is used in automated theorem proving, problem solving, planning, common sense reasoning and qualitative reasoning. In dataflow analysis of programs, it has been formalized in the theory of abstract interpretation. However, the possible connections between research on abstraction in artificial intelligence and dataflow analysis have gone unnoticed until now. This paper investigates these connections and provides a general theory of abstraction for artificial intelligence. In particular, we present a method for building an ``optimal'' abstraction and give general sufficient conditions for the abstraction to be ``safe.'' The usefulness and generality of our theory is illustrated with a number of example applications and by comparisons with related work.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-dart-acharacterizationofnonflounderinglogicprograms-1990\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Characterization of Non-floundering Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.; <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Dart, P.\n</span>\n\n  \n\n</span>\n\n  In Debray, S.;  and Hermenegildo, M., editor(s), <i>Logic Programming: Proceedings of the 1990 North American Conference</i>, pages 661–680,  1990. MIT Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-dart-acharacterizationofnonflounderinglogicprograms-1990\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-dart-acharacterizationofnonflounderinglogicprograms-1990')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son-Dar_NACLP90,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard and \n\t\tPhilip Dart},\n  title\t    = {A Characterization of Non-floundering Logic Programs},\n  editor    = {S. Debray and M. Hermenegildo},\n  booktitle = {Logic Programming: \n\t\tProceedings of the 1990 North American Conference},\n  pages\t    = {661--680},\n  publisher = {MIT Press}, \n  year\t    = {1990},\n  abstract  = {SLDNF resolution provides an operational semantics which\n\t\t(unlike many Prolog implementations of negation) is both \n\t\tcomputationally tractable and sound with respect to a \n\t\tdeclarative semantics. However, SLDNF is not complete, and \n\t\tit achieves soundness only by discarding certain queries to \n\t\tprograms because they &#x60;&#x60;flounder.&#x27;&#x27;\n\t\tWe present dataflow analyses that for a given normal logic \n\t\tprogram detects (1) whether naive Prolog-style handling of \n\t\tnegation is sound and (2) whether SLDNF resolution avoids \n\t\tfloundering. The analyses are presented in a \n\t\tlanguage-independent framework of abstract interpretation based\n\t\ton denotational definitions. To our knowledge they are more \n\t\tprecise than any of their kind. In particular we obtain a \n\t\tcharacterization of a class of non-floundering programs larger\n\t\tthan any other that we know of.},\n  keywords  = {Floundering analysis, Logic programming, Prolog},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  SLDNF resolution provides an operational semantics which (unlike many Prolog implementations of negation) is both computationally tractable and sound with respect to a declarative semantics. However, SLDNF is not complete, and it achieves soundness only by discarding certain queries to programs because they ``flounder.'' We present dataflow analyses that for a given normal logic program detects (1) whether naive Prolog-style handling of negation is sound and (2) whether SLDNF resolution avoids floundering. The analyses are presented in a language-independent framework of abstract interpretation based on denotational definitions. To our knowledge they are more precise than any of their kind. In particular we obtain a characterization of a class of non-floundering programs larger than any other that we know of.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-abstractinterpretationoflogicprogramsthedenotationalapproach-1990\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Abstract Interpretation of Logic Programs: The Denotational Approach.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Bossi, A., editor(s), <i>Proceedings of the Fifth Italian Conference on Logic Programming</i>, pages 399–425,  1990. Gruppo Ricercatori ed Utenti di Logic Programming, Padova, Italy\n  <span class=\"note\">Invited paper</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-abstractinterpretationoflogicprogramsthedenotationalapproach-1990\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-abstractinterpretationoflogicprogramsthedenotationalapproach-1990')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_GULP90,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Abstract Interpretation of Logic Programs:\n\t\t\tThe Denotational Approach},\n  editor    = {A. Bossi},\n  booktitle = {Proceedings of the Fifth Italian Conference on Logic Programming},\n  pages     = {399--425},\n  organization = {Gruppo Ricercatori ed Utenti di Logic Programming,\n\t\t\tPadova, Italy}, \n  year\t    = {1990},\n  note\t    = {Invited paper},\n  abstract  = {Logic programming languages are based on a principle of \n\t\tseparation of &#x60;&#x60;logic&#x27;&#x27; and &#x60;&#x60;control.&#x27;&#x27; This means that \n\t\tthey can be given simple model-theoretic semantics\n\t\twithout regard to any particular execution mechanism.\n\t\tWhile this is desirable from a semantical point of view, \n\t\tit does make sound, efficient implementation of logic \n\t\tprogramming languages difficult. The lack of &#x60;&#x60;control \n\t\tinformation&#x27;&#x27; in programs calls for complex dataflow\n\t\tanalyses to guide execution. Since dataflow analysis also \n\t\tfinds extensive use in error-finding and transformation \n\t\ttools, there is a need for a simple and powerful theory\n\t\tof dataflow analysis of logic programs.\n\t\tWe offer such a theory, inspired by F. Nielson&#x27;s extension\n\t\tof P. and R. Cousot&#x27;s \\emph{abstract interpretation}.\n\t\tWe then present a denotational definition of the semantics \n \t\tof definite logic programs. This definition is of interest \n\t\tin its own right because of its novel application of \n\t\t\\emph{parametric substitutions} which makes it very compact\n\t\tand yet transparent. Stepwise we develop the definition \n\t\tinto a generic dataflow analysis which encompasses a large \n\t\tclass of dataflow analyses based on the SLD execution model.\n\t\tWe exemplify one instance of the definition by developing a \n\t\tprovably correct groundness analysis to predict how \n\t\tvariables may be bound to ground terms during execution.\n\t\tWe also discuss related work and other applications.},\n  keywords  = {Abstract interpretation, Abstract domains, Groundness analysis, Logic programming},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Logic programming languages are based on a principle of separation of ``logic'' and ``control.'' This means that they can be given simple model-theoretic semantics without regard to any particular execution mechanism. While this is desirable from a semantical point of view, it does make sound, efficient implementation of logic programming languages difficult. The lack of ``control information'' in programs calls for complex dataflow analyses to guide execution. Since dataflow analysis also finds extensive use in error-finding and transformation tools, there is a need for a simple and powerful theory of dataflow analysis of logic programs. We offer such a theory, inspired by F. Nielson's extension of P. and R. Cousot's \\emphabstract interpretation. We then present a denotational definition of the semantics of definite logic programs. This definition is of interest in its own right because of its novel application of \\emphparametric substitutions which makes it very compact and yet transparent. Stepwise we develop the definition into a generic dataflow analysis which encompasses a large class of dataflow analyses based on the SLD execution model. We exemplify one instance of the definition by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution. We also discuss related work and other applications.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-analysisofconstraintlogicprograms-1990\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Analysis of Constraint Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Debray, S.;  and Hermenegildo, M., editor(s), <i>Logic Programming: Proceedings of the 1990 North American Conference</i>, pages 531–547,  1990. MIT Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-analysisofconstraintlogicprograms-1990\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-analysisofconstraintlogicprograms-1990')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_NACLP90,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Analysis of Constraint Logic Programs},\n  editor    = {S. Debray and M. Hermenegildo},\n  booktitle = {Logic Programming: \n\t\tProceedings of the 1990 North American Conference},\n  pages\t    = {531--547},\n  publisher = {MIT Press}, \n  year\t    = {1990},\n  abstract  = {Increasingly, compilers for logic programs are making use \n\t\tof information from dataflow analyses to aid in the generation\n\t\tof efficient target code. However, generating efficient target\n\t\tcode from constraint logic programs is even more difficult than\n\t\tfrom logic programs. Thus we feel that good compilation of\n\t\tconstraint logic programs will require sophisticated analysis \n\t\tof the source code. Here we present a simple framework for\n\t\tthe abstract interpretation of constraint logic programs\n\t\twhich is intended to serve as the basis for developing such \n\t\tanalyses. We show the framework&#x27;s practical usefulness by \n\t\tsketching two dataflow analyses that are based on it\n\t\tand indicating how they can be used to improve the code \n\t\tgenerated by a compiler.},\n  keywords  = {Constraint programming, Logic programming, Abstract interpretation, Semantics, Compilation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Increasingly, compilers for logic programs are making use of information from dataflow analyses to aid in the generation of efficient target code. However, generating efficient target code from constraint logic programs is even more difficult than from logic programs. Thus we feel that good compilation of constraint logic programs will require sophisticated analysis of the source code. Here we present a simple framework for the abstract interpretation of constraint logic programs which is intended to serve as the basis for developing such analyses. We show the framework's practical usefulness by sketching two dataflow analyses that are based on it and indicating how they can be used to improve the code generated by a compiler.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-sestoft-referentialtransparencydefinitenessandunfoldability-1990\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Referential Transparency, Definiteness and Unfoldability.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>;  and Sestoft, P.\n</span>\n\n  \n\n</span>\n\n  <i>Acta Informatica</i>, 27(6): 505–517.  1990.\n  <span class=\"note\">Reviewed in Computing Reviews 32(3): 144–145, 1991</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/BF00277387\"\n     onclick=\"log_download('sndergaard-sestoft-referentialtransparencydefinitenessandunfoldability-1990', 'http://doi.org/10.1007/BF00277387', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-sestoft-referentialtransparencydefinitenessandunfoldability-1990\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-sestoft-referentialtransparencydefinitenessandunfoldability-1990')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Son-Ses_ACTA90,\n  author    = {Harald S{\\o}ndergaard and \n\t\tPeter Sestoft},\n  title\t    = {Referential Transparency, Definiteness and Unfoldability},\n  journal   = {Acta Informatica},\n  volume    = {27},\n  number    = {6},\n  pages\t    = {505--517},\n  year\t    = {1990},\n  note\t    = {Reviewed in Computing Reviews 32(3): 144--145, 1991},\n  doi       = {10.1007/BF00277387},\n  abstract  = {The term &#x60;&#x60;referential transparency&#x27;&#x27; is frequently used\n\t\tto indicate that a programming language has certain useful\n\t\tproperties. We observe, however, that the formal and\n\t\tinformal definitions given in the literature are not\n\t\tequivalent and we investigate their relationships.\n\t\tTo this end, we study the definitions in the context of\n\t\ta simple expression language and show that in the presence\n\t\tof non-determinism, the differences are manifest. We \n\t\tpropose a definition of &#x60;&#x60;referential transparency&#x27;&#x27;, based\n\t\ton Quine&#x27;s, as well as of the related notions: definiteness\n\t\tand unfoldability. We demonstrate that these notions are\n\t\tuseful to characterize programming languages.},\n  keywords  = {Programming language concepts, Nondeterminism, Semantics},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The term ``referential transparency'' is frequently used to indicate that a programming language has certain useful properties. We observe, however, that the formal and informal definitions given in the literature are not equivalent and we investigate their relationships. To this end, we study the definitions in the context of a simple expression language and show that in the presence of non-determinism, the differences are manifest. We propose a definition of ``referential transparency'', based on Quine's, as well as of the related notions: definiteness and unfoldability. We demonstrate that these notions are useful to characterize programming languages.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1989\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1989')\"\n      onkeypress=\"toggleGroup('group_1989')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1989</span>\n      <span class=\"bibbase_group_count\">\n        \n        (5)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergeneration-1989\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Jones, N. D.; Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>Lisp and Symbolic Computation</i>, 2(1): 9–50.  1989.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/BF01806312\"\n     onclick=\"log_download('jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergeneration-1989', 'http://doi.org/10.1007/BF01806312', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergeneration-1989\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergeneration-1989')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Jon-Ses-Son_LASC89,\n  author    = {Neil D. Jones and \n\t\tPeter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in\n\t\tCompiler Generation},\n  journal   = {Lisp and Symbolic Computation},\n  volume    = {2},\n  number    = {1},\n  pages     = {9--50},\n  year      = {1989},\n  doi       = {10.1007/BF01806312},\n  abstract  = {The program transformation principle called partial \n\t\tevaluation has interesting applications in compilation\n\t\tand compiler generation. Self-applicable partial evaluators\n\t\tmay be used for transforming interpreters into corresponding\n\t\tcompilers and even for the generation of compiler generators.\n\t\tThis is useful because interpreters are significantly easier\n\t\tto write than compilers, but run much slower than compiled\n\t\tcode. A major difficulty in writing compilers (and compiler\n\t\tgenerators) is the thinking in terms of distinct binding\n\t\ttimes: run time and compile time (and compiler generation\n\t\ttime). The paper gives an introduction to partial\n\t\tevaluation and describes a fully automatic though \n\t\texperimental partial evaluator, called mix, able to generate\n\t\tstand-alone compilers as well as a compiler generator.\n\t\tMix partially evaluates programs written in Mixwell,\n\t\tessentially a first-order subset of statically scoped pure\n\t\tLisp. For compiler generation purposes it is necessary\n\t\tthat the partial evaluator be self-applicable. Even though\n\t\tthe potential utility of a self-applicable partial evaluator\n\t\thas been recognized since 1971, a 1984 version of mix\n\t\tappears to be the first successful implementation.\n\t\tThe overall structure of mix and the basic ideas behind its\n\t\tway of working are sketched. Finally, some results of using\n\t\ta version of mix are reported.},\n  keywords  = {Partial evaluation, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The program transformation principle called partial evaluation has interesting applications in compilation and compiler generation. Self-applicable partial evaluators may be used for transforming interpreters into corresponding compilers and even for the generation of compiler generators. This is useful because interpreters are significantly easier to write than compilers, but run much slower than compiled code. A major difficulty in writing compilers (and compiler generators) is the thinking in terms of distinct binding times: run time and compile time (and compiler generation time). The paper gives an introduction to partial evaluation and describes a fully automatic though experimental partial evaluator, called mix, able to generate stand-alone compilers as well as a compiler generator. Mix partially evaluates programs written in Mixwell, essentially a first-order subset of statically scoped pure Lisp. For compiler generation purposes it is necessary that the partial evaluator be self-applicable. Even though the potential utility of a self-applicable partial evaluator has been recognized since 1971, a 1984 version of mix appears to be the first successful implementation. The overall structure of mix and the basic ideas behind its way of working are sketched. Finally, some results of using a version of mix are reported.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-semanticsbaseddataflowanalysisoflogicprograms-1989\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Semantics-Based Dataflow Analysis of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Ritter, G. X., editor(s), <i>Information Processing 89</i>, pages 601–606,  1989. North-Holland\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-semanticsbaseddataflowanalysisoflogicprograms-1989\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-semanticsbaseddataflowanalysisoflogicprograms-1989')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_IFIP89,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Semantics-Based Dataflow Analysis of Logic Programs},\n  editor    = {G. X. Ritter},\n  booktitle = {Information Processing 89},\n  pages     = {601--606},\n  publisher = {North-Holland},\n  year      = {1989},\n  abstract  = {The increased acceptance of Prolog has motivated widespread \n\t \tinterest in the semantics-based dataflow analysis of logic \n\t\tprograms and a number of different approaches have been \n\t\tsuggested. However, the relationships between these \n\t\tapproaches are not clear. The present paper provides a \n\t\tunifying introduction to the approaches by giving novel \n\t\tdenotational semantic definitions which capture their \n\t\tessence. In addition, the wide range of analysis tools \n\t\tsupported by semantics-based dataflow analysis are discussed.},\n  keywords  = {Logic programming, Prolog, Static analysis, Semantics},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The increased acceptance of Prolog has motivated widespread interest in the semantics-based dataflow analysis of logic programs and a number of different approaches have been suggested. However, the relationships between these approaches are not clear. The present paper provides a unifying introduction to the approaches by giving novel denotational semantic definitions which capture their essence. In addition, the wide range of analysis tools supported by semantics-based dataflow analysis are discussed.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-onprologandtheoccurcheckproblem-1989\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Prolog and the Occur Check Problem.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>SIGPLAN Notices</i>, 24(5): 76–82.  1989.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/66068.66075\"\n     onclick=\"log_download('marriott-sndergaard-onprologandtheoccurcheckproblem-1989', 'http://doi.org/10.1145/66068.66075', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-onprologandtheoccurcheckproblem-1989\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-onprologandtheoccurcheckproblem-1989')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Mar-Son_occur89,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title     = {On {Prolog} and the Occur Check Problem},\n  journal   = {SIGPLAN Notices},\n  volume    = {24},\n  number    = {5},\n  pages     = {76--82},\n  year      = {1989},\n  doi       = {10.1145/66068.66075},\n  abstract  = {It is well known that omission of the occur check in \n\t\tunification leads to unsound Prolog systems. Nevertheless,\n\t \tmost Prolog systems omit the occur check because this\n\t\tmakes unification much faster and unsoundness allegedly\n\t\tseldom manifests itself. We revisit the occur check\n\t\tproblem and point to two aspects that have previously \n\t\treceived no attention. Firstly, &#x60;&#x60;unification without the\n\t\toccur check&#x27;&#x27; is ambiguous, and in practice, Prolog systems\n\t\tvary markedly in their reaction to programs having occur\n\t\tcheck problems. Secondly, even very simple program\n\t\ttransformations are unsafe for pure Prolog when the occur\n\t\tcheck is omitted. We conclude that the occur check problem\n\t\tis important, and in particular, that the current effort to\n\t\tstandardize Prolog should address it.},\n  keywords  = {Logic programming, Prolog, Unification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  It is well known that omission of the occur check in unification leads to unsound Prolog systems. Nevertheless, most Prolog systems omit the occur check because this makes unification much faster and unsoundness allegedly seldom manifests itself. We revisit the occur check problem and point to two aspects that have previously received no attention. Firstly, ``unification without the occur check'' is ambiguous, and in practice, Prolog systems vary markedly in their reaction to programs having occur check problems. Secondly, even very simple program transformations are unsafe for pure Prolog when the occur check is omitted. We conclude that the occur check problem is important, and in particular, that the current effort to standardize Prolog should address it.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-notesforatutorialonabstractinterpretationoflogicprograms-1989\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Notes for a Tutorial on Abstract Interpretation of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n   1989.\n  <span class=\"note\">Tutorial Notes for the 1989 North American Conference on Logic Programming. Assocation for Logic Programming, 1989</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-notesforatutorialonabstractinterpretationoflogicprograms-1989\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-notesforatutorialonabstractinterpretationoflogicprograms-1989')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Unpublished{Mar-Son_tutorial89,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Notes for a Tutorial on Abstract Interpretation of Logic \n\t\tPrograms},\n  year      = {1989},\n  note      = {Tutorial Notes for the 1989 North American Conference on \n\t\tLogic Programming. Assocation for Logic Programming, 1989},\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, Unification, Semantics, Groundness analysis},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sndergaard-semanticsbasedanalysisandtransformationoflogicprograms-1989\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Semantics-Based Analysis and Transformation of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  Ph.D. Thesis, University of Copenhagen, Denmark,  1989.\n  <span class=\"note\">Also available as: Technical Report 89/21, Department of Computer Science, The University of Melbourne, 1990, DIKU Report 89/22, Department of Computer Science, University of Copenhagen, 1990, and Technical Report #12, Key Center for Knowledge Based Systems, RMIT and the University of Melbourne, 1990</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-semanticsbasedanalysisandtransformationoflogicprograms-1989\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-semanticsbasedanalysisandtransformationoflogicprograms-1989')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Phdthesis{Son_phd89,\n  author    = {Harald S{\\o}ndergaard},\n  title\t    = {Semantics-Based Analysis and Transformation of Logic Programs},\n  school    = {University of Copenhagen, Denmark},\n  year\t    = {1989},\n  note\t    = {Also available as: Technical Report 89/21,\n\t\tDepartment of Computer Science, \n\t\tThe University of Melbourne, 1990,\n\t\tDIKU Report 89/22, Department of Computer Science, \n\t\tUniversity of Copenhagen, 1990,\n\t\tand Technical Report \\#12,\n\t\tKey Center for Knowledge Based Systems,\n\t\tRMIT and the University of Melbourne, 1990},\n  abstract  = {Dataflow analysis is an essential component of many programming \n\t\ttools. One use of dataflow information is to identify errors in\n\t\ta program, as done by program &#x60;&#x60;debuggers&#x27;&#x27; and type checkers.\n\t\tAnother is in compilers and other program transformers, where \n\t\tthe analysis may guide various optimisations.\n\n\t\tThe correctness of a programming tool&#x27;s dataflow analysis \n\t\tcomponent is usually of paramount importance. The theory of \n\t\tabstract interpretation, originally developed by P. and R. \n\t\tCousot aims at providing a framework for the development of \n\t\tcorrect analysis tools. In this theory, dataflow analysis is \n\t\tviewed as &#x60;&#x60;non-standard&#x27;&#x27; semantics, and abstract \n\t\tinterpretation prescribes certain relations between standard\n\t\tand non-standard semantics, in order to guarantee the \n\t\tcorrectness of the non-standard semantics with respect to the \n\t\tstandard semantics.\n\n\t\tThe increasing acceptance of Prolog as a practical programming \n\t\tlanguage has motivated widespread interest in dataflow analysis\n\t\tof logic programs and especially in abstract interpretation.\n\t\tLogic programmming languages are attractive from a semantical \n\t\tpoint of view, but dataflow analysis of logic programs is more \n\t\tcomplex than that of more traditional programming languages, \n\t\tsince dataflow is bi-directional (owing to unification) and \n\t\tcontrol flow is in terms of backtracking.\n\n\t\tThe present thesis is concerned with semantics-based dataflow \n\t\tanalysis of logic programs. We first set up a theory for \n\t\tdataflow analysis which is basically that of abstract \n\t\tinterpretation as introduced by P. and R. Cousot. We do, \n\t\thowever, relax the classical theory of abstract interpretation\n\t\tsomewhat, by giving up the demand for (unique) \\emph{best} \n\t\tapproximations.\n\n\t\tTwo different kinds of analysis of logic programs are then \n\t\tidentified: a \\emph{bottom-up} analysis yields an approximation\n\t\tto the success set (and possibly the failure set) of a program,\n\t\twhereas a \\emph{top-down} analysis yields an approximation to \n\t\tthe call patterns that would appear during an execution based \n\t\ton SLD resolution. We investigate some of the uses of the two \n\t\tkinds of analysis. In the bottom-up case, we pay special \n\t\tattention to (bottom-up) type inference and its use in program \n\t\tspecialisation. In the top-down case, we present a generic \n\t\t&#x60;&#x60;dataflow semantics&#x27;&#x27; that encompasses many useful dataflow \n\t\tanalyses. As an instance of the generic semantics, a groundness\n\t\tanalysis is detailed, and a series of other applications are \n\t\tmentioned.\n\n\t\tWe finally present a transformation technique, based on \n\t\ttop-down analysis, for introducing difference-lists in a \n\t\tlist-manipulating program, without changing the program&#x27;s \n\t\tsemantics. This may lead to substantial improvement in a \n\t\tprogram&#x27;s execution time.},\n  keywords  = {Abstract interpretation, Abstract domains, Logic programming, \n\t  \tSemantics, Many-valued logic, Unification, Groundness analysis,\n\t\tProgram transformation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Dataflow analysis is an essential component of many programming tools. One use of dataflow information is to identify errors in a program, as done by program ``debuggers'' and type checkers. Another is in compilers and other program transformers, where the analysis may guide various optimisations. The correctness of a programming tool's dataflow analysis component is usually of paramount importance. The theory of abstract interpretation, originally developed by P. and R. Cousot aims at providing a framework for the development of correct analysis tools. In this theory, dataflow analysis is viewed as ``non-standard'' semantics, and abstract interpretation prescribes certain relations between standard and non-standard semantics, in order to guarantee the correctness of the non-standard semantics with respect to the standard semantics. The increasing acceptance of Prolog as a practical programming language has motivated widespread interest in dataflow analysis of logic programs and especially in abstract interpretation. Logic programmming languages are attractive from a semantical point of view, but dataflow analysis of logic programs is more complex than that of more traditional programming languages, since dataflow is bi-directional (owing to unification) and control flow is in terms of backtracking. The present thesis is concerned with semantics-based dataflow analysis of logic programs. We first set up a theory for dataflow analysis which is basically that of abstract interpretation as introduced by P. and R. Cousot. We do, however, relax the classical theory of abstract interpretation somewhat, by giving up the demand for (unique) \\emphbest approximations. Two different kinds of analysis of logic programs are then identified: a \\emphbottom-up analysis yields an approximation to the success set (and possibly the failure set) of a program, whereas a \\emphtop-down analysis yields an approximation to the call patterns that would appear during an execution based on SLD resolution. We investigate some of the uses of the two kinds of analysis. In the bottom-up case, we pay special attention to (bottom-up) type inference and its use in program specialisation. In the top-down case, we present a generic ``dataflow semantics'' that encompasses many useful dataflow analyses. As an instance of the generic semantics, a groundness analysis is detailed, and a series of other applications are mentioned. We finally present a transformation technique, based on top-down analysis, for introducing difference-lists in a list-manipulating program, without changing the program's semantics. This may lead to substantial improvement in a program's execution time.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1988\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1988')\"\n      onkeypress=\"toggleGroup('group_1988')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1988</span>\n      <span class=\"bibbase_group_count\">\n        \n        (4)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-prologprogramtransformationbyintroductionofdifferencelists-1988\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Prolog Program Transformation by Introduction of Difference Lists.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In <i>Proceedings of the International Computer Science Conference '88</i>, pages 206–213,  1988. IEEE Computer Society\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-prologprogramtransformationbyintroductionofdifferencelists-1988\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-prologprogramtransformationbyintroductionofdifferencelists-1988')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_ICSC88,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Prolog Program Transformation by Introduction of \n\t\tDifference Lists},\n  booktitle = {Proceedings of the International Computer Science \n\t\tConference &#x27;88},\n  pages     = {206--213},\n  publisher = {IEEE Computer Society},\n  location  = {Hong Kong},\n  year      = {1988},\n  keywords  = {Program transformation, Logic programming, Prolog},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-bottomupabstractinterpretationoflogicprograms-1988\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Bottom-Up Abstract Interpretation of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Kowalski, R. A.;  and Bowen, K. A., editor(s), <i>Logic Programming: Proceedings of the Fifth International Conference and Symposium</i>, pages 733–748,  1988. MIT Press\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-bottomupabstractinterpretationoflogicprograms-1988\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-bottomupabstractinterpretationoflogicprograms-1988')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Mar-Son_ICSLP88,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title\t    = {Bottom-Up Abstract Interpretation of Logic Programs},\n  editor    = {R. A. Kowalski and K. A. Bowen},\n  booktitle = {Logic Programming: Proceedings of the Fifth International \n\t\tConference and Symposium},\n  pages\t    = {733--748},\n  publisher = {MIT Press}, \n  year\t    = {1988},\n  abstract  = {Abstract interpretation is useful in the design and \n\t\tverification of dataflow analyses. Given a programming\n\t\tlanguage and a fixpoint characterization of its semantics,\n\t\tabstract interpretation enables the explicit formulation\n\t\tof the relation between a dataflow analysis and the \n\t\tsemantics. A key notion in this is that of a &#x60;&#x60;collecting&#x27;&#x27;\n\t\tsemantics---an extension of the semantics that attaches\n\t\tinformation about run-time behaviour to program points.\n\t \tDifferent collecting semantics lead to different types of\n\t\tdataflow analysis. We present a novel collecting semantics \n\t\tfor normal logic programs. It is based on a Fitting-style \n\t\tbottom-up semantics and forms a firm semantic base for\n\t\tbottom-up dataflow analyses. One such analysis, using\n\t\tdescriptions similar to Sato and Tamaki&#x27;s depth k\n\t\tabstractions, is detailed and shown to be sound with \n\t\trespect to the collecting semantics. Its use in program\n\t\tspecialization and termination analysis is demonstrated.},\n  keywords  = {Abstract interpretation, Logic programming, Many-valued logic, Depth k analysis, Program transformation, Semantics, Termination analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Abstract interpretation is useful in the design and verification of dataflow analyses. Given a programming language and a fixpoint characterization of its semantics, abstract interpretation enables the explicit formulation of the relation between a dataflow analysis and the semantics. A key notion in this is that of a ``collecting'' semantics—an extension of the semantics that attaches information about run-time behaviour to program points. Different collecting semantics lead to different types of dataflow analysis. We present a novel collecting semantics for normal logic programs. It is based on a Fitting-style bottom-up semantics and forms a firm semantic base for bottom-up dataflow analyses. One such analysis, using descriptions similar to Sato and Tamaki's depth k abstractions, is detailed and shown to be sound with respect to the collecting semantics. Its use in program specialization and termination analysis is demonstrated.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"marriott-sndergaard-ondescribingsuccesspatternsoflogicprograms-1988\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  On Describing Success Patterns of Logic Programs.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Marriott, K.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  Technical Report 88/12, Department of Computer Science, The University of Melbourne,  1988.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/marriott-sndergaard-ondescribingsuccesspatternsoflogicprograms-1988\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('marriott-sndergaard-ondescribingsuccesspatternsoflogicprograms-1988')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Techreport{Mar-Son_success_patterns88,\n  author    = {Kim Marriott and \n\t\tHarald S{\\o}ndergaard},\n  title     = {On Describing Success Patterns of Logic Programs},\n  number    = {88/12},\n  institution = {Department of Computer Science, The University of Melbourne},\n  year      = {1988},\n  abstract  = {Sato and Tamaki&#x27;s depth $k$ abstractions are reviewed, and their\n\t\tuse as (finite) descriptions of (infinite) sets of expressions\n\t\t(terms and atomic formulas) is discussed. This leads to an\n\t\tinvestigation of other classes of expressions. A certain\n\t\tproperty of a class is identified as being sufficient for the\n\t\texistence of a Galois insertion from the class to the set of\n\t\tall expressions, and thus for abstract interpretation to be\n\t\tapplicable. Sato and Tamaki&#x27;s class does not have the property,\n\t\tbut it is shown how it can be extended to a class having the\n\t\tproperty while still remaining finite.},\n  keywords  = {Abstract interpretation, Abstract domains, Depth k analysis},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  Sato and Tamaki's depth $k$ abstractions are reviewed, and their use as (finite) descriptions of (infinite) sets of expressions (terms and atomic formulas) is discussed. This leads to an investigation of other classes of expressions. A certain property of a class is identified as being sufficient for the existence of a Galois insertion from the class to the set of all expressions, and thus for abstract interpretation to be applicable. Sato and Tamaki's class does not have the property, but it is shown how it can be extended to a class having the property while still remaining finite.\n</div>\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"sestoft-sndergaard-abibliographyonpartialevaluation-1988\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Bibliography on Partial Evaluation.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>SIGPLAN Notices</i>, 23(2): 19–27.  1988.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/43908.43910\"\n     onclick=\"log_download('sestoft-sndergaard-abibliographyonpartialevaluation-1988', 'http://doi.org/10.1145/43908.43910', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sestoft-sndergaard-abibliographyonpartialevaluation-1988\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sestoft-sndergaard-abibliographyonpartialevaluation-1988')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Ses-Son_pebibl88,\n  author    = {Peter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {A Bibliography on Partial Evaluation},\n  journal   = {SIGPLAN Notices},\n  volume    = {23},\n  number    = {2},\n  pages     = {19--27},\n  year      = {1988},\n  doi       = {10.1145/43908.43910},\n  abstract  = {This note gives a short introduction to partial evaluation \n\t\tand an extensive, annotated bibliography to the field. \n\t\tThe bibliography is restricted to cover public-domain \n\t\tliterature in English.},\n  keywords  = {Partial evaluation},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  This note gives a short introduction to partial evaluation and an extensive, annotated bibliography to the field. The bibliography is restricted to cover public-domain literature in English.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1987\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1987')\"\n      onkeypress=\"toggleGroup('group_1987')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1987</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergenerationextendedabstract-1987\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  Mix: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation—Extended Abstract.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Jones, N. D.; Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In et al. , M. M., editor(s), <i>Mathematical Foundations of Programming Language Semantics</i>, volume 298, of Lecture Notes in Computer Science, pages 386–413. Springer-Verlag,  1987.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-19020-1_21\"\n     onclick=\"log_download('jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergenerationextendedabstract-1987', 'http://doi.org/10.1007/3-540-19020-1_21', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergenerationextendedabstract-1987\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jones-sestoft-sndergaard-mixaselfapplicablepartialevaluatorforexperimentsincompilergenerationextendedabstract-1987')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Incollection{Jon-Ses-Son_mix-abstract87,\n  author    = {Neil D. Jones and \n\t\tPeter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {Mix: A Self-Applicable Partial Evaluator for Experiments in\n\t\tCompiler Generation---Extended Abstract},\n  editor    = {M. Main et al.},\n  booktitle = {Mathematical Foundations of Programming Language Semantics},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {298},\n  publisher = {Springer-Verlag},\n  pages     = {386--413},\n  year      = {1987},\n  doi       = {10.1007/3-540-19020-1_21},\n  keywords  = {Partial evaluation, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jones-sndergaard-asemanticsbasedframeworkfortheabstractinterpretationofprolog-1987\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  A Semantics-Based Framework for the Abstract Interpretation of Prolog.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Jones, N. D.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Abramsky, S.;  and Hankin, C., editor(s), <i>Abstract Interpretation of Declarative Languages</i>, 6, pages 123–142. Ellis Horwood,  1987.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jones-sndergaard-asemanticsbasedframeworkfortheabstractinterpretationofprolog-1987\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jones-sndergaard-asemanticsbasedframeworkfortheabstractinterpretationofprolog-1987')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Incollection{Jon-Son_absint87,\n  author    = {Neil D. Jones and \n\t\tHarald S{\\o}ndergaard},\n  title     = {A Semantics-Based Framework for the Abstract Interpretation of \n\t\t{Prolog}},\n  editor    = {S. Abramsky and C. Hankin},\n  booktitle = {Abstract Interpretation of Declarative Languages},\n  chapter   = {6},\n  pages     = {123--142},\n  publisher = {Ellis Horwood},\n  year      = {1987},\n  keywords  = {Abstract interpretation, Logic programming, Prolog, Groundness analysis, Sharing analysis},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1986\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1986')\"\n      onkeypress=\"toggleGroup('group_1986')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1986</span>\n      <span class=\"bibbase_group_count\">\n        \n        (1)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"sndergaard-anapplicationofabstractinterpretationoflogicprogramsoccurcheckreduction-1986\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Robinet, B.;  and Wilhelm, R., editor(s), <i>Proceedings of the European Symposium on Programming—ESOP 86</i>, volume 213, of <i>Lecture Notes in Computer Science</i>, pages 327–338,  1986. Springer-Verlag\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-16442-1_25\"\n     onclick=\"log_download('sndergaard-anapplicationofabstractinterpretationoflogicprogramsoccurcheckreduction-1986', 'http://doi.org/10.1007/3-540-16442-1_25', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/sndergaard-anapplicationofabstractinterpretationoflogicprogramsoccurcheckreduction-1986\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n  &nbsp;\n  <a class=\"bibbase_abstract_link bibbase link\"\n     href=\"#\"\n     onclick=\"showAbstract(event); return false;\">\n    abstract <i class=\"fa fa-caret-down\"></i></a>\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('sndergaard-anapplicationofabstractinterpretationoflogicprogramsoccurcheckreduction-1986')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Inproceedings{Son_ESOP86,\n  author    = {Harald S{\\o}ndergaard},\n  title     = {An Application of Abstract Interpretation of Logic Programs:\n\t\tOccur Check Reduction},\n  editor    = {B. Robinet and R. Wilhelm},\n  booktitle = {Proceedings of the European Symposium on Programming---ESOP 86},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {213},\n  pages     = {327--338},\n  publisher = {Springer-Verlag},\n  year      = {1986},\n  doi       = {10.1007/3-540-16442-1_25},\n  abstract  = {The occur check in Robinson unification is superfluous in most \n\t\tunifications that take place in practice. The present paper is \n\t\tconcerned with the problem of determining circumstances under \n\t\twhich the occur may safely be dispensed with. The method given \n\t\tdraws on one outlined by David Plaisted. The framework, \n\t\thowever, differs in that we systematically apply the abstract \n\t\tinterpretation principle to logic programs. The aim is to give\n\t\ta clear presentation and to facilitate justification of the \n\t\tsoundness of the method.},\n  keywords  = {Abstract interpretation, Logic programming, Prolog, Unification},\n}\n\n</pre>\n</div>\n\n\n<div class=\"well well-small bibbase\" data-type=\"abstract\"\n     style=\"display:none\">\n  The occur check in Robinson unification is superfluous in most unifications that take place in practice. The present paper is concerned with the problem of determining circumstances under which the occur may safely be dispensed with. The method given draws on one outlined by David Plaisted. The framework, however, differs in that we systematically apply the abstract interpretation principle to logic programs. The aim is to give a clear presentation and to facilitate justification of the soundness of the method.\n</div>\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n  <div class=\"bibbase_group_whole\" id=\"group_1985\">\n    <div class=\"bibbase_group\"\n      onclick=\"toggleGroup('group_1985')\"\n      onkeypress=\"toggleGroup('group_1985')\"\n      tabindex=\"0\">\n      <i class=\"fa fa-angle-down bibbase_group_head_icon\"></i>&nbsp;\n      <span>1985</span>\n      <span class=\"bibbase_group_count\">\n        \n        (2)\n        \n      </span>\n    </div>\n    <div class=\"bibbase_group_body\">\n      \n  \n  <div class=\"bibbase_paper\" id=\"jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergenerator-1985\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Experiment in Partial Evaluation: The Generation of a Compiler Generator.\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Jones, N. D.; Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  In Jouannaud, J., editor(s), <i>Rewriting Techniques and Applications</i>, volume 202, of Lecture Notes in Computer Science, pages 124–140. Springer-Verlag,  1985.\n  <span class=\"note\">Reviewed in Computing Reviews 27(7): 353, 1986</span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1007/3-540-15976-2_6\"\n     onclick=\"log_download('jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergenerator-1985', 'http://doi.org/10.1007/3-540-15976-2_6', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergenerator-1985\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergenerator-1985')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Incollection{Jon-Ses-Son_RTA85,\n  author    = {Neil D. Jones and \n\t\tPeter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {An Experiment in Partial Evaluation:\n\t\t\tThe Generation of a Compiler Generator},\n  editor    = {J.-P. Jouannaud},\n  booktitle = {Rewriting Techniques and Applications},\n  series    = {Lecture Notes in Computer Science},\n  volume    = {202},\n  pages     = {124--140},\n  publisher = {Springer-Verlag},\n  year      = {1985},\n  note      = {Reviewed in Computing Reviews 27(7): 353, 1986},\n  doi       = {10.1007/3-540-15976-2_6},\n  keywords  = {Partial evaluation, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n  <div class=\"bibbase_paper\" id=\"jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergeneratorextendedabstract-1985\">\n  <span class=\"bibbase_paper_titleauthoryear\">\n\n  \n  <span class=\"bibbase_paper_title\">\n  \n  \n  \n  An Experiment in Partial Evaluation: The Generation of a Compiler Generator (Extended Abstract).\n  \n  \n  \n</span>\n\n  <span class=\"bibbase_paper_author\">\n  Jones, N. D.; Sestoft, P.;  and <a class=\"bibbase author link\" href=\"https://people.eng.unimelb.edu.au/harald/\">Søndergaard, H.</a>\n</span>\n\n  \n\n</span>\n\n  <i>SIGPLAN Notices</i>, 20(8): 82–87.  1985.\n  <span class=\"note\"></span>\n\n<span class=\"bibbase_note\"></span>\n\n<br class=\"bibbase_paper_content\"/>\n\n<span class=\"bibbase_paper_content dontprint\">\n\n  \n\n  \n  <a href=\"http://doi.org/10.1145/988346.988358\"\n     onclick=\"log_download('jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergeneratorextendedabstract-1985', 'http://doi.org/10.1145/988346.988358', event.ctrlKey)\"\n     class=\"bibbase doi link\">\n    <span>doi</span></a>\n  &nbsp;\n  \n\n  \n  <a href=\"//bibbase.org/network/publication/jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergeneratorextendedabstract-1985\"\n     class=\"bibbase bibbase_page link\">link</a>\n  &nbsp;\n  \n\n  <a href=\"#\"\n     onclick=\"showBib(event); return false;\"\n     class=\"bibbase bibtex link\">bibtex\n    <i class=\"fa fa-caret-down\"></i></a>\n\n  \n\n  \n\n  <!-- <a class=\"bibbase read link hidden\" -->\n  <!--    href=\"javascript:toggleRead('jones-sestoft-sndergaard-anexperimentinpartialevaluationthegenerationofacompilergeneratorextendedabstract-1985')\" -->\n  <!--    title=\"Marking this paper as read adds it to your library on BibBase.\" -->\n  <!--    > -->\n  <!--   <i class=\"fa fa-check\"></i>&nbsp; -->\n  <!--   <span>mark as read</span> -->\n  <!-- </a> -->\n\n  &nbsp;\n  \n  \n  \n  \n  \n  \n  \n  \n\n</span>\n\n<div class=\"well well-small bibbase\" data-type=\"bibtex\"\n     style=\"display:none\">\n  <pre style=\"white-space: pre-wrap;\">@Article{Jon-Ses-Son_SIGPLANN85,\n  author    = {Neil D. Jones and \n\t\tPeter Sestoft and \n\t\tHarald S{\\o}ndergaard},\n  title     = {An Experiment in Partial Evaluation: The Generation of a \n\t\tCompiler Generator (Extended Abstract)},\n  journal   = {SIGPLAN Notices},\n  volume    = {20},\n  number    = {8},\n  pages     = {82--87},\n  year      = {1985},\n  doi       = {10.1145/988346.988358},\n  keywords  = {Partial evaluation, Program transformation, Compilation},\n}\n\n</pre>\n</div>\n\n\n\n</div>\n\n\n\n\n\n    </div>\n  </div>\n\n\n\n\n  </div>\n\n\n  <!-- Modal -->\n\n  <!-- <iframe id=\"bibbase_network_frame\" -->\n  <!--         src=\"//bibbase.org/network/control\" -->\n  <!--         style=\"display: none;\"> -->\n  <!-- </iframe> -->\n\n</div>\n"}; document.write(bibbase_data.data);