The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Salvador Lucas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
    Abstract Correction of OBJ-like Programs. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 2003, pp:422-433 [Conf]
  2. María Alpuente, Salvador Lucas, Santiago Escobar
    An Incremental Needed Narrowing Calculus for Curry. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1999, pp:75-88 [Conf]
  3. Michael Hanus, Salvador Lucas
    A Denotational Semantics for Needed Narrowing. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1996, pp:259-270 [Conf]
  4. Salvador Lucas
    Computational Properties in Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE, 1995, pp:435-446 [Conf]
  5. Salvador Lucas
    Computational Properties of Term Rewriting with Replacement Restrictions. [Citation Graph (0, 0)][DBLP]
    APPIA-GULP-PRODE, 1997, pp:393-404 [Conf]
  6. Salvador Lucas, Javier Oliver
    El lambda-calculo Etiquetado Paralelo (LCEP). [Citation Graph (0, 0)][DBLP]
    GULP-PRODE (1), 1994, pp:125-139 [Conf]
  7. Salvador Lucas
    Needed Reductions with Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    ALP/HOA, 1997, pp:129-143 [Conf]
  8. María Alpuente, Santiago Escobar, Salvador Lucas
    Removing Redundant Arguments of Functions. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:117-131 [Conf]
  9. Cristina Borralleras, Salvador Lucas, Albert Rubio
    Recursive Path Orderings Can Be Context-Sensitive. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:314-331 [Conf]
  10. Michael Hanus, Salvador Lucas
    A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages. [Citation Graph (0, 0)][DBLP]
    Fuji International Symposium on Functional and Logic Programming, 1999, pp:353-368 [Conf]
  11. Salvador Lucas
    Polynomials for Proving Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:318-332 [Conf]
  12. Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
    Context-Sensitive Dependency Pairs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:297-308 [Conf]
  13. Salvador Lucas
    Termination of Context-Sensitive Rewriting by Rewriting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:122-133 [Conf]
  14. María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal
    Specialization of Inductively Sequential Functional Logic Programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 1999, pp:273-283 [Conf]
  15. María Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi, Salvador Lucas
    Abstract Diagnosis of Functional Programs. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:1-16 [Conf]
  16. María Alpuente, Santiago Escobar, Bernhard Gramlich, Salvador Lucas
    Improving On-Demand Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    LPAR, 2002, pp:1-18 [Conf]
  17. Salvador Lucas
    Termination of Rewriting With Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:669-684 [Conf]
  18. Salvador Lucas, José Meseguer
    Termination of Fair Computations in Term Rewriting. [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:184-198 [Conf]
  19. Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain
    Proving termination of membership equational programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 2004, pp:147-158 [Conf]
  20. Salvador Lucas
    Context-Sensitive Computations in Confluent Programs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:408-422 [Conf]
  21. Salvador Lucas
    Transformations for Efficient Evaluations in Functional Programming. [Citation Graph (0, 0)][DBLP]
    PLILP, 1997, pp:127-141 [Conf]
  22. Bernhard Gramlich, Salvador Lucas
    Modular termination of context-sensitive rewriting. [Citation Graph (0, 0)][DBLP]
    PPDP, 2002, pp:50-61 [Conf]
  23. Salvador Lucas
    Termination of On-Demand Rewriting and Termination of OBJ Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:82-93 [Conf]
  24. Bernhard Gramlich, Salvador Lucas
    Generalizing Newman's Lemma for Left-Linear Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:66-80 [Conf]
  25. Salvador Lucas
    Transfinite Rewriting Semantics for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    RTA, 2001, pp:216-230 [Conf]
  26. Salvador Lucas
    Termination of (Canonical) Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2002, pp:296-310 [Conf]
  27. Salvador Lucas
    mu-term: A Tool for Proving Termination of Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    RTA, 2004, pp:200-209 [Conf]
  28. Bernhard Gramlich, Salvador Lucas
    Simple termination of context-sensitive rewriting. [Citation Graph (0, 0)][DBLP]
    ACM SIGPLAN Workshop on Rule-Based Programming, 2002, pp:29-42 [Conf]
  29. María Alpuente, Santiago Escobar, Salvador Lucas
    UPV-CURRY: An Incremental CURRY Interpreter. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1999, pp:331-339 [Conf]
  30. Salvador Lucas
    Fundamentals of Context=Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1995, pp:405-412 [Conf]
  31. Salvador Lucas
    Efficient Strong Sequentiality Using Replacement Restrictions. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1997, pp:489-496 [Conf]
  32. Salvador Lucas, Javier Oliver
    A New Proposal of Concurrent Process Calculus. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1996, pp:385-392 [Conf]
  33. María Alpuente, Santiago Escobar, Salvador Lucas
    Redundancy Analyses in Term Rewriting. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:309-323 [Conf]
  34. Salvador Lucas
    Strong and NV-sequentiality of constructor systems. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:253-267 [Conf]
  35. Salvador Lucas
    Redundant arguments in infinitary rewriting. [Citation Graph (0, 0)][DBLP]
    WFLP, 2000, pp:340-343 [Conf]
  36. Salvador Lucas
    Rewriting-based navigation of Web sites. [Citation Graph (0, 0)][DBLP]
    WWV, 2005, pp:157-160 [Conf]
  37. Salvador Lucas
    On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2006, v:17, n:1, pp:49-73 [Journal]
  38. María Alpuente, Michael Hanus, Salvador Lucas, Germán Vidal
    Specialization of Functional Logic Programs Based on Needed Narrowing [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  39. María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas
    Abstract correction of first-order functional programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:3, pp:- [Journal]
  40. Sergio Antoy, Salvador Lucas
    Demandness in Rewriting and Narrowing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:76, n:, pp:- [Journal]
  41. María Alpuente, Rachid Echahed, Santiago Escobar, Salvador Lucas
    Redundancy of Arguments Reduced to Induction. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:76, n:, pp:- [Journal]
  42. María Alpuente, Santiago Escobar, Salvador Lucas
    Correct and Complete (Positive) Strategy Annotations for OBJ. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:71, n:, pp:- [Journal]
  43. María Alpuente, Santiago Escobar, Salvador Lucas
    OnDemandOBJ: A Laboratory for Strategy Annotations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:2, pp:- [Journal]
  44. María Alpuente, Santiago Escobar, Salvador Lucas
    On-demand Evaluation by Program Transformation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:2, pp:- [Journal]
  45. Francisco Durán, Santiago Escobar, Salvador Lucas
    New Evaluation Commands for Maude Within Full Maude. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:117, n:, pp:263-284 [Journal]
  46. Francisco Durán, Santiago Escobar, Salvador Lucas
    On-demand Evaluation for Maude. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:1, pp:25-39 [Journal]
  47. Bernhard Gramlich, Salvador Lucas
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:6, pp:- [Journal]
  48. Bernhard Gramlich, Salvador Lucas
    3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:4, pp:- [Journal]
  49. Salvador Lucas
    Lazy Rewriting and Context-Sensitive Rewriting. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:64, n:, pp:- [Journal]
  50. Salvador Lucas
    Strategies in Programming Languages Today. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:124, n:2, pp:113-118 [Journal]
  51. Salvador Lucas
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:137, n:1, pp:1-3 [Journal]
  52. Salvador Lucas
    Rewriting-Based Navigation of Web Sites: Looking for Models and Logics. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:157, n:2, pp:79-85 [Journal]
  53. Salvador Lucas
    Context-Sensitive Rewriting Strategies. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:294-343 [Journal]
  54. Salvador Lucas
    Proving termination of context-sensitive rewriting by transformation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:12, pp:1782-1846 [Journal]
  55. Michael Hanus, Salvador Lucas, Aart Middeldorp
    Strongly Sequential and Inductively Sequential Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:1-8 [Journal]
  56. Salvador Lucas
    Strong and NV-sequentiality of constructor systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:4, pp:191-201 [Journal]
  57. Salvador Lucas
    Root-Neededness and Approximations of Neededness. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:5, pp:245-254 [Journal]
  58. Salvador Lucas, Claude Marché, José Meseguer
    Operational termination of conditional term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:4, pp:446-453 [Journal]
  59. Michael Hanus, Salvador Lucas
    An Evaluation Semantics for Narrowing-Based Functional Logic Languages. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2001, v:2001, n:2, pp:- [Journal]
  60. Salvador Lucas
    Context-sensitive Computations in Functional and Functional Logic Programs. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1998, v:1998, n:1, pp:- [Journal]
  61. Bernhard Gramlich, Salvador Lucas
    Reduction strategies in rewriting and programming. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2005, v:40, n:1, pp:745-747 [Journal]
  62. Bernhard Gramlich, Salvador Lucas
    1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:57, n:, pp:- [Journal]
  63. María Alpuente, Salvador Lucas, Michael Hanus, Germán Vidal
    Specialization of functional logic programs based on needed narrowing. [Citation Graph (0, 0)][DBLP]
    TPLP, 2005, v:5, n:3, pp:273-303 [Journal]
  64. Manuel Clavel, Francisco Durán, Joe Hendrix, Salvador Lucas, José Meseguer, Peter Csaba Ölveczky
    The Maude Formal Tool Environment. [Citation Graph (0, 0)][DBLP]
    CALCO, 2007, pp:173-178 [Conf]
  65. Beatriz Alarcón, Salvador Lucas
    Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs. [Citation Graph (0, 0)][DBLP]
    FroCos, 2007, pp:73-87 [Conf]
  66. Salvador Lucas
    Practical use of polynomials over the reals in proofs of termination. [Citation Graph (0, 0)][DBLP]
    PPDP, 2007, pp:39-50 [Conf]
  67. María Alpuente, Santiago Escobar, Salvador Lucas
    Removing Redundant Arguments Automatically [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  68. Beatriz Alarcón, Raúl Gutiérrez, José Iborra, Salvador Lucas
    Proving Termination of Context-Sensitive Rewriting with MU-TERM. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:188, n:, pp:105-115 [Journal]
  69. Beatriz Alarcón, Raúl Gutiérrez, Salvador Lucas
    Improving the Context-sensitive Dependency Graph. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:188, n:, pp:91-103 [Journal]

  70. Search Techniques for Rational Polynomial Orders. [Citation Graph (, )][DBLP]


  71. From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals. [Citation Graph (, )][DBLP]


  72. MTT: The Maude Termination Tool (System Description). [Citation Graph (, )][DBLP]


  73. Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. [Citation Graph (, )][DBLP]


  74. Termination Modulo Combinations of Equational Theories. [Citation Graph (, )][DBLP]


  75. Improving Context-Sensitive Dependency Pairs. [Citation Graph (, )][DBLP]


  76. Order-sorted dependency pairs. [Citation Graph (, )][DBLP]


  77. Usable Rules for Context-Sensitive Rewrite Systems. [Citation Graph (, )][DBLP]


  78. From matrix interpretations over the rationals to matrix interpretations over the naturals [Citation Graph (, )][DBLP]


  79. Formal Verification of Websites. [Citation Graph (, )][DBLP]


  80. Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers. [Citation Graph (, )][DBLP]


  81. Operational Termination of Membership Equational Programs: the Order-Sorted Way. [Citation Graph (, )][DBLP]


  82. Web Services and Interoperability for the Maude Termination Tool. [Citation Graph (, )][DBLP]


  83. Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. [Citation Graph (, )][DBLP]


  84. Methods for Proving Termination of Rewriting-based Programming Languages by Transformation. [Citation Graph (, )][DBLP]


  85. Automatic Proofs of Termination With Elementary Interpretations. [Citation Graph (, )][DBLP]


Search in 0.172secs, Finished in 0.174secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002