Entity usage

Showing below up to 47 results in range #1 to #47.

1. Proving ground confluence of equational specifications modulo axioms: Label: en
2. Generalized rewrite theories and coherence completion: Label: en
3. Proving structural properties of sequent systems in rewriting logic: Label: en
4. Associative unification and symbolic reasoning modulo associativity in Maude: Label: en
5. Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT: Label: en
6. Approximating any logic program by a CS-program: Label: en
7. Real-time rewriting logic semantics for spatial concurrent constraint programming: Label: en
8. Uniform strong normalization for multi-discipline calculi: Label: en
9. Parameterized programming for compositional system specification: Label: en
10. The Third Rewrite Engines Competition: Label: en
11. Enhancing the Debugging of Maude Specifications: Label: en
12. The Linear Temporal Logic of Rewriting Maude Model Checker: Label: en
13. Multiset Rewriting: A Semantic Framework for Concurrency with Name Binding: Label: en
14. On the Behavioral Semantics of Real-Time Domain Specific Visual Languages: Label: en
15. A Formal Pattern Architecture for Safe Medical Systems: Label: en
16. Concurrent Rewriting Semantics and Analysis of Asynchronous Digital Circuits: Label: en
17. Collecting Semantics under Predicate Abstraction in the K Framework: Label: en
18. K-Maude: A Rewriting Based Tool for Semantics of Programming Languages: Label: en
19. A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories: Label: en
20. A Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications: Label: en
21. Folding Variant Narrowing and Optimal Variant Termination: Label: en
22. A Dependency Pair Framework for A ∨ C-Termination: Label: en
23. Proving Termination in the Context-Sensitive Dependency Pair Framework: Label: en
24. Twenty Years of Rewriting Logic: Label: en
25. Rewriting, Inference, and Proof: Label: en
26. A Rule-Based Framework for Building Superposition-Based Decision Procedures: Label: en
27. Timed CTL Model Checking in Real-Time Maude: Label: en
28. Order-Sorted Equality Enrichments Modulo Axioms: Label: en
29. Model Checking LTLR Formulas under Localized Fairness: Label: en
30. A Framework for Mobile Ad hoc Networks in Real-Time Maude: Label: en
31. Towards Static Analysis of Functional Programs Using Tree Automata Completion: Label: en
32. Modelling and Verifying Contract-Oriented Systems in Maude: Label: en
33. Infinite-State Model Checking of LTLR Formulas Using Narrowing: Label: en
34. Language Definitions as Rewrite Theories: Label: en
35. Conditional Narrowing Modulo in Rewriting Logic and Maude: Label: en
36. Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude?: Label: en
37. Composition of Graph-Transformation-Based DSL Definitions by Amalgamation: Label: en
38. Rewriting Modulo SMT and Open System Analysis: Label: en
39. 2D Dependency Pairs for Proving Operational Termination of CTRSs: Label: en
40. Strong and Weak Operational Termination of Order-Sorted Rewrite Theories: Label: en
41. Metalevel Algorithms for Variant Satisfiability: Label: en
42. Maximally Parallel Contextual String Rewriting: Label: en
43. Proving Reachability-Logic Formulas Incrementally: Label: en
44. Egalitarian State-Transition Systems: Label: en
45. Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems: Label: en
46. Use of Logical Models for Proving Operational Termination in General Logics: Label: en
47. Labelled Graph Rewriting Meets Social Networks: Label: en