435 results on '"José Meseguer"'
Search Results
2. Equivalence, and Property Internalization and Preservation for Equational Programs.
3. The Maude strategy language.
4. Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification.
5. Optimizing Maude Programs via Program Specialization.
6. Strand Spaces with Choice via a Process Algebra Semantics.
7. Protocol Dialects as Formal Patterns.
8. Building Correct-by-Construction Systems with Formal Patterns.
9. Checking Sufficient Completeness by Inductive Theorem Proving.
10. On Ground Convergence and Completeness of Conditional Equational Program Hierarchies.
11. An Efficient Canonical Narrowing Implementation for Protocol Analysis.
12. Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description).
13. Order-sorted equational generalization algorithm revisited.
14. Bridging the semantic gap between qualitative and quantitative models of distributed systems.
15. Protocol Analysis with Time and Space.
16. Generating Correct-by-Construction Distributed Implementations from Formal Maude Designs.
17. Inductive Reasoning with Equality Predicates, Contextual Rewriting and Variant-Based Simplification.
18. Variant Satisfiability of Parameterized Strings.
19. Variants in the Infinitary Unification Wonderland.
20. Verification of the IBOS Browser Security Properties in Reachability Logic.
21. Protocol Analysis with Time.
22. Symbolic Computation in Maude: Some Tapas.
23. Canonical Narrowing with Irreducibility Constraints as a Symbolic Protocol Analysis Method.
24. Automatic Analysis of Consistency Properties of Distributed Transaction Systems in Maude.
25. ACUOS2: A High-Performance System for Modular ACU Generalization with Subtyping and Inheritance.
26. A Constructor-Based Reachability Logic for Rewrite Theories.
27. Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms.
28. The 2D Dependency Pair Framework for Conditional Rewrite Systems - Part II: Advanced Processors and Implementation Techniques.
29. The Maude strategy language.
30. Variants and satisfiability in the infinitary unification wonderland.
31. Modular Verification of Sequential Composition for Private Channels in Maude-NPA.
32. Generalized Rewrite Theories and Coherence Completion.
33. Proving Ground Confluence of Equational Specifications Modulo Axioms.
34. Formal Modeling and Analysis of the Walter Transactional Data Store.
35. Associative Unification and Symbolic Reasoning Modulo Associativity in Maude.
36. ROLA: A New Distributed Transaction Protocol and Its Formal Analysis.
37. Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA.
38. Formal Design of Cloud Computing Systems in Maude.
39. Symbolic Reasoning Methods in Rewriting Logic and Maude.
40. Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms.
41. Read atomic transactions with prevention of lost updates: ROLA and its formal analysis.
42. Exploring Design Alternatives for RAMP Transactions Through Statistical Model Checking.
43. A Constructor-Based Reachability Logic for Rewrite Theories.
44. Variant-Based Decidable Satisfiability in Initial Algebras with Predicates.
45. Verification of the IBOS Browser Security Properties in Reachability Logic.
46. Protocol Analysis with Time.
47. A partial evaluation framework for order-sorted equational programs modulo axioms.
48. Programming and symbolic computation in Maude.
49. Generalized rewrite theories, coherence completion, and symbolic methods.
50. The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.