All Stories

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