Maude is a high-performance reflective language and system supporting both equational and rewriting logic specification and programming for a wide range of applications. Maude has been influenced in important ways by the OBJ3 language, which can be regarded as an equational logic sublanguage. Besides supporting equational specification and programming, Maude also supports rewriting logic computation.

References in zbMATH (referenced in 666 articles , 3 standard articles )

Showing results 1 to 20 of 666.
Sorted by year (citations)

1 2 3 ... 32 33 34 next

  1. Blondin, Maude Josée: Controller tuning optimization methods for multi-constraints and nonlinear systems. A metaheuristic approach (2021)
  2. Dokter, Kasper; Gadducci, Fabio; Lion, Benjamin; Santini, Francesco: Soft constraint automata with memory (2021)
  3. Alpuente, M.; Ballis, D.; Sapiña, J.: Efficient safety enforcement for Maude programs via program specialization in the \textsfÁTAME system (2020)
  4. Alpuente, M.; Cuenca-Ortega, A.; Escobar, S.; Meseguer, J.: A partial evaluation framework for order-sorted equational programs modulo axioms (2020)
  5. Carette, Jacques; Farmer, William M.; Sharoda, Yasmine: Leveraging the information contained in theory presentations (2020)
  6. De Nicola, Rocco; Ferrari, Gianluigi; Pugliese, Rosario; Tiezzi, Francesco: A formal approach to the engineering of domain-specific distributed systems (2020)
  7. Diaconescu, Răzvan: Introducing (H), an institution-based formal specification and verification language (2020)
  8. Durán, Francisco; Eker, Steven; Escobar, Santiago; Martí-Oliet, Narciso; Meseguer, José; Rubio, Rubén; Talcott, Carolyn: Programming and symbolic computation in Maude (2020)
  9. Durán, Francisco; Meseguer, José; Rocha, Camilo: Ground confluence of order-sorted conditional specifications modulo axioms (2020)
  10. Eeralla, Ajay Kumar; Lynch, Christopher: Bounded ACh unification (2020)
  11. Găină, Daniel; Nakamura, Masaki; Ogata, Kazuhiro; Futatsugi, Kokichi: Stability of termination and sufficient-completeness under pushouts via amalgamation (2020)
  12. Lucas, Salvador: Using well-founded relations for proving operational termination (2020)
  13. Lucas, Salvador; Meseguer, José; Gutiérrez, Raúl: The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (2020)
  14. Martín, Óscar; Verdejo, Alberto; Martí-Oliet, Narcisco: Compositional specification in rewriting logic (2020)
  15. Meseguer, José: Generalized rewrite theories, coherence completion, and symbolic methods (2020)
  16. Miranda-Perea, Favio E.; González Huesca, Lourdes del Carmen; Linares-Arévalo, P. Selene: Interactive proof-search for equational reasoning (2020)
  17. Quaresma, Pedro: Automated deduction and knowledge management in geometry (2020)
  18. Zhao, Xin; Haller, Philipp: Replicated data types that unify eventual consistency and observable atomic consistency (2020)
  19. Alpuente, María; Ballis, Demis; Cuenca-Ortega, Angel; Escobar, Santiago; Meseguer, José: (\mathsfACUOS^\mathbf2): a high-performance system for modular ACU generalization with subtyping and inheritance (2019)
  20. Alpuente, María; Escobar, Santiago; Sapina, Julia; Ballis, Demis: Symbolic analysis of Maude theories with Narval (2019)

1 2 3 ... 32 33 34 next