The following pages link to José Meseguer (Q347381):
Displaying 50 items.
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- The rewriting logic semantics project: a progress report (Q393080) (← links)
- State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
- Order-sorted unification (Q582269) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- Strict coherence of conditional rewriting modulo axioms (Q683741) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude (Q730472) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- (Q789164) (redirect page) (← links)
- Correctness of recursive parallel nondeterministic flow programs (Q789165) (← links)
- Algebraic simulations (Q844884) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← 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)
- The rewriting logic semantics project (Q877024) (← 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)
- Maude's module algebra (Q882456) (← links)
- Petri nets are monoids (Q922720) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Equational abstractions (Q944377) (← links)
- An algebraic semantics for MOF (Q973052) (← links)
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. (Q997833) (← links)
- A rewriting logic approach to operational semantics (Q1012130) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- Order completion monads (Q1055871) (← links)
- (Q1145207) (redirect page) (← links)
- Varieties of chain-complete algebras (Q1145208) (← links)
- Algebras with actions and automata (Q1156864) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations (Q1196302) (← links)
- Final algebras, cosemicomputable algebras and degrees of unsolvability (Q1199822) (← links)
- May I borrow your logic? (Transporting logical structures along maps) (Q1391728) (← links)
- Reflection in conditional rewriting logic (Q1608918) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Rewriting logic: Roadmap and bibliography (Q1615001) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- A constructor-based reachability logic for rewrite theories (Q1671153) (← links)
- Variant-based decidable satisfiability in initial algebras with predicates (Q1671164) (← links)
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems (Q1803659) (← links)
- Functorial models for Petri nets (Q1854467) (← links)
- Structured theories and institutions (Q1884906) (← links)
- Axiomatizing the algebra of net computations and processes (Q1901718) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Folding variant narrowing and optimal variant termination (Q1931909) (← links)
- Rewriting semantics of production rule sets (Q1931912) (← links)
