Conferences in DBLP
Randal E. Bryant Formal Verification of Infinite State Systems Using Boolean Methods. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Codish , Vitaly Lagoon , Peter J. Stuckey Solving Partial Order Constraints for LPO Termination. [Citation Graph (0, 0)][DBLP ] Conf ] Traian-Florin Serbanuta , Grigore Rosu Computationally Equivalent Elimination of Conditions. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Antoy , Daniel W. Brown , Su-Hui Chiang On the Correctness of Bubbling. [Citation Graph (0, 0)][DBLP ] Conf ] Joe Hendrix , Hitoshi Ohsaki , Mahesh Viswanathan Propositional Tree Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Gramlich , Salvador Lucas Generalizing Newman's Lemma for Left-Linear Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Piotr Hoffman Unions of Equational Monadic Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Jouannaud Modular Church-Rosser Modulo. [Citation Graph (0, 0)][DBLP ] Conf ] Yannick Chevalier , Michaël Rusinowitch Hierarchical Combination of Intruder Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Yohan Boichut , Thomas Genet Feasible Trace Reconstruction for Rewriting Approximations. [Citation Graph (0, 0)][DBLP ] Conf ] Ahmed Bouajjani , Javier Esparza Rewriting Models of Boolean Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvain Salvati Syntactic Descriptions: A Type System for Solving Matching Equations in the Linear lambda -Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Yo Ohta , Masahito Hasegawa A Terminating and Confluent Linear Lambda Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ariel Arbiser , Alexandre Miquel , Alejandro Ríos A Lambda-Calculus with Constructors. [Citation Graph (0, 0)][DBLP ] Conf ] José Espírito Santo , Maria João Frade , Luis Pinto Structural Proof Theory as Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Obua Checking Conservativity of Overloaded Definitions in Higher-Order Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Koprowski Certified Higher-Order Recursive Path Ordering. [Citation Graph (0, 0)][DBLP ] Conf ] Takahito Aoto Dealing with Non-orientable Equations in Rewriting Induction. [Citation Graph (0, 0)][DBLP ] Conf ] Adam Koprowski TPA: Termination Proved Automatically. [Citation Graph (0, 0)][DBLP ] Conf ] Yuki Chiba , Takahito Aoto RAPT: A Program Transformation System Based on Term Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Mathieu Turuani The CL-Atse Protocol Analyser. [Citation Graph (0, 0)][DBLP ] Conf ] Ian Wehrman , Aaron Stump , Edwin M. Westbrook Slothrop: Knuth-Bendix Completion with a Modern Termination Checker. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Giesl , Stephan Swiderski , Peter Schneider-Kamp , René Thiemann Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. [Citation Graph (0, 0)][DBLP ] Conf ] Nao Hirokawa , Aart Middeldorp Predictive Labeling. [Citation Graph (0, 0)][DBLP ] Conf ] Dieter Hofbauer , Johannes Waldmann Termination of String Rewriting with Matrix Interpretations. [Citation Graph (0, 0)][DBLP ] Conf ] Yi Wang , Masahiko Sakai Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Bournez , Florent Garnier Proving Positive Almost Sure Termination Under Strategies. [Citation Graph (0, 0)][DBLP ] Conf ] Harrie Jan Sander Bruggink A Proof of Finite Family Developments for Higher-Order Rewriting Using a Prefix Property. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Pierre Jouannaud , Albert Rubio Higher-Order Orderings for Normal Rewriting. [Citation Graph (0, 0)][DBLP ] Conf ] Jordi Levy , Manfred Schmidt-Schauß , Mateu Villaret Bounded Second-Order Unification Is NP-Complete. [Citation Graph (0, 0)][DBLP ] Conf ] 