The following pages link to Maude (Q18367):
Displaying 50 items.
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Replicated data types that unify eventual consistency and observable atomic consistency (Q780057) (← links)
- Dedicated microprocessors for realtime identification of multivariable systems (Q786742) (← links)
- Two case studies of semantics execution in Maude: CCS and LOTOS (Q816216) (← links)
- Towards a trustworthy semantics-based language framework via proof generation (Q832282) (← links)
- Invariant-driven specifications in Maude (Q838161) (← links)
- Algebraic simulations (Q844884) (← links)
- Directly reflective meta-programming (Q848742) (← links)
- Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Formal analysis of Kerberos 5 (Q860899) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic (Q875516) (← links)
- A rewriting logic framework for operational semantics of membrane systems (Q877021) (← links)
- The rewriting logic semantics project (Q877024) (← links)
- SOS formats and meta-theory: 20 years after (Q877025) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types (Q880987) (← links)
- A \(\rho\)-calculus of explicit constraint application (Q880989) (← links)
- Maude's module algebra (Q882456) (← links)
- Modeling and verification of real-time systems based on equations (Q882458) (← links)
- Strategy based semantics for mobility with time and access permissions (Q890480) (← links)
- Compositional reasoning about active objects with shared futures (Q890481) (← links)
- Combining behavioural types with security analysis (Q890614) (← links)
- On the weaving process of aspect-oriented product family algebra (Q898609) (← links)
- Incremental model checking of delta-oriented software product lines (Q898621) (← links)
- Formal probabilistic analysis of detection properties in wireless sensor networks (Q903510) (← links)
- A timed semantics of Orc (Q935476) (← links)
- Equational abstractions (Q944377) (← links)
- Backwards type analysis of asynchronous method calls (Q953530) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- P systems with control nuclei: the concept (Q987966) (← links)
- An overview of the K semantic framework (Q987974) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude (Q1004068) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- On linear logic planning and concurrency (Q1041042) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- Model-checking user behaviour using interacting components (Q1047208) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Timed rewriting logic with an application to object-based specification (Q1356938) (← links)
- Typed generic traversal with term rewriting strategies (Q1394988) (← links)
