The following pages link to Maude (Q18367):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Contracts as games on event structures (Q272306) (← links)
- Progression and verification of situation calculus agents with bounded beliefs (Q310089) (← links)
- ASM-based formal design of an adaptivity component for a cloud system (Q315283) (← links)
- Verifiable abstractions for contract-oriented systems (Q347375) (← links)
- Amalgamation of domain specific languages with behaviour (Q347380) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- Dynamic rebinding for concurrent object groups: theory and practice (Q347396) (← links)
- A scalable module system (Q391632) (← links)
- Proceedings of the 7th international workshop on rewriting logic and its applications (WRLA 2008), Budapest, Hungary, March 29--30, 2008 (Q392266) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- Model of distributed computing system operation with time (Q395266) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- A functional framework for agent-based models of exchange (Q426933) (← links)
- Connectors as designs: modeling, refinement and test case generation (Q433336) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Formal modeling and validation of a power-efficient grouping protocol for WSNs (Q444471) (← links)
- Efficient general AGH-unification (Q462489) (← links)
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- A metamodel of access control for distributed environments: applications and properties (Q462495) (← links)
- Domain science and engineering from computer science to the sciences of informatics. II: Science (Q464883) (← links)
- Completeness of context-sensitive rewriting (Q477588) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- Program equivalence by circular reasoning (Q493521) (← links)
- A generic framework for symbolic execution: a coinductive approach (Q507361) (← links)
- A language-based approach to modelling and analysis of Twitter interactions (Q511939) (← links)
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- A Maude environment for CafeOBJ (Q520244) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Proving weak properties of rewriting (Q554217) (← links)
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- An algebraic approach to the design of compilers for object-oriented languages (Q607399) (← links)
- Comparing three coordination models: Reo, ARC, and PBRD (Q608351) (← links)
- Foundations of algebraic specification and formal software development. (Q610397) (← links)
- Formal specification of MPI 2.0: case study in specifying a practical concurrent programming API (Q617917) (← links)
- Coinduction for preordered algebra (Q627121) (← links)
- A formal library of set relations and its application to synchronous languages (Q654904) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Behavioral abstraction is hiding information (Q703529) (← links)
- Characterizing and proving operational termination of deterministic conditional term rewriting systems (Q710679) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Structural induction in institutions (Q719243) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude (Q730472) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Language definitions as rewrite theories (Q730476) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- An operational semantics for object-oriented concepts based on the class hierarchy (Q736789) (← links)
- A formalisation of deep metamodelling (Q736852) (← links)
