On the public citation graph
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic
0 signed · 67 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11532231_16openalex-snapshot
Hierarchic Reasoning in Local Theory Extensions
inferredcites →https://doi.org/10.1007/11532231_24openalex-snapshot
Deduction with XOR Constraints in Security API Modelling
inferredcites →https://doi.org/10.1007/11559306_2openalex-snapshot
Connecting Many-Sorted Structures and Theories Through Adjoint Functions
inferredcites →https://doi.org/10.1007/3-540-40006-0_4openalex-snapshot
Semi-qualitative Reasoning about Distances: A Preliminary Report
inferredcites →https://doi.org/10.1007/3-540-45620-1_30openalex-snapshot
Combining Multisets with Integers
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/978-3-319-41591-8openalex-snapshot
Software Engineering and Formal Methods
inferredcites →https://doi.org/10.1007/978-3-540-30227-8_53openalex-snapshot
Combining Decision Procedures for Sorted Theories
inferredcites →https://doi.org/10.1007/978-3-540-32275-7_4openalex-snapshot
Combining Lists with Non-stably Infinite Theories
inferredcites →https://doi.org/10.1007/978-3-540-39910-0_33openalex-snapshot
Combining Sets with Elements
inferredcites →https://doi.org/10.1007/b12001openalex-snapshot
Verification : theory and practice : essays dedicated to Zohar Manna on the occasion of his 64th birthday
inferredcites →https://doi.org/10.1007/s10817-005-5204-9openalex-snapshot
Combining Nonstably Infinite Theories
inferredcites →https://doi.org/10.1016/0304-3975(96)00039-4openalex-snapshot
Behavioural theories and the proof of behavioural properties
inferredcites →https://doi.org/10.1016/j.entcs.2004.06.066openalex-snapshot
Combining Non-stably Infinite, Non-first Order Theories
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/sefm.2003.1236224openalex-snapshot
Light-weight theorem proving for debugging and verifying units of code
inferredcites →https://doi.org/10.1590/s0104-65002003000300003openalex-snapshot
Scalable automated proving and debugging of set-based specifications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560647_39openalex-snapshot
On Superposition-Based Satisfiability Procedures and Their Combination
inferred← citeshttps://doi.org/10.1007/11921240_26openalex-snapshot
Decision Procedures for the Formal Analysis of Software
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_3openalex-snapshot
Theory Combination: Beyond Equality Sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-51074-9_14openalex-snapshot
Politeness for the Theory of Algebraic Datatypes
inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_9openalex-snapshot
Politeness and Stable Infiniteness: Stronger Together
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_9openalex-snapshot
Reasoning About Vectors Using an SMT Theory of Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_30openalex-snapshot
Combining Combination Properties: An Analysis of Stable Infiniteness, Convexity, and Politeness
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_9openalex-snapshot
Combining Finite Combination Properties: Finite Models and Busy Beavers
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_10openalex-snapshot
Number Theory Combination: Natural Density and SMT
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_8openalex-snapshot
Shininess, Strong Politeness, and Unicorns
inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_9openalex-snapshot
Polite Combination in Parametric Array Theories
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_12openalex-snapshot
Bringing Closure to Theory Combination Properties
inferred← citeshttps://doi.org/10.1007/978-3-319-05302-8_14openalex-snapshot
Formal Modelling of Content-Based Protection and Release for Access Control in NATO Operations
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_9openalex-snapshot
A Gentle Non-disjoint Combination of Satisfiability Procedures
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_29openalex-snapshot
A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited
inferred← citeshttps://doi.org/10.1007/978-3-319-24246-0_17openalex-snapshot
A Rewriting Approach to the Combination of Data Structures with Bridging Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_47openalex-snapshot
Combined Satisfiability Modulo Parametric Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_1openalex-snapshot
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_5openalex-snapshot
Ordered Sets in the Calculus of Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_29openalex-snapshot
Polite Theories Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_25openalex-snapshot
A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_17openalex-snapshot
Sort It Out with Monotonicity
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_14openalex-snapshot
Sharing Is Caring: Combination of Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_42openalex-snapshot
Finite Model Finding in SMT
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_54openalex-snapshot
Automating Separation Logic Using SMT
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_15openalex-snapshot
Revisiting the Equivalence of Shininess and Politeness
inferred← citeshttps://doi.org/10.1007/s10472-009-9152-7openalex-snapshot
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
inferred← citeshttps://doi.org/10.1007/s10703-012-0159-zopenalex-snapshot
Being careful about theory combination
inferred← citeshttps://doi.org/10.1007/s10817-017-9411-yopenalex-snapshot
Many-Sorted Equivalence of Shiny and Strongly Polite Theories
inferred← citeshttps://doi.org/10.1007/s10817-019-09512-4openalex-snapshot
Politeness and Combination Methods for Theories with Bridging Functions
inferred← citeshttps://doi.org/10.1007/s10817-020-09567-8openalex-snapshot
Decidable $${\exists }^*{\forall }^*$$ First-Order Fragments of Linear Rational Arithmetic with Uninterpreted Predicates
inferred← citeshttps://doi.org/10.1007/s10817-022-09625-3openalex-snapshot
Polite Combination of Algebraic Datatypes
inferred← citeshttps://doi.org/10.1007/s10817-023-09682-2openalex-snapshot
Reasoning About Vectors: Satisfiability Modulo a Theory of Sequences
inferred← citeshttps://doi.org/10.1007/s10817-023-09684-0openalex-snapshot
Combining Stable Infiniteness and (Strong) Politeness
inferred← citeshttps://doi.org/10.1007/s10817-025-09746-5openalex-snapshot
Combining Combination Properties, Part I: Nelson-Oppen and Politeness
inferred← citeshttps://doi.org/10.1016/j.ic.2011.03.005openalex-snapshot
Automatic decidability and combinability
inferred← citeshttps://doi.org/10.1093/jigpal/jzw033openalex-snapshot
Decidability and complexity of fibred logics without shared connectives
inferred← citeshttps://doi.org/10.1109/sefm.2006.7openalex-snapshot
A Theory of Singly-Linked Lists and its Extensible Decision Procedure
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.22028/d291-26011openalex-snapshot
Reasoning in combinations of theories
inferred← citeshttps://doi.org/10.24963/ijcai.2021/660openalex-snapshot
Politeness for the Theory of Algebraic Datatypes (Extended Abstract)
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3390/math10193481openalex-snapshot
Decidability Preservation and Complexity Bounds for Combined Logics
inferred← citeshttps://doi.org/10.4204/eptcs.346.13openalex-snapshot
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.