• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 51 matches

• 2024
• 
  Étienne Payet:
  Non-termination in Term Rewriting and Logic Programming. J. Autom. Reason. 68(1): 4 (2024)
• 
  Fred Mesnard, Thierry Marianne, Étienne Payet:
  Automated Theorem Proving for Prolog Verification. LPAR Complementary Volume 2024: 137-151
• 2023
• 
  Étienne Payet:
  Binary Non-Termination in Term Rewriting and Logic Programming. CoRR abs/2307.11549 (2023)
• 
  Akihisa Yamada, Benjamin Lucien Kaminski, Dieter Hofbauer, Fred Mesnard, Étienne Payet:
  The 19th International Workshop on Termination (WST 2023): Preface, Invited Talk Abstract, and Tool Descriptions. CoRR abs/2308.09536 (2023)
• 
  Étienne Payet:
  Non-Termination in Term Rewriting and Logic Programming. CoRR abs/2312.13949 (2023)
• 2022
• 
  Étienne Payet, David J. Pearce, Fausto Spoto:
  On the Termination of Borrow Checking in Featherweight Rust. NFM 2022: 411-430
• 2020
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Selective Unification in (Constraint) Logic Programming. Fundam. Informaticae 177(3-4): 359-383 (2020)
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Concolic Testing in CLP. Theory Pract. Log. Program. 20(5): 671-686 (2020)
• 
  Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
  An SMT-Based Concolic Testing Tool for Logic Programs. FLOPS 2020: 215-219
• 
  Sophie Fortz, Fred Mesnard, Étienne Payet, Gilles Perrouin, Wim Vanhoof, Germán Vidal:
  An SMT-Based Concolic Testing Tool for Logic Programs. CoRR abs/2002.07115 (2020)
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Concolic Testing in CLP. CoRR abs/2008.00421 (2020)
• 2018
• 
  Étienne Payet, Fausto Spoto:
  Checking Array Bounds by Abstract Interpretation and Symbolic Expressions. IJCAR 2018: 706-722
• 
  Étienne Payet:
  Guided Unfoldings for Finding Loops in Standard Term Rewriting. LOPSTR 2018: 22-37
• 
  Étienne Payet:
  Guided Unfoldings for Finding Loops in Standard Term Rewriting. CoRR abs/1808.05065 (2018)
• 2017
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Selective unification in constraint logic programming. PPDP 2017: 115-126
• 2016
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  On the Completeness of Selective Unification in Concolic Testing of Logic Programs. LOPSTR 2016: 205-221
• 
  Frédéric Mesnard, Étienne Payet, Wim Vanhoof:
  Towards a framework for algorithm recognition in binary code. PPDP 2016: 202-213
• 
  Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
  Termination analysis of floating-point programs using parameterizable rational approximations. SAC 2016: 1674-1679
• 
  Fonenantsoa Maurica, Frédéric Mesnard, Étienne Payet:
  On the Linear Ranking Problem for Simple Floating-Point Loops. SAS 2016: 300-316
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  On the Completeness of Selective Unification in Concolic Testing of Logic Programs. CoRR abs/1608.03054 (2016)
• 2015
• 
  Fred Mesnard, Étienne Payet:
  A second-order formulation of non-termination. Inf. Process. Lett. 115(11): 882-885 (2015)
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Concolic testing in logic programming. Theory Pract. Log. Program. 15(4-5): 711-725 (2015)
• 
  Fred Mesnard, Étienne Payet, Germán Vidal:
  Concolic Testing in Logic Programming. CoRR abs/1507.05454 (2015)
• 2014
• 
  Étienne Payet, Fausto Spoto:
  An operational semantics for android activities. PEPM 2014: 121-132
• 
  Fred Mesnard, Étienne Payet:
  A Second-Order Formulation of Non-Termination. CoRR abs/1412.3271 (2014)
• 
  Étienne Payet, Frédéric Mesnard:
  Non-termination of Dalvik bytecode via compilation to CLP. CoRR abs/1412.3729 (2014)
• 
  Étienne Payet, Fred Mesnard, Fausto Spoto:
  Non-Termination Analysis of Java Bytecode. CoRR abs/1401.5292 (2014)
• 2012
• 
  Étienne Payet, Fausto Spoto:
  Static analysis of Android programs. Inf. Softw. Technol. 54(11): 1192-1201 (2012)
• 2011
• 
  Étienne Payet, Fausto Spoto:
  Static Analysis of Android Programs. CADE 2011: 439-445
• 2010
• 
  Fausto Spoto, Étienne Payet:
  Magic-sets for localised analysis of Java bytecode. High. Order Symb. Comput. 23(1): 29-86 (2010)

skipping 21 more matches