article

Free access

Deciding Combinations of Theories

Author:

Robert E. ShostakAuthors Info & Claims

Journal of the ACM (JACM), Volume 31, Issue 1

Pages 1 - 12

https://doi.org/10.1145/2422.322411

Published: 01 January 1984 Publication History

PDF eReader

References

[1]

DOWNEY, P.J., SETHi, R., AND TARJAN, R.Variations on the common su~xpression problem. Z ACM27, 4 (Oct. 1980), 758-771.

Crossref

Google Scholar

[2]

JEFFERSON, D.R.Type reduction and program verification. Ph.D. Dissertation, Carnegie Mellon Univermy, Pittsburgh, Pa., Aug. 1978.

Crossref

Google Scholar

[3]

MELL/AR-SMITH, P.M., AND SCHWARTZ, R.L.Formal specification and mechanical verificatton of SIFT. A fault-tolerant flight control system. IEEE Trans Comput 31, 7 (July 1982), 616--630.

Google Scholar

[4]

NELSON, G., AND OPPEN, D.C.S~mphfication by cooperating decision procedures. ACM Trans. Prog Lang Syst 1, 2 (Oct. 1979), 245-257.

Crossref

Google Scholar

[5]

NELSON, G., AND OPPEN, D C.Fast declston procedures based on congruence closure. J. ACM, 27, 2 (Apr 1980), 356-364.

Crossref

Google Scholar

[6]

SHOSTAK, R.E. An algorithm for reasoning about equahty. Commun. ACM 21, 7 (July 1978), 583-585.

Crossref

Google Scholar

[7]

SHOSIAK, R.E.A practmal decision procedure for arithmetic with function symbols. J, ACM 26, 2 (Apr. 1979), 351-360.

Crossref

Google Scholar

[8]

SHOSTAK, R.E., SCHWARTZ, R., AND MELLIAR-SMITH, P.M.STP: A mechanized logic for specification and verification, in Proc. 6th Conf. on Automated Deduction, Lecture Notes in Computer Science, 138, D.W. Loveland, Ed., Springer Vedag, New York, pp. 32--49.

Crossref

Google Scholar

[9]

TARJAN, R.E.Efficiency of a good but not linear set union algorithm. Z ACM 22, 2 (Apr. 1975), 215-225.

Crossref

Google Scholar

[10]

WeNSLEV, J., et alL, SIFT. Design and analysis of a fault-tolerant computer for aircraft control. Proc IEEE 66, 10 (Oct. 1978)

Google Scholar

Cited By

View all

Bergsträßer PGanardi MLin AZetzsche G(2024)Ramsey Quantifiers in Linear ArithmeticsProceedings of the ACM on Programming Languages10.1145/36328438:POPL(1-32)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632843
Seidl HErhard JSchwarz MTilscher S(2024)2-Pointer LogicTaming the Infinities of Concurrency10.1007/978-3-031-56222-8_16(281-307)Online publication date: 20-Mar-2024
https://doi.org/10.1007/978-3-031-56222-8_16
Cantone DMaugeri POmodeo E(2023)Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languagesTheoretical Computer Science10.1016/j.tcs.2023.113786(113786)Online publication date: Mar-2023
https://doi.org/10.1016/j.tcs.2023.113786
Show More Cited By

Index Terms

Deciding Combinations of Theories
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Theorem proving algorithms
2. Theory of computation
  1. Models of computation
    1. Computability
  2. Semantics and reasoning
    1. Program reasoning
      1. Program verification

Recommendations

Unions of non-disjoint theories and combinations of satisfiability procedures

In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a ...
Combining theories: the Ackerman and guarded fragments
FroCoS'11: Proceedings of the 8th international conference on Frontiers of combining systems

Combination of decision procedures is at the heart of Satisfiability Modulo Theories (SMT) solvers. It provides ways to compose decision procedures for expressive languages which mix symbols from various decidable theories. Typical combinations include (...
Unification and Matching in Hierarchical Combinations of Syntactic Theories
FroCoS 2015: Proceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 9322

We investigate a hierarchical combination approach to the unification problem in non-disjoint unions of equational theories. In this approach, the idea is to extend a base theory with some additional axioms given by rewrite rules in such way that the ...

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 31, Issue 1

Jan. 1984

188 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2422

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1984

Published in JACM Volume 31, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

216
Total Citations
View Citations
884
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)17

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bergsträßer PGanardi MLin AZetzsche G(2024)Ramsey Quantifiers in Linear ArithmeticsProceedings of the ACM on Programming Languages10.1145/36328438:POPL(1-32)Online publication date: 5-Jan-2024
https://dl.acm.org/doi/10.1145/3632843
Seidl HErhard JSchwarz MTilscher S(2024)2-Pointer LogicTaming the Infinities of Concurrency10.1007/978-3-031-56222-8_16(281-307)Online publication date: 20-Mar-2024
https://doi.org/10.1007/978-3-031-56222-8_16
Cantone DMaugeri POmodeo E(2023)Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languagesTheoretical Computer Science10.1016/j.tcs.2023.113786(113786)Online publication date: Mar-2023
https://doi.org/10.1016/j.tcs.2023.113786
Briefs YLeidinger HWeidenbach C(2023)KBO Constraint Solving RevisitedFrontiers of Combining Systems10.1007/978-3-031-43369-6_5(81-98)Online publication date: 20-Sep-2023
https://dl.acm.org/doi/10.1007/978-3-031-43369-6_5
Russinoff D(2022)A Formalization of Finite Group TheoryElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.359.10359(99-115)Online publication date: 24-May-2022
https://doi.org/10.4204/EPTCS.359.10
Caleiro CMarcelino S(2022)Decidability Preservation and Complexity Bounds for Combined LogicsMathematics10.3390/math1019348110:19(3481)Online publication date: 23-Sep-2022
https://doi.org/10.3390/math10193481
Müller PShankar N(2021)The First Fifteen Years of the Verified Software ProjectTheories of Programming10.1145/3477355.3477362(93-124)Online publication date: 4-Oct-2021
https://dl.acm.org/doi/10.1145/3477355.3477362
Voigt M(2021)Decidable First-Order Fragments of Linear Rational Arithmetic with Uninterpreted PredicatesJournal of Automated Reasoning10.1007/s10817-020-09567-865:3(357-423)Online publication date: 1-Mar-2021
https://dl.acm.org/doi/10.1007/s10817-020-09567-8
Burel GBury GCauderlier RDelahaye DHalmagrand PHermant O(2020)First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets PracticeJournal of Automated Reasoning10.1007/s10817-019-09533-z64:6(1001-1050)Online publication date: 1-Aug-2020
https://dl.acm.org/doi/10.1007/s10817-019-09533-z
Zhang YGuo Y(2019)Runtime Monitoring of IoT Services to Guarantee PropertiesIntegrating and Streamlining Event-Driven IoT Services10.4018/978-1-5225-7622-8.ch007(223-275)Online publication date: 2019
https://doi.org/10.4018/978-1-5225-7622-8.ch007
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Unions of non-disjoint theories and combinations of satisfiability procedures

Combining theories: the Ackerman and guarded fragments

Unification and Matching in Hierarchical Combinations of Syntactic Theories

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations