Étienne Payet

J. Autom. Reason., March, 2024

Automated Theorem Proving for Prolog Verification.

[BibT_eX]

[DOI]

Thierry Marianne

Proceedings of the LPAR 2024 Complementary Volume, Port Louis, Mauritius, May 26-31, 2024, 2024

2023

The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions.

[BibT_eX]

[DOI]

Akihisa Yamada

Benjamin Lucien Kaminski

Dieter Hofbauer

CoRR, 2023

Binary Non-Termination in Term Rewriting and Logic Programming.

[BibT_eX]

[DOI]

CoRR, 2023

2022

On the Termination of Borrow Checking in Featherweight Rust.

[BibT_eX]

[DOI]

David J. Pearce

Proceedings of the NASA Formal Methods - 14th International Symposium, 2022

2020

Concolic Testing in CLP.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2020

Selective Unification in (Constraint) Logic Programming.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

An SMT-Based Concolic Testing Tool for Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Functional and Logic Programming - 15th International Symposium, 2020

2018

Guided Unfoldings for Finding Loops in Standard Term Rewriting.

[BibT_eX]

[DOI]

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

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

2016

On the Linear Ranking Problem for Simple Floating-Point Loops.

[BibT_eX]

[DOI]

Fonenantsoa Maurica

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

Termination analysis of floating-point programs using parameterizable rational approximations.

[BibT_eX]

[DOI]

Fonenantsoa Maurica

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016

Towards a framework for algorithm recognition in binary code.

[BibT_eX]

[DOI]

Wim Vanhoof

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

On the Completeness of Selective Unification in Concolic Testing of Logic Programs.

[BibT_eX]

[DOI]

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

2015

Concolic testing in logic programming.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2015

A second-order formulation of non-termination.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

2014

Non-Termination Analysis of Java Bytecode.

[BibT_eX]

[DOI]

CoRR, 2014

Non-termination of Dalvik bytecode via compilation to CLP.

[BibT_eX]

[DOI]

CoRR, 2014

An operational semantics for android activities.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN 2014 workshop on Partial evaluation and program manipulation, 2014

2012

Static analysis of Android programs.

[BibT_eX]

[DOI]

Inf. Softw. Technol., 2012

2010

A termination analyzer for Java bytecode based on path-length.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2010

Magic-sets for localised analysis of Java bytecode.

[BibT_eX]

[DOI]

High. Order Symb. Comput., 2010

2009

A non-termination criterion for binary constraint logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2009

Experiments with Non-Termination Analysis for Java Bytecode.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

2008

Loop detection in term rewriting using the eliminating unfoldings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2007

Magic-Sets Transformation for the Analysis of Java Bytecode.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 14th International Symposium, 2007

2006

Nontermination inference of logic programs.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2006

Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator.

[BibT_eX]

[DOI]

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

2005

An Improved Non-Termination Criterion for Binary Constraint Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Workshop on Logic Programming Environments, 2005

2004

Non-Termination Inference of Logic Programs

[BibT_eX]

[DOI]

CoRR, 2004

Non-termination Inference for Constraint Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 11th International Symposium, 2004

Inférence de non-terminaison pour les programmes logiques avec contraintes.

[BibT_eX]

Proceedings of the Programmation en logique avec contraintes, 2004

2002

A Generalization of the Lifting Lemma for Logic Programming

[BibT_eX]

[DOI]

CoRR, 2002

Detecting Optimal Termination Conditions of Logic Programs.

[BibT_eX]

[DOI]

Ulrich Neumerkel

Proceedings of the Static Analysis, 9th International Symposium, 2002

Non-Termination Inference for Optimal Termination Conditions of Logic Programs.

[BibT_eX]

Ulrich Neumerkel

Proceedings of the Programmation en logique avec contraintes, 2002

2001

cTI: un outil pour l'inférence de conditions optimales de terminasion pour Prolog.

[BibT_eX]

Ulrich Neumerkel

Proceedings of the Programmation en logique avec contraintes, Actes des JFPLC'2001, 24 avril, 2001

2000

Produit Synchronisé pour Quelques Classes de Graphes Infinis.

[BibT_eX]

[DOI]

PhD thesis, 2000

Thue Specifications, Infinite Graphs and Synchronized Product.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2000

1999

Synchronized Product of Linear Bounded Machines.

[BibT_eX]

[DOI]

Teodor Knapik

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

The Full Quotient and its Closure Property for Regular Languages.

[BibT_eX]

[DOI]

Teodor Knapik