TechnoLogics-UPV >> Publications


Publications of TechnoLogics-UPV


JOURNAL PAPERS

  • [1] B. Alarcón, R. Gutiérrez, and S. Lucas. Context-sensitive dependency pairs. Information and Computation, 208(8):922-968, 2010.
  • [2] B. Alarcón and S. Lucas. Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting. Electronic Notes in Theoretical Computer Science (ENTCS), 248:3-17. Elsevier, 2009.
  • [3] María Alpuente, Demis Ballis, Francisco J. Correa and Moreno Falaschi. An integrated framework for the diagnosis and correction of rule-based programs. Theoretical Computer Science, 411(47): 4055-4101, 2010.
  • [4] María Alpuente, Marco Comini, Santiago Escobar, Moreno Falaschi and José Iborra. A compact fixpoint semantics for term rewriting systems. Theoretical Computer Science, 411(37): 3348-3371, 2010.
  • [5] M. Alpuente, S. Escobar, B. Gramlich and S. Lucas. On-demand Strategy Annotations Revisited: An improved on-demand evaluation strategy. Theoretical Computer Science, 411(2): 504-541, 2010.
  • [6] María Alpuente, Santiago Escobar and José Iborra. Termination of narrowing revisited. Theoretical Computer Science, 410(46): 4608-4625, 2009.
  • [7] María Alpuente, Santiago Escobar, and José Iborra. Modular Termination of Basic Narrowing and Equational Unification. Logic Journal of the IGPL, doi: 10.1093/jigpal/jzq009, April 2010 Oxford U. Press (UK).
  • [8] María Alpuente and Daniel Romero. A Visual Technique for Web Pages Comparison. Electronic Notes in Theoretical Computer Science (ENTCS), 235:3-18. Elsevier, 2009.
  • [9] María Alpuente, Santiago Escobar, José Meseguer and Pedro Ojeda. Order-Sorted Generalization. Electronic Notes in Theoretical Computer Science (ENTCS), 246:27-38. Elsevier, 2009.
  • [10] Mauricio Alba-Castro, María Alpuente, Santiago Escobar, Pedro Ojeda and Daniel Romero. A Tool for Automated Certification of Java Source Code in Maude. Electronic Notes in Theoretical Computer Science (ENTCS), 248:19-29. Elsevier, 2009.
  • [11] María Alpuente, Marco A. Feliú, Christophe Joubert and Alicia Villanueva. DATALOG SOLVE: A Datalog-Based Demand-Driven Program Analyzer. Electronic Notes in Theoretical Computer Science (ENTCS), 248:57-66. Elsevier, 2009.
  • [12] María Alpuente, María-del-Mar Gallardo, Ernesto Pimentel and Alicia Villanueva. An Abstract Analysis Framework for Synchronous Concurrent Languages based on source-to-source Transformation. Electronic Notes in Theoretical Computer Science (ENTCS), 206:3-21. Elsevier, 2008.
  • [13] Antonio Bella, Cèsar Ferri, José Hernández-Orallo and María José Ramírez-Quintana. Using negotiable features for prescription problems. Computing, 91(2):135-168, 2011.
  • [14] C. Borralleras, S. Lucas, A. Oliveras, Enric Rodríguez-Carbonell, and A. Rubio. SAT modulo linear arithmetic for Solving Polynomial Constraints. Journal of Automated Reasoning, to appear, 2011.
  • [15] F. Durán, S. Lucas, and J. Meseguer. Methods for proving termination of rewriting-based programming languages by transformation. Electronic Notes in Theoretical Computer Science (ENTCS), 248:93-113. Elsevier, 2009.
  • [16] F. Durán, S. Lucas, J. Meseguer, and F. Gutiérrez. Web Services and Interoperability for the Maude Termination Tool. Electronic Notes in Theoretical Computer Science (ENTCS), 248:83-92. Elsevier, 2009.
  • [17] C. Ferri, J. Hernández-Orallo, and R. Modroiu. An experimental comparison of performance measures for classification. Pattern Recognition Letters, 30(1):27-38. Elsevier, 2009.
  • [18] S. Flores, S. Lucas, and A. Villanueva. Formal Verification of Websites. Electronic Notes in Theoretical Computer Science (ENTCS), volume 200, pages 103-118. Elsevier, 2008.
  • [19] José Hernández-Orallo and David L. Dowe. Measuring universal intelligence: Towards an anytime intelligence test. Artif. Intell., 174(18):1508-1539, 2010.
  • [20] A. Lescaylle, and A. Villanueva. A tool for Generating a Symbolic Representation of tccp executions. and Electronic Notes in Theoretical Computer Science (ENTCS), 246(1): 131-145. Elsevier, 2009.
  • [21] Alexei Lescaylle and Alicia Villanueva. The tccp interpreter. Electronic Notes in Theoretical Computer Science (ENTCS), 258(1):63-77, 2009.
  • [22] S. Lucas. Automatic proofs of termination with elementary interpretations. Electronic Notes in Theoretical Computer Science (ENTCS), 258(1):41-61. Elsevier, 2009.
  • [23] S. Lucas and J. Meseguer. Operational Termination of Membership Equational Programs: the Order-Sorted Way. Electronic Notes in Theoretical Computer Science (ENTCS), 238(3):207-225. Elsevier, 2009.

ARTICLES IN NEWSLETTERS

  • [24] M. Alpuente and C. Joubert. Report on Formal Methods for Industrial Critical Systems. ERCIM News 80. Jan. 2010.
  • [25] M. Alpuente and C. Joubert. Formal Methods for Industrial Critical Systems. ERCIM News 76. Jan. 2009.

REVIEWING ARTICLES

  • [26] Jose Hernandez-Orallo. Review on Introduction to statistical relational learning (Adaptive Computation and Machine Learning) by Getoor L., Taskar B., The MIT Press, 2007. 580 pp. Computing Reviews, 2008.
  • [27] Jose Hernandez-Orallo. Review on Learning mazes with aliasing states: an LCS algorithm with associative perception, by Zatuchna Z., Bagnall A. Adaptive Behavior 17 (1): 28-57, 2009. Computing Reviews, 2009.
  • [28] Jose Hernandez-Orallo. Review on Empirical hardness models: methodology and a case study on combinatorial auctions by Leyton-Brown K., Nudelman E., Shoham Y. Journal of the ACM 56 (4): 1-52, 2009. Computing Reviews, 2010.

BOOKS, BOOK CHAPTERS, AND MONOGRAPHS

  • [29] María Alpuente (ed), Logic-Based Program Synthesis and Transformation, 20th International Symposium, LOPSTR 2010, Hagenberg, Austria, Jul 23-25, 2010 (Proc. en LNCS 6564, Springer-Verlag). Lecture Notes in Computer Science:6564. Springer-Verlag, Berlin, 2009.
  • [30] María Alpuente, Byron Cook and Christophe Joubert (eds.), Formal Methods for Industrial Critical Systems, 14th International Workshop, FMICS 2009, Eindhoven, The Netherlands, November 2-3, 2009. Proceedings. Lecture Notes in Computer Science:5825. Springer-Verlag, Berlin, 2009.
  • [31] María Alpuente and Germán Vidal(eds.), Fifteenth International Static Analysis Symposium, Valencia, 16-18 de Julio 2008. Proceedings. Lecture Notes in Computer Science:5079. Springer-Verlag, Berlin, 2008.
  • [32] Mauricio Alba-Castro, María Alpuente and Santiago Escobar. Abstract Certification of Global Noninterference in Rewriting Logic. In Frank S. de Boer, Marcello M. Bonsangue, Stefan Hallerstede and Michael Leuschel (eds.), Formal Methods for Components and Objects, LNCS 6286:105-124. Springer-Verlag, Berlin 2010,
  • [33] María Alpuente, Demis Ballis and Moreno Falaschi. Transformation and Debugging of Functional Logic Programs. In Agostino Dovier and Enrico Pontelli (eds.), A 25-Year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, GULP, LNCS 6125:271-299. Springer-Verlag, Berlin 2010,
  • [34] M. Alpuente, M. Feliu, C. Joubert and A. Villanueva. Datalog-based Program Analysis with BES and RWL. In G. Gottlob (ed.), Datalog 2.0: The resurgence of Datalog in Academia and Industry, Springer LNCS (State of the Art Subseries), To appear 2011.
  • [35] Demis Ballis, and Santiago Escobar (ed). Automated Specification and Verification of Web Sites, 4th Int´l Workshop. Electronic Notes in Theoretical Computer Science, Volume 235, pages 1-152. Elsevier, 2009.
  • [36] Demis Ballis, Santiago Escobar, and Massimo Marchiori (ed). Automated Specification and Verification of Web Sites, 3rd Int´l Workshop. Electronic Notes in Theoretical Computer Science Volume 200, Issue 3, Pages 1-188. Elsevier, 2008.
  • [37] Dan Dougherty, Santiago Escobar (ed). Security and Rewriting Techniques, 3rd Int´l Workshop. Electronic Notes in Theoretical Computer Science, Volume 234, pages 1-114. Elsevier, 2009.
  • [38] Santiago Escobar, Catherine Meadows, and José Meseguer. Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties. FOSAD 2007/2008/2009 Tutorial Lectures, LNCS 5705, pages 1-50. Springer, 2009.

CONFERENCE PAPERS AND INVITED TALKS

    International Conferences

  • [39] B. Alarcón, F. Emmes, C. Fuhs, J. Giesl, R. Gutiérrez, S. Lucas, P. Schneider-Kamp, and R. Thiemann. Improving Context-Sensitive Dependency Pairs. In I. Cervesato, H. Veith, and A. Voronkov, editors, Proc. of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR´08, LNCS 5330:636-651, Springer-Verlag, 2009.
  • [40] B. Alarcón, R. Gutiérrez, S. Lucas and R. Navarro-Marset, Proving Termination Properties with mu-term, Proc. of the 13th International Conference on Algebraic Methodology And Software Technology, AMAST´10, LNCS 6486:201-208, Springer-Verlag, 2011.
  • [41] B. Alarcón, S. Lucas, and J. Meseguer. A Dependency Pair Framework for A∨C-Termination. In Proc of the 8th International Conference on Rewriting Techniques and Applications, WRLA´10, LNCS 6381:36-52, Springer-Verlag, 2010.
  • [42] M. Alba-Castro, M. Alpuente, S. Escobar. Abstract Certification of Global Non-Interference in Rewriting Logic. In proceedings of Software Technologies Concertation on Formal Methods for Components and Objects (FMCO´09), Lecture Notes in Computer Science, Volume 6286/2010, pages 105-124, Springer, 2010.
  • [43] Mauricio Alba-Castro, María Alpuente and Santiago Escobar. Approximating Non-interference and Erasure in Rewriting Logic. In T. Ida, V. Negru, T. Jebelean, D. Petcu, S. Watt and D. Zaharie (eds.), 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing SYNASC 2010, Timisoara, Romania, September 23-26, 2010. IEEE Press, New York, pages 124-132.
  • [44] María Alpuente, Michele Baggi, Demis Ballis, and Moreno Falaschi. Completeness of Unfolding for Rewriting Logic Theories. In T. Ida, V. Negru, T. Jebelean, D. Petcu, S. Watt and D. Zaharie (eds.), 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing SYNASC 2010, Timisoara, Romania, September 23-26, 2010. IEEE Press, New York, pages 116-123.
  • [45] M. Alpuente and D. Romero. A Tool for Computing the Visual Similarity of Web Pages. In M. Nakamura, J. Choe and J. Voas (eds.), 10th International Symposium on Applications and the Internet, SAINT 2010, Seoul, Korea, Jul 19-23, 2010. IEEE Press, New York, pages 45-51.
  • [46] Mauricio Alba-Castro, María Alpuente and Santiago Escobar. Automated certification of Non-Interference in Rewriting Logic. In Formal Methods for Industrial Critical Systems, 13th International Workshop, FMICS 2008, L´Aquila, Italy, September 15-16, 2008, Revised Selected Papers, volume 5596 of Lecture Notes in Computer Science, pages 182-198. Springer, 2009.
  • [47] María Alpuente, Michele Baggi, Demis Ballis, and Moreno Falaschi. A Fold/Unfold Framework for Rewrite Theories and its Application to CCT. ACM Conf. on Partial Eval. and Semantics-Based Program Manipulation, PEPM 2010, pages 43-52. Madrid, Spain, January 2010. ACM Press, 2010.
  • [48] María Alpuente, Demis Ballis, and Daniel Romero. Specification and Verification of Web Applications in Rewriting Logic. In Proc. of the 16th International Symposium on Formal Methods (FM´09), volume 5850 of LNCS, pages 790-805. Springer, 2009.
  • [49] María Alpuente, Marco A. Feliú, Christophe Joubert, and Alicia Villanueva. Using datalog and boolean equation systems for program analysis. In Formal Methods for Industrial Critical Systems, 13th International Workshop, FMICS 2008, L´Aquila, Italy, September 15-16, 2008, Revised Selected Papers, volume 5596 of Lecture Notes in Computer Science, pages 215-231. Springer, 2009.
  • [50] María Alpuente, Marco A. Feliú, Christophe Joubert, and Alicia Villanueva. Defining datalog in rewriting logic. In Proc. of the 19th International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2009 (Coimbra, Portugal), Septembre 2009 (Springer LNCS, To appear, 2010)
  • [51] M. Alpuente, P. Ojeda, D. Romero, D. Ballis and M. Falaschi. An Abstract Generic Framework for Web Site Verification. In Proc. of the 2008 Int´l Symp. on Applications and the Internet, SAINT 2008, pages 104-110. IEEE Computer Society, 2008.
  • [52] M. Alpuente, M. Baggi, D. Ballis, and M. Falaschi. Semantic Verification of Web System Contents, In Proc. the ER ´08 on Advances in Conceptual Modeling - Challenges and Opportunities, LNCS 5232, pages 437-446. Springer, 2008.
  • [53] M. Alpuente, S. Escobar, and J. Iborra. Modular Termination of Basic Narrowing. In Proc. of the 19th Int´l Conf. on Rewriting Techniques and Applications, RTA´08, LNCS 5117, pages 1-16. Springer, 2008.
  • [54] M. Alpuente, S. Escobar, and J. Iborra. Termination of Narrowing Using Dependency Pairs. In Proc. of the 24th International Conference on Logic Programming, ICLP´08, LNCS 5366, pages 317-331. Springer, 2008.
  • [55] María Alpuente, Santiago Escobar, José Meseguer, and Pedro Ojeda. A Modular Equational Generalization Algorithm. In M. Hanus, editor, Revised Selected Papers of the 18th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2008, LNCS 5438, pages 24-39. Springer, 2009.
  • [56] Antonio Bella, Cèsar Ferri Ramirez, José Hernández-Orallo, and M. José Ramírez-Quintana. Data mining strategies for crm negotiation prescription problems. In Trends in Applied Intelligent Systems - 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2010, Proceedings, Part I, volume 6096 of Lecture Notes in Computer Science, pages 520-530. Springer, 2010.
  • [57] Antonio Bella, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. Quantification via probability estimators. In ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, pages 737-742. IEEE Computer Society, 2010.
  • [58] Antonio Bella, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. Negotiation with price-dependent probability models. In Workshop on Agreement Technologies, WAT09, pages 9-20, 2009.
  • [59] Antonio Bella, Cèsar Ferri Ramirez, José Hernández-Orallo, and M. José Ramírez-Quintana. Similarity-binning averaging: A generalisation of binning calibration. In Intelligent Data Engineering and Automated Learning - IDEAL 2009, 10th International Conference, volume 5788 of Lecture Notes in Computer Science, pages 341-349. Springer, 2009.
  • [60] A. Bella, C. Ferri, J. Hernández-Orallo, and M. J. Ramírez-Quintana. Joint Cutoff Probabilistic Estimation using Simulation: A mailing Campaign Application. In Proc. of the 8th International Conference on Intelligent Data Engineering and Automated Learning, LNCS 4881, pages 609-619. Springer, 2007.
  • [61] C. Borralleras, S. Lucas, R. Navarro-Marset, E. Rodríguez-Carbonell, and A. Rubio. Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic. In R.A. Schmidt, editor, Proc. of the 22nd International Conference on Automated Deduction, CADE´09, LNAI 5663:294-305, Springer-Verlag, 2009.
  • [62] Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Pat Lincoln, Narciso Marti-Oliet, José Meseguer and Carolyn Talcott. Unification and Narrowing in Maude 2.4. In proceedings of 20th International Conference on Rewriting Techniques and Applications (RTA´09), LNCS 5595, pages 380-390, 2009. Springer, 2009.
  • [63] F. Durán, S. Lucas, and J. Meseguer. MTT: The Maude Termination Tool. In Proc. of IJCAR´08, LNCS 5195:313-319. Springer-Verlag, 2008.
  • [64] F. Durán, S. Lucas and J. Meseguer. Termination Modulo Combinations of Equational Theories. In S. Ghirardi and R. Sebastiani, editors, Proc. of the 7th International Symposium on Frontiers of Combining Systems, FroCoS´09, LNAI 5749:246-262. Springer-Verlag, 2009.
  • [65] Santiago Escobar, Catherine Meadows, and José Meseguer. State Space Reduction in the Maude-NRL Protocol Analyzer. In proceedings of 13th European Symposium on Research in Computer Security (ESORICS08), LNCS 5283, pages 548-562, 2008. Springer, 2008.
  • [66] S. Escobar, C. Meadows, J. Meseguer S. Santiago Sequential Protocol Composition in Maude-NPA In proceedings of European Symposium on Research in Computer Security (ESORICS 2010), LNCS 6345, pages 303-318. Springer, 2010.
  • [67] Santiago Escobar, José Meseguer, and Ralf Sasse. Effectively Checking or Disproving the Finite Variant Property. In proceedings of 19th International Conference on Rewriting Techniques and Applications (RTA 2008), LNCS 5117, pages 79-93. Springer, 2008.
  • [68] Santiago Escobar, José Meseguer, and Ralf Sasse. Variant Narrowing and Equational Unification. In proceedings of 7th International Workshop on Rewriting Logic and its Applications (WRLA08), Electronic Notes in Theoretical Computer Science, volume 238, issue 3, pages 103-119. Elsevier, 2009.
  • [69] Santiago Escobar, José Meseguer, Ralf Sasse. Folding Variant Narrowing and Optimal Variant Termination In proceedings of 8th International Workshop on Rewriting Logic and its Applications (WRLA 2010), LNCS 6381, pages 52-68. 2010.
  • [70] Vicent Estruch, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. An integrated distance for atoms. In Functional and Logic Programming, 10th International Symposium, FLOPS 2010, Proceedings, volume 6009 of Lecture Notes in Computer Science, pages 150-164. Springer, 2010.
  • [71] V. Estruch, C. Ferri, J. Hernández-Orallo, and M.J. Ramírez-Quintana. Generalisation operators for lists embedded in a metric space. In Approaches and Applications of Inductive Programming, volume 5812 of Lecture Notes in Computer Science, pages 117-139. Springer, 2010.
  • [72] V. Estruch, C. Ferri, J. Hernández-Orallo, and M.J. Ramírez-Quintana. Defining inductive operators using distances over lists. In Emanuel Kitzelmann Ute Schmid and Rinus Plasmeijer, editors, Proc. ACM SIGPLAN Workshop on Approaches and Applications of Inductive Programming (AAIP´09), pages 53-64, 2009.
  • [73] M. A. Feliú, C. Joubert and F. Tarín. Evaluation Strategies for Datalog-based Points-To Analysis. In Proceedings of the 10th International Workshop on Automated Verification of Critical Systems (AVOCS´10). Pages 88-103, 2010.
  • [74] C. Fuhs, R. Navarro-Marset, C. Otto, J. Giesl, S. Lucas, and P. Schneider-Kamp. Search Techniques for Rational Polynomial Orders. In Proc. of the 9th International Conference on Artificial Intelligence and Symbolic Computation, AISC´08, LNAI 5144, pages 109-124. Springer-Verlag, 2008.
  • [75] Ana Funes, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. An instantiation of hierarchical distance-based conceptual clustering for propositional learning. In Advances in Knowledge Discovery and Data Mining, 13th Pacific-Asia Conference, PAKDD 2009, pages 637-646, 2009.
  • [76] A. Funes, C. Ferri, J. Hernández-Orallo, and M. J. Ramírez-Quintana. Hierarchical Distance-Based Conceptual Clustering. In Proc. of the European Conference on Machine Learning and Knowledge Discovery in Database, LNAI 5212, pages 349-364. Springer, 2008.
  • [77] R. Gutiérrez and S. Lucas. Proving Termination in the Context-Sensitive Depedency Pairs Framework. In Proc of the 8th International Workshop on Rewriting Logic and its Applications, WRLA´10, LNCS 6381:19-35, Springer-Verlag, 2010.
  • [78] R. Gutiérrez, S. Lucas, and X. Urbain. Usable Rules for Context-Sensitive Rewrite Systems. In Proc. of the 19th Int´l Conf. on Rewriting Techniques and Applications, RTA´08, LNCS 5117, pages 126-141. Springer-Verlag, 2008.
  • [79] José Hernández-Orallo. A (hopefully) unbiased universal environment class for measuring intelligence of biological and artificial systems jose hernandez-orallo; video. In The Third Conference on Artificial General Intelligence, AGI 2010, volume 10 of Advances in Intelligent Systems Research, pages 182-183. Atlantis Press, 2010.
  • [80] José Hernández-Orallo. On evaluating agent performance in a fixed period of time. In The Third Conference on Artificial General Intelligence, AGI 2010, volume 10 of Advances in Intelligent Systems Research, pages 25-30. Atlantis Press, 2010.
  • [81] J. Iborra. Explicitly Typed Exceptons for Haskell. In Proceedings of the 12th International Symposium on Practical Aspects of Declarative Languages (PADL´10). LNCS, volume 5937, pages 43-57, 2010.
  • [82] J. Iborra, N. Nishida and G. Vidal. Goal-directed and Relative Dependency Pairs for Proving the Termination of Narrowing. In Proceedings of the 19th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR´09). LNCS, volume 6037, pages 52-66, 2010.
  • [83] Mike Katelman, José Meseguer, and Santiago Escobar. Directed-Logical Testing for Functional Verification of Microprocessors. In proceedings of 6th ACM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE´2008), pages 89-100, ISBN 978-1-4244-2417-7. ACM Press, 2008.
  • [84] Alexei Lescaylle and Alicia Villanueva. Automated Verification of Security Protocols in tccp. In Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP´10), pages 139-155, 2010.
  • [85] Alexei Lescaylle and Alicia Villanueva. Bridging the Gap between two Concurrent Constraint Languages. In Proceedings of the 17th International Workshop on Functional and (Constraint) Logic Programming (WFLP´10), Post-proceedings LNCS, volume 6559, pages 155-173, 2011.
  • [86] S. Lucas and J. Meseguer. Order-Sorted Dependency Pairs. In Proc. of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, PPDP´08, pages 108-119. ACM Press, 2008.
  • [87] S. Lucas and R. Peña. Rewriting Techniques for Analysing Termination and Complexity Bounds of Safe Programs. In M. Hanus, editor, Proc. of 18th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2008, Technical Report DSIC-II/09/08, pages 43-57, 2008.
  • [88] Fernando Martínez-Plumed, Vicent Estruch, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. Newton trees. In Australasian Conference on Artificial Intelligence, volume 6464 of Lecture Notes in Computer Science, pages 174-183. Springer, 2010.
  • [89] Ralf Sasse, Santiago Escobar, Catherine Meadows, José Meseguer. Protocol Analysis Modulo Combination of Theories: A Case Study in Maude-NPA. In proceedings of 6th International Workshop on Security and Trust Management (STM´10), LNCS to appear, 2010.

    • National Conferences

  • [90] B. Alarcón, S. Lucas, R. Navarro-Marset. Using Matrix Interpretations over the Reals in Proofs of Termination. In F. Lucio, G. Moreno, R. Peña, editors Proc. of IX Jornadas sobre Programación y Lenguajes, PROLE 2009. pages 255-264, 2009.
  • [91] María Alpuente, Marco A. Feliú, Christophe Joubert, and Alicia Villanueva. Implementing datalog in maude. In Paqui Lucio, Ginés Moreno, and Ricardo Pe na, editors, Proceedings of the IX Jornadas sobre Programación y Lenguajes PROLE´2009 and I Taller de Programación Funcional TPF´2009 (San Sebastián, Spain), pages 15-22. Gráficas Michelena, September 2009.
  • [92] M. A. Feliú, C. Joubert and F. Tarín. Efficient BES-based Bottom-Up Evaluation of Datalog Programs. In X Jornadas sobre Programacin y Lenguajes (PROLE 2010). Pages 166-176, 2010.
  • [93] R. Gutiérrez, S. Lucas. Mechanizing Proofs of Termination in the Context-Sensitive Dependency Pairs Framework. In F. Lucio, G. Moreno, R. Peña, editors Proc. of IX Jornadas sobre Programación y Lenguajes, PROLE 2009. pages 265-274, 2009.
  • [94] J. Iborra. Explicitly Typed Exceptions for Haskell. I Taller de Programación Funcional. Pages 23-30, 2009.
  • [95] S. Lucas, R. Montagut, R. Navarro-Marset, and M. Salido. A hybrid approach to polynomial constraint solving for termination tools. In Proc. of VIII Jornadas sobre Programación y Lenguajes (PROLE 2008). 2008.
  • [96] Fernando Martínez-Plumed, Vicent Estruch, César Ferri, José Hernández-Orallo, and M. José Ramírez-Quintana. Tratamiento de valores faltantes en newton trees. In V Simposio de Teoría y Aplicaciones de Minería de Datos, pages 183-192. Ibergarceta publicaciones, 2010.
  • [97] S. Santiago, C. Talcott, S. Escobar, C. Meadows, and J. Meseguer. A Graphical User Interface for Maude-NPA. In IX Jornadas sobre Programaci?n y Lenguajes (PROLE 2009). Electronic Notes in Theoretical Computer Science, volume 258, number 1, pages 3-20. Elsevier, 2009.