Symbolic computation in Maude: some tapas (Q2119100)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Symbolic computation in Maude: some tapas	scientific article

Statements

scholarly article

0 references

Symbolic computation in Maude: some tapas (English)

0 references

10.1007/978-3-030-68446-4_1

0 references

0 references

publication date

23 March 2022

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-68446-4_1

0 references

0 references

Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*

0 references

\({\mathsf{ACUOS}}^\mathbf{2}\): a high-performance system for modular ACU generalization with subtyping and inheritance

0 references

A partial evaluation framework for order-sorted equational programs modulo axioms

0 references

A modular order-sorted equational generalization algorithm

0 references

0 references

Abstract Logical Model Checking of Infinite-State Systems Using Narrowing

0 references

On Forward Closure and the Finite Variant Property

0 references

Specification and proof in membership equational logic

0 references

Semantic foundations for generalized rewrite theories

0 references

All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.

0 references

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

0 references

Term Rewriting and Applications

0 references

DRAT-based bit-vector proofs in CVC4

0 references

Programming and symbolic computation in Maude

0 references

Built-in Variant Generation and Unification, and Their Applications in Maude 2.7

0 references

MTT: The Maude Termination Tool (System Description)

0 references

Termination Modulo Combinations of Equational Theories

0 references

On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories

0 references

Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties

0 references

Folding variant narrowing and optimal variant termination

0 references

Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations

0 references

Variant-based decidable satisfiability in initial algebras with predicates

0 references

Order-sorted Equational Unification Revisited

0 references

0 references

0 references

0 references

Completion of a Set of Rules Modulo a Set of Equations

0 references

Symbolic execution and program testing

0 references

0 references

Normal forms and normal theories in conditional rewriting

0 references

THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP

0 references

0 references

0 references

Order-Sorted Parameterization and Induction

0 references

Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols

0 references

Conditional rewriting logic as a unified model of concurrency

0 references

0 references

Twenty years of rewriting logic

0 references

Strict coherence of conditional rewriting modulo axioms

0 references

Variant-Based Satisfiability in Initial Algebras

0 references

Generalized rewrite theories, coherence completion, and symbolic methods

0 references

Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems

0 references

Order-sorted unification

0 references

Simplification by Cooperating Decision Procedures

0 references

Designing reliable distributed systems. A formal methods approach based on executable modeling in Maude

0 references

Complexity, convexity and combinations of theories

0 references

Complete Sets of Reductions for Some Equational Theories

0 references

0 references

A Machine-Oriented Logic Based on the Resolution Principle

0 references

Computational aspects of an order-sorted logic with term declarations

0 references

A new decision method for elementary algebra

0 references

Metalevel algorithms for variant satisfiability

0 references

A Constructor-Based Reachability Logic for Rewrite Theories

0 references

Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

0 references

0 references

Equational rules for rewriting logic

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2119100

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2119100&oldid=36782275"