On the public citation graph

Chapter 33. Satisfiability Modulo Theories

https://doi.org/10.3233/faia201017

0 signed · 94 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.

Claim with ORCID

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.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.3239openalex-snapshot

Taming complexity of industrial printing systems using a constraint‐based DSL: An industrial experience report

inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_16openalex-snapshot

MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers

inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_8openalex-snapshot

Syntax-Guided Quantifier Instantiation

inferred← citeshttps://doi.org/10.1007/978-3-030-79876-5_15openalex-snapshot

Non-clausal Redundancy Properties

inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_26openalex-snapshot

Smt-Switch: A Solver-Agnostic C++ API for SMT Solving

inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_24openalex-snapshot

Bit-Precise Reasoning via Int-Blasting

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-20862-1_2openalex-snapshot

Robust Weighted Partial Maximum Satisfiability Problem: Challenge to $$\varSigma _{2}^{P}$$-Complete Problem

inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_5openalex-snapshot

Satisfiability Modulo Custom Theories in Z3

inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_6openalex-snapshot

SMT Sampling via Model-Guided Approximation

inferred← citeshttps://doi.org/10.1007/978-3-031-28916-3_1openalex-snapshot

Arithmetic Satisfiability-Modulo-Theory Solving Applied to Nonstandard Analysis Problems of Cyber-Physical Systems

inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_19openalex-snapshot

Carcara: An Efficient Proof Checker and Elaborator for SMT Proofs in the Alethe Format

inferred← citeshttps://doi.org/10.1007/978-3-031-33170-1_29openalex-snapshot

Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem

inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_20openalex-snapshot

Kratos2: An SMT-Based Model Checker for Imperative Programs

inferred← citeshttps://doi.org/10.1007/978-3-031-43513-3_2openalex-snapshot

Non-Classical Logics in Satisfiability Modulo Theories

inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_16openalex-snapshot

Symbolic Model Checking of Relative Safety LTL Properties

inferred← citeshttps://doi.org/10.1007/978-3-031-47705-8_4openalex-snapshot

CHC Model Validation with Proof Guarantees

inferred← citeshttps://doi.org/10.1007/978-3-031-50521-8_13openalex-snapshot

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic

inferred← citeshttps://doi.org/10.1007/978-3-031-50974-2_31openalex-snapshot

Equivalence of Data Petri Nets with Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-031-57246-3_17openalex-snapshot

IsaRare: Automatic Verification of SMT Rewrites in Isabelle/HOL

inferred← citeshttps://doi.org/10.1007/978-3-031-60698-4_20openalex-snapshot

SMT-Based Dynamic Multi-Robot Task Allocation

inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_23openalex-snapshot

MCSat-Based Finite Field Reasoning in the Yices2 SMT Solver (Short Paper)

inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_15openalex-snapshot

Unification in the Description Logic $$\mathcal {ELH}_{\mathcal {R}^+}$$ Without the Top Concept Modulo Cycle-Restricted Ontologies

inferred← citeshttps://doi.org/10.1007/978-3-031-65630-9_15openalex-snapshot

Guiding Enumerative Program Synthesis with Large Language Models

inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_31openalex-snapshot

Satisfiability Modulo Theories: A Beginner’s Tutorial

inferred← citeshttps://doi.org/10.1007/978-3-031-71294-4_5openalex-snapshot

Combined Abstract Congruence Closure for Theories with Associativity or Commutativity

inferred← citeshttps://doi.org/10.1007/978-3-031-75380-0_4openalex-snapshot

Towards the Formal Analysis of Algorithmic Requirements

inferred← citeshttps://doi.org/10.1007/978-3-031-92882-6_11openalex-snapshot

Certified Secure Updates for IoT Devices

inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_1openalex-snapshot

Automated Reasoning for Data-Aware Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_9openalex-snapshot

Adaptive Clause Management in SMT Solvers: A Dynamic Weighting Framework for Formal Verification

inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_11openalex-snapshot

Infinite-State Liveness Checking with rlive

inferred← citeshttps://doi.org/10.1007/978-3-031-98682-6_3openalex-snapshot

Decision Heuristics in MCSat

inferred← citeshttps://doi.org/10.1007/978-3-031-98685-7_8openalex-snapshot

Branching Bisimulation Learning

inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_37openalex-snapshot

Entailment vs. Verification for Partial-Assignment Satisfiability and Enumeration

inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_6openalex-snapshot

Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search

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_14openalex-snapshot

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems

inferred← citeshttps://doi.org/10.1007/978-3-032-04167-8_7openalex-snapshot

Exploiting Partial-Assignment Enumeration in Optimization Modulo Theories

inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_6openalex-snapshot

Constraint Learning for Non-confluent Proof Search

inferred← citeshttps://doi.org/10.1007/978-3-032-06085-3_7openalex-snapshot

On Solving String Equations via Powers and Parikh Images

inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_8openalex-snapshot

Martin: A Novel Mechanism for Rate Adaption in Continuous Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-032-17163-4_5openalex-snapshot

Configuration Technologies

inferred← citeshttps://doi.org/10.1007/978-3-032-20018-1_9openalex-snapshot

Towards a Formal Verification of the Bao Hypervisor

inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_10openalex-snapshot

SMT(LIA) Sampling with High Diversity

inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_13openalex-snapshot

Hint-Based SMT Proof Reconstruction

inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_6openalex-snapshot

Automatically Tightening Access Control Policies with Restricter

inferred← citeshttps://doi.org/10.1007/978-3-032-28079-4_12openalex-snapshot

Artificial Incorrectness: SMT and LLMs in Hardware Synthesis

inferred← citeshttps://doi.org/10.1007/978-3-032-30870-2_3openalex-snapshot

Inference of Qualitative Models from Steady-State Data via Weighted MaxSMT

inferred← citeshttps://doi.org/10.1007/978-3-032-32357-6_12openalex-snapshot

Faster Optimization of Decision Tree Policies for Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-032-32357-6_15openalex-snapshot

Verification of LTL Properties on Neural Networks for Chemical Process Monitoring

inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_8openalex-snapshot

Automating Bitvector and Finite Field Equivalence Proofs in Lean

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_10openalex-snapshot

A General Approach for SMT Proof Skeletons

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-032-32589-1_13openalex-snapshot

Automatically Translating Proof Systems for SMT Solvers to the $$\lambda \Pi $$-Calculus

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_16openalex-snapshot

Checking Regular Expressions in Cvc5 Proofs

inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_18openalex-snapshot

Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT

inferred← citeshttps://doi.org/10.1007/978-3-032-40774-0_26openalex-snapshot

Towards a Plausibility Metric for Contrastive Explanations in Automated Planning

inferred← citeshttps://doi.org/10.1007/978-981-96-0178-3_13openalex-snapshot

Model-Based Systems Engineering Supporting Architecture Modeling of Air Traffic Management System and Model Verifying Based on SMT

inferred← citeshttps://doi.org/10.1007/s00236-026-00535-0openalex-snapshot

CSB: A Counting and Sampling tool for Bit-vectors

inferred← citeshttps://doi.org/10.1007/s10009-023-00696-0openalex-snapshot

Algorithm selection for SMT

inferred← citeshttps://doi.org/10.1007/s10009-025-00801-5openalex-snapshot

AutoHyper: leveraging language inclusion checking for hyperproperty model-checking

inferred← citeshttps://doi.org/10.1007/s10270-023-01145-xopenalex-snapshot

P-stable abstractions of hybrid systems

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.1007/s11042-026-21888-1openalex-snapshot

SCLAF-FV: a SHAP-guided CNN–LSTM–attention framework with formal verification for reliable injury detection

inferred← citeshttps://doi.org/10.1007/s13218-025-00890-zopenalex-snapshot

SMT Techniques for Data-Aware Process Mining

inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101056openalex-snapshot

Transforming imperative programs into bisimilar logically constrained term rewrite systems via injective functions from configurations to terms

inferred← citeshttps://doi.org/10.1017/s1471068423000194openalex-snapshot

An Interleaving Semantics of the Timed Concurrent Language for Argumentation to Model Debates and Dialogue Games

inferred← citeshttps://doi.org/10.1080/11663081.2026.2658659openalex-snapshot

A reduction of input/output logics to SAT

inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133351openalex-snapshot

Approximate SMT Counting Beyond Discrete Domains

inferred← citeshttps://doi.org/10.1109/icmcis64378.2025.11048181openalex-snapshot

Evaluating Scheduling Algorithms for Adaptive Orchestration in Federated Tactical Edge Cloud Environments

inferred← citeshttps://doi.org/10.1109/icpm60904.2023.10271969openalex-snapshot

Repairing Soundness Properties in Data-Aware Processes

inferred← citeshttps://doi.org/10.1109/icse48619.2023.00116openalex-snapshot

Compiling Parallel Symbolic Execution with Continuations

inferred← citeshttps://doi.org/10.1109/icst60714.2024.00041openalex-snapshot

BugOut: Automated Test Generation and Bug Detection for Low-Code

inferred← citeshttps://doi.org/10.1109/prdc67299.2025.00034openalex-snapshot

Guided Importance Sampling for Safety and Reliability: A Pragmatic Comparison of Symbolic and Simulation-Based Approaches

inferred← citeshttps://doi.org/10.1109/tse.2023.3305052openalex-snapshot

Human-in-the-Loop Automatic Program Repair

inferred← citeshttps://doi.org/10.1145/3563292openalex-snapshot

CAAT: consistency as a theory

inferred← citeshttps://doi.org/10.1145/3620665.3640418openalex-snapshot

Lifting Micro-Update Models from RTL for Formal Security Analysis

inferred← citeshttps://doi.org/10.1145/3622876openalex-snapshot

Message Chains for Distributed System Verification

inferred← citeshttps://doi.org/10.1145/3632409.3640475openalex-snapshot

Gear-Ratio-Aware Standard Cell Layout Framework for DTCO Exploration

inferred← citeshttps://doi.org/10.1145/3643763openalex-snapshot

Towards AI-Assisted Synthesis of Verified Dafny Methods

inferred← citeshttps://doi.org/10.1145/3656435openalex-snapshot

SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques

inferred← citeshttps://doi.org/10.1145/3675394openalex-snapshot

Neural Solving Uninterpreted Predicates with Abstract Gradient Descent

inferred← citeshttps://doi.org/10.1145/3698322.3698340openalex-snapshot

The Faultless Way of Programming

inferred← citeshttps://doi.org/10.1145/3744916.3764561openalex-snapshot

Generator Solving for Symbolic Execution

inferred← citeshttps://doi.org/10.1145/3839498openalex-snapshot

Compiling WebAssembly Concolic Execution with Staging, Continuations, and Snapshots

inferred← citeshttps://doi.org/10.1145/3839537openalex-snapshot

Validating Optimizing SMT Solvers via Cross-Theory Approximation

inferred← citeshttps://doi.org/10.1145/3845989openalex-snapshot

The Past, Present, and Future of Formal Methods in Brazil

inferred← citeshttps://doi.org/10.1613/jair.1.16870openalex-snapshot

On CNF Conversion for SAT and SMT Enumeration

inferred← citeshttps://doi.org/10.23919/date69613.2026.11539305openalex-snapshot

Contract-Based Architecture Exploration of Cyber-Physical Systems via Satisfiability Modulo Convex Programming

inferred← citeshttps://doi.org/10.25368/2024.34openalex-snapshot

Unification in the Description Logic ELHR+ without the Top Concept modulo Cycle-Restricted Ontologies

inferred← citeshttps://doi.org/10.4018/407444openalex-snapshot

Integrating Formal Methods and Large Language Models in Computer Engineering Education

inferred← citeshttps://doi.org/10.4204/eptcs.385.12openalex-snapshot

Generalizing Level Ranking Constraints for Monotone and Convex Aggregates

inferred← citeshttps://doi.org/10.70675/4e757310z5358z41cbza43ez56c7ad4c869aopenalex-snapshot

Stronger SMT Solvers for Proof Assistants : Proofs, Quantifier Simplification, Strategy Schedules

inferred← citeshttps://doi.org/10.70675/a33b6c22zf5aez4669z8a23zc969be1659efopenalex-snapshot

Learning and Verifying Temporal Specifications for Cyber-Physical Systems

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.