Article

Membership algebra as a logical framework for equational specification

Author:

José MeseguerAuthors Info & Claims

WADT '97: Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques

Pages 18 - 61

Published: 01 July 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Gabmeyer SKaufmann PSeidl MGogolla MKappel G(2019)A feature-based classification of formal verification techniques for software modelsSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0591-z18:1(473-498)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10270-017-0591-z
Alturki MKanovich MBan Kirigin TNigam VScedrov ATalcott CLie DMannan MRashid ATippenhaeur N(2018)Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of ProtocolsProceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy10.1145/3264888.3264895(60-71)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3264888.3264895
Aguirre LMartí-Oliet NPalomino MPita I(2018)Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and MaudeJournal of Automated Reasoning10.1007/s10817-017-9417-560:4(421-463)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s10817-017-9417-5
Show More Cited By

Membership algebra as a logical framework for equational specification
1. Software and its engineering
  1. Software creation and management
2. Theory of computation
  1. Formal languages and automata theory
    1. Formalisms

Recommendations

Meadows and the equational specification of division

The rational, real and complex numbers with their standard operations, including division, are partial algebras specified by the axiomatic concept of a field. Since the class of fields cannot be defined by equations, the theory of equational ...
Combination problems for commutative/monoidal theories or how algebra can help in equational unification

We study the class of theories for which solving unification problems is equivalent to solving systems of linear equations over a semiring. It encompasses important examples like the theories of Abelian monoids, idempotent Abelian monoids, and Abelian ...
Equational theories of tropical semirings
Foundations of software science and computation structures

This paper studies the equational theories of various exotic semirings presented in the literature. Exotic semirings are semirings whose underlying carrier set is some subset of the set of real numbers equipped with binary operations of minimum or ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

WADT '97: Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques

July 1997

434 pages

ISBN:3540642994

Editor:
Francesco Parisi-Presicce

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

113
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gabmeyer SKaufmann PSeidl MGogolla MKappel G(2019)A feature-based classification of formal verification techniques for software modelsSoftware and Systems Modeling (SoSyM)10.1007/s10270-017-0591-z18:1(473-498)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10270-017-0591-z
Alturki MKanovich MBan Kirigin TNigam VScedrov ATalcott CLie DMannan MRashid ATippenhaeur N(2018)Statistical Model Checking of Distance Fraud Attacks on the Hancke-Kuhn Family of ProtocolsProceedings of the 2018 Workshop on Cyber-Physical Systems Security and PrivaCy10.1145/3264888.3264895(60-71)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3264888.3264895
Aguirre LMartí-Oliet NPalomino MPita I(2018)Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and MaudeJournal of Automated Reasoning10.1007/s10817-017-9417-560:4(421-463)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s10817-017-9417-5
Aguirre LMartí-Oliet NPalomino MPita IVanhoof WPientka B(2017)Conditional narrowing modulo SMT and axiomsProceedings of the 19th International Symposium on Principles and Practice of Declarative Programming10.1145/3131851.3131856(17-28)Online publication date: 9-Oct-2017
https://dl.acm.org/doi/10.1145/3131851.3131856
Alturki M(2017)A Symbolic Rewriting Semantics of the COMPASS Modeling Language2017 IEEE International Conference on Information Reuse and Integration (IRI)10.1109/IRI.2017.62(283-290)Online publication date: 4-Aug-2017
https://dl.acm.org/doi/10.1109/IRI.2017.62
Meseguer JSkeirik S(2017)Equational formulas and pattern operations in initial order-sorted algebrasFormal Aspects of Computing10.1007/s00165-017-0415-529:3(423-452)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00165-017-0415-5
Escobar SMeadows CMeseguer JSantiago S(2015)Symbolic Protocol Analysis with Disequality Constraints Modulo Equational TheoriesEssays Dedicated to Pierpaolo Degano on Programming Languages with Applications to Biology and Security - Volume 946510.5555/2963891.2963907(238-261)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.5555/2963891.2963907
Meseguer JSkeirik S(2015)Equational Formulas and Pattern Operations in Initial Order-Sorted AlgebrasRevised Selected Papers of the 25th International Symposium on Logic-Based Program Synthesis and Transformation - Volume 952710.1007/978-3-319-27436-2_3(36-53)Online publication date: 13-Jul-2015
https://dl.acm.org/doi/10.1007/978-3-319-27436-2_3
Yang FEscobar SMeadows CMeseguer JNarendran PChitil OKing ADanvy O(2014)Theories of Homomorphic Encryption, Unification, and the Finite Variant PropertyProceedings of the 16th International Symposium on Principles and Practice of Declarative Programming10.1145/2643135.2643154(123-133)Online publication date: 8-Sep-2014
https://dl.acm.org/doi/10.1145/2643135.2643154
Lucas SMeseguer JChitil OKing ADanvy O(2014)Proving Operational Termination of Declarative Programs in General LogicsProceedings of the 16th International Symposium on Principles and Practice of Declarative Programming10.1145/2643135.2643152(111-122)Online publication date: 8-Sep-2014
https://dl.acm.org/doi/10.1145/2643135.2643152
Show More Cited By

Abstract

Cited By

Recommendations

Meadows and the equational specification of division

Combination problems for commutative/monoidal theories or how algebra can help in equational unification

Equational theories of tropical semirings

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations