Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Abstract Interpretation, Symbolic Execution and Constraints.

[BibT_eX]

[DOI]

Roberto Amadini

Proceedings of the Recent Developments in the Design and Implementation of Programming Languages, 2020

2019

Compiling CP subproblems to MDDs and d-DNNFs.

[BibT_eX]

[DOI]

Constraints An Int. J., 2019

Constraint Programming for Dynamic Symbolic Execution of JavaScript.

[BibT_eX]

[DOI]

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Optimal Bounds for Floating-Point Addition in Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

Dissecting Widening: Separating Termination from Information.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018

An iterative approach to precondition inference using constrained Horn clauses.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2018

Reference Abstract Domains and Applications to String Analysis.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Precondition Inference via Partitioning of Initial States.

[BibT_eX]

[DOI]

CoRR, 2018

Machine Learning and Constraint Programming for Relational-To-Ontology Schema Mapping.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Combining String Abstract Domains for JavaScript Analysis: An Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

A Benders Decomposition Approach to Deciding Modular Linear Integer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Minimizing Landscape Resistance for Habitat Conservation.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016

A complete refinement procedure for regular separability of context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Adtpp: lightweight efficient safe polymorphic algebraic data types for C.

[BibT_eX]

[DOI]

Lee Naish

Peter Schachte

Aleck M. MacNally

Softw. Pract. Exp., 2016

An Abstract Domain of Uninterpreted Functions.

[BibT_eX]

[DOI]

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

Exploiting Sparsity in Difference-Bound Matrices.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 23rd International Symposium, 2016

Weighted Spanning Tree Constraint with Explanations.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

A Bounded Path Propagator on Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

Steiner Tree Problems with Side Constraints Using Constraint Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Horn clauses as an intermediate representation for program analysis and transformation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2015

A Tool for Intersecting Context-Free Grammars and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the NASA Formal Methods - 7th International Symposium, 2015

Dauphin: A Signal Processing Language - Statistical Signal Processing Made Easy.

[BibT_eX]

[DOI]

Ross Kyprianou

Peter Schachte

Bill Moran

Proceedings of the 2015 International Conference on Digital Image Computing: Techniques and Applications, 2015

2014

Interval Analysis and Machine Arithmetic: Why Signedness Ignorance Is Bliss.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2014

A Partial-Order Approach to Array Content Analysis.

[BibT_eX]

[DOI]

CoRR, 2014

Analyzing Array Manipulating Programs by Program Transformation.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

2013

Failure tabled constraint logic programming by interpolation.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2013

Unbounded Model-Checking with Interpolation for Regular Language Constraints.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2013

Abstract Interpretation over Non-lattice Abstract Domains.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis - 20th International Symposium, 2013

A low overhead method for recovering unused memory inside regions.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

Solving Difference Constraints over Modular Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

2012

Controlling loops in parallel mercury code.

[BibT_eX]

[DOI]

Paul Bone

Zoltan Somogyi

Peter Schachte

Proceedings of the POPL 2012 Workshop on Declarative Aspects of Multicore Programming, 2012

Towards region-based memory management for Go.

[BibT_eX]

[DOI]

Proceedings of the 2012 ACM SIGPLAN workshop on Memory Systems Performance and Correctness: held in conjunction with PLDI '12, 2012

Signedness-Agnostic Program Analysis: Precise Integer Bounds for Low-Level Code.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011

Estimating the overlap between dependent computations for automatic parallelization.

[BibT_eX]

[DOI]

Paul Bone

Zoltan Somogyi

Peter Schachte

Theory Pract. Log. Program., 2011

2010

An Algorithm for Affine Approximation of Binary Decision Diagrams.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2010

Information loss in knowledge compilation: A comparison of Boolean envelopes.

[BibT_eX]

[DOI]

Artif. Intell., 2010

2009

State Joining and Splitting for the Symbolic Execution of Binaries.

[BibT_eX]

[DOI]

Trevor Hansen

Peter Schachte

Harald Søndergaard

Proceedings of the Runtime Verification, 9th International Workshop, 2009

Boolean Affine Approximation with Binary Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2009, 2009

ParaAJ: toward Reusable and Maintainable Aspect Oriented Programs.

[BibT_eX]

[DOI]

Khalid Al-Jasser

Peter Schachte

Proceedings of the Computer Science 2009, 2009

2008

Binary Decision Diagrams for Affine Approximation

[BibT_eX]

[DOI]

CoRR, 2008

2007

Un-Kleene Boolean equation Solving.

[BibT_eX]

[DOI]

Brian Herlihy

Peter Schachte

Harald Søndergaard

Int. J. Found. Comput. Sci., 2007

Boolean Approximation Revisited.

[BibT_eX]

[DOI]

Peter Schachte

Harald Søndergaard

Proceedings of the Abstraction, 2007

Secure random number agreement for peer-to-peer applications.

[BibT_eX]

[DOI]

Amy Beth Corman

Peter Schachte

Vanessa Teague

Proceedings of the 13th International Conference on Parallel and Distributed Systems, 2007

Suitability of Object and Aspect Oriented Languages for Software Maintenance.

[BibT_eX]

[DOI]

Khalid Al-Jasser

Peter Schachte

Edmund Kazmierczak

Proceedings of the 18th Australian Software Engineering Conference (ASWEC 2007), 2007

A Secure Group Agreement (SGA) Protocol for Peer-to-Peer Applications.

[BibT_eX]

[DOI]

Amy Beth Corman

Peter Schachte

Vanessa Teague

Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

QUIP: A Protocol For Securing Content in Peer-To-Peer Publish/Subscribe Overlay Networks.

[BibT_eX]

[DOI]

Amy Beth Corman

Peter Schachte

Vanessa Teague

Proceedings of the Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30, 2007

2006

Closure Operators for ROBDDs.

[BibT_eX]

[DOI]

Peter Schachte

Harald Søndergaard

Proceedings of the Verification, 2006

Size-Change Termination Analysis in <i>k</i>-Bits.

[BibT_eX]

[DOI]

Michael Codish

Vitaly Lagoon