All Stories

  1. Symbolic Specialization of Rewriting Logic Theories with Presto
  2. Optimization of rewrite theories by equational partial evaluation
  3. A partial evaluation methodology for optimizing rewrite theories incrementally
  4. Variant-Based Equational Anti-unification
  5. Order-sorted equational generalization algorithm revisited
  6. Typed Homeomorphic Embedding modulo Algebraic Axioms
  7. Efficient Safety Enforcement for Maude Programs via Program Specialization in the ÁTAME System
  8. A partial evaluation framework for order-sorted equational programs modulo axioms
  9. Symbolic Analysis of Maude Theories with Narval
  10. Static correction of Maude programs with assertions
  11. Imposing assertions in Maude via program transformation
  12. $${\textsf {ACUOS}}^\mathbf {2}$$ : A High-Performance System for Modular ACU Generalization with Subtyping and Inheritance
  13. Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms
  14. Inferring Safe Maude Programs with ÁTAME
  15. Inspecting Maude variants withGLINTS
  16. Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms
  17. Symbolic Abstract Contract Synthesis in a Rewriting Framework
  18. Assertion-based analysis via slicing withABETS(system description)
  19. Debugging Maude programs via runtime assertion checking and trace slicing
  20. Automatic Inference of Specifications in the K Framework
  21. Exploring conditional rewriting logic computations
  22. Combining Runtime Checking and Slicing to Improve Maude Error Diagnosis
  23. Automated abstract certification of non-interference with object aliasing in rewriting logic
  24. A modular order-sorted equational generalization algorithm
  25. A rewriting logic approach to the formal specification and verification of web applications
  26. Using conditional trace slicing for improving Maude programs
  27. ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
  28. Inspecting Rewriting Logic Computations (in a Parametric and Stepwise Way)
  29. Rewriting-based repairing strategies for XML repositories
  30. Preface to the special section on Formal Methods for Industrial Critical Systems (FMICS 2009 + FMICS 2010)
  31. Automatic inference of specifications using matching logic
  32. Theory and Practice of Model Transformations
  33. Slicing-Based Trace Analysis of Rewriting Logic Specifications with i Julienne
  34. Backward Trace Slicing for Conditional Rewrite Theories
  35. Julienne: A Trace Slicer for Conditional Rewrite Theories
  36. Debugging of Web Applications with Web-TLR
  37. Backward Trace Slicing for Rewriting Logic Theories
  38. Datalog-Based Program Analysis with BES and RWL
  39. Logic-Based Program Synthesis and Transformation
  40. An integrated framework for the diagnosis and correction of rule-based programs
  41. Approximating Non-interference and Erasure in Rewriting Logic
  42. Completeness of Unfolding for Rewriting Logic Theories
  43. A compact fixpoint semantics for term rewriting systems
  44. A Tool for Computing the Visual Similarity of Web Pages
  45. Modular termination of basic narrowing and equational unification
  46. A fold/unfold transformation framework for rewrite theories extended to CCT
  47. Abstract Certification of Global Non-interference in Rewriting Logic
  48. Defining Datalog in Rewriting Logic
  49. Model-Checking Web Applications with Web-TLR
  50. On-demand strategy annotations revisited: An improved on-demand evaluation strategy
  51. Transformation and Debugging of Functional Logic Programs
  52. Termination of narrowing revisited
  53. A Tool for Automated Certification of Java Source Code in Maude
  54. DATALOG_SOLVE: A Datalog-Based Demand-Driven Program Analyzer
  55. Order-Sorted Generalization
  56. A Visual Technique for Web Pages Comparison
  57. A Modular Equational Generalization Algorithm
  58. Automated Certification of Non-Interference in Rewriting Logic
  59. Formal Methods for Industrial Critical Systems
  60. Specification and Verification of Web Applications in Rewriting Logic
  61. Using Datalog and Boolean Equation Systems for Program Analysis
  62. An Abstract Generic Framework for Web Site Verification
  63. An Abstract Analysis Framework for Synchronous Concurrent Languages based on source–to–source Transformation
  64. Semantic Verification of Web System Contents
  65. Static Analysis
  66. Termination of Narrowing Using Dependency Pairs
  67. A Framework for Timed Concurrent Constraint Programming with External Functions
  68. Removing redundant arguments automatically
  69. Rule-based verification of Web sites
  70. Preface
  71. Preface
  72. Preface
  73. A semantic framework for the abstract model checking of tccp programs
  74. Specialization of functional logic programs based on needed narrowing
  75. A Rewriting-based Framework for Web Sites Verification
  76. Abstract Model Checking of tccp programs
  77. A Symbolic Model Checker for tccp Programs
  78. Correct and Complete (Positive) Strategy Annotations for OBJ
  79. Rules + strategies for transforming lazy functional logic programs
  80. Verdi: An Automated Tool for Web Sites Verification
  81. Abstract Correction of First-Order Functional Programs
  82. On-demand Evaluation by Program Transformation1 1Work partially supported by CICYT TIC2001-2705-C03-01 and MCYT grants HA2001-0059 and HU2001-0019.
  83. OnDemandOBJ
  84. Uniform Lazy Narrowing
  85. Correction of Functional Logic Programs
  86. Abstract Diagnosis of Functional Programs
  87. Redundancy of Arguments Reduced to Induction
  88. A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenc...
  89. Improving On-Demand Strategy Annotations
  90. Removing Redundant Arguments of Functions*
  91. Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
  92. An Automatic Composition Algorithm for Functional Logic Programs
  93. Un Sistema de Transformación para Programas Multiparadigma
  94. Specialization of inductively sequential functional logic programs
  95. Specialization of inductively sequential functional logic programs
  96. A Partial Evaluation Framework for Curry Programs
  97. A Transformation System for Lazy Functional Logic Programs
  98. UPV-Curry: An Incremental Curry Interpreter
  99. A unifying view of functional and logic program specialization
  100. Partial evaluation of functional logic programs
  101. Improving Control in Functional Logic Program Specialization
  102. Specialization of lazy functional logic programs
  103. Safe folding/unfolding with conditional narrowing
  104. Specialization of lazy functional logic programs
  105. A compositional semantic basis for the analysis of equational Horn programs
  106. Narrowing-driven partial evaluation of functional logic programs
  107. Incremental constraint satisfaction for equational logic programming
  108. Analyses of unsatisfiability for equational logic programming
  109. Compositional analysis for equational Horn programs
  110. Narrowing approximations as an optimization for equational logic programs
  111. Narrowing as an incremental constraint satisfaction algorithm
  112. Detecting Modular ACU Structural Symmetries
  113. Parametric Exploration of Rewriting Logic Computations
  114. Automatic Certification of Java Source Code in Rewriting Logic
  115. Modular Termination of Basic Narrowing
  116. A Fast Algebraic Web Verification Service
  117. A Semi-Automatic Methodology for Repairing FaultyWeb Sites
  118. A compositional semantics for conditional term rewriting systems
  119. Analyses of inconsistency for incremental equational logic programming