On the public citation graph
νZ - Maximal Satisfaction with Z3
0 signed · 71 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/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferredcites →https://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_52openalex-snapshot
Proving Non-termination Using Max-SMT
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_8openalex-snapshot
Satisfiability Modulo the Theory of Costs: Foundations and Applications
inferredcites →https://doi.org/10.1007/978-3-642-25318-8_3openalex-snapshot
Engineering Theories with Z3
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_38openalex-snapshot
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_22openalex-snapshot
Improvements to Core-Guided Binary Search for MaxSAT
inferredcites →https://doi.org/10.1007/978-3-642-39071-5_12openalex-snapshot
A Modular Approach to MaxSAT Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-642-40627-0_21openalex-snapshot
Postponing Optimization to Speed Up MAXSAT Solving
inferredcites →https://doi.org/10.1109/fmcad.2013.6679406openalex-snapshot
Parameter synthesis with IC3
inferredcites →https://doi.org/10.1145/2535838.2535857openalex-snapshot
Symbolic optimization with SMT solvers
inferredcites →https://doi.org/10.1609/aaai.v28i1.9124openalex-snapshot
Maximum Satisfiability Using Core-Guided MaxSAT Resolution
inferredcites →https://doi.org/10.48550/arxiv.1202.1409openalex-snapshot
Optimization in SMT with LA(Q) Cost Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-91265-9_15openalex-snapshot
ESampler: Efficient Sampling of Satisfying Assignments for Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-031-75778-5_6openalex-snapshot
What Is Formal Verification Without Specifications? A Survey on Mining LTL Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-94533-5_6openalex-snapshot
On Quantitative Solution Iteration in QAlloy
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-319-21668-3_23openalex-snapshot
Automatic Completion of Distributed Protocols with Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_27openalex-snapshot
OptiMathSAT: A Tool for Optimization Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-57351-9_16openalex-snapshot
A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_4openalex-snapshot
Maximum Satisfiability in Software Analysis: Applications and Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_4openalex-snapshot
Solving MaxSAT with Bit-Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_14openalex-snapshot
νZ - An Optimizing SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_27openalex-snapshot
Pushing the Envelope of Optimization Modulo Theories with Linear-Arithmetic Cost Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_8openalex-snapshot
Safety-Constrained Reinforcement Learning for MDPs
inferred← citeshttps://doi.org/10.1007/978-3-662-54580-5_14openalex-snapshot
On Optimization Modulo Theories, MaxSMT and Sorting Networks
inferred← citeshttps://doi.org/10.1007/s10270-021-00896-9openalex-snapshot
Model-based resource analysis and synthesis of service-oriented automotive software architectures
inferred← citeshttps://doi.org/10.1007/s10479-016-2220-6openalex-snapshot
Modeling high school timetabling with bitvectors
inferred← citeshttps://doi.org/10.1007/s10626-026-00447-8openalex-snapshot
Optimization based on timed Petri nets using CP-SAT - an integrated SAT and CP solver
inferred← citeshttps://doi.org/10.1007/s10817-021-09600-4openalex-snapshot
Optimization Modulo the Theories of Signed Bit-Vectors and Floating-Point Numbers
inferred← citeshttps://doi.org/10.1016/j.artint.2015.04.002openalex-snapshot
Structured learning modulo theories
inferred← citeshttps://doi.org/10.1016/j.cja.2019.08.027openalex-snapshot
Hybrid partition- and network-level scheduling design for distributed integrated modular avionics systems
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2018.03.004openalex-snapshot
Satisfiability modulo theories for process systems engineering
inferred← citeshttps://doi.org/10.1016/j.cose.2018.02.002openalex-snapshot
A systematic review of fuzzing techniques
inferred← citeshttps://doi.org/10.1016/j.future.2017.12.009openalex-snapshot
Towards a formally verified zero watermarking scheme for data integrity in the Internet of Things based-wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.007openalex-snapshot
Formal analysis of feature degradation in fault-tolerant automotive systems
inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102615openalex-snapshot
ESampler: Boosting sampling of satisfying assignments for Boolean formulas via derivation
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000555openalex-snapshot
Optimizing Contractor Selection for Construction Packages in Capital Projects
inferred← citeshttps://doi.org/10.1109/access.2017.2707584openalex-snapshot
Enhanced Architecture for Privacy Preserving Data Integration in a Medical Research Environment
inferred← citeshttps://doi.org/10.1109/case58245.2025.11164139openalex-snapshot
Scalable Multi-Agent Path Finding for Delivery Robot Systems with Temporal and Edge Capacity Constraints on Weighted Graphs
inferred← citeshttps://doi.org/10.1109/coase.2018.8560344openalex-snapshot
SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation
inferred← citeshttps://doi.org/10.1109/etfa.2017.8247624openalex-snapshot
Minimization of useless work in resource failure recovery of workflow schedules
inferred← citeshttps://doi.org/10.1109/jas.2021.1003844openalex-snapshot
Joint Algorithm of Message Fragmentation and No-Wait Scheduling for Time-Sensitive Networks
inferred← citeshttps://doi.org/10.1109/jiot.2021.3121251openalex-snapshot
Mixed-Criticality Industrial Data Scheduling on 5G NR
inferred← citeshttps://doi.org/10.1109/lcn.2018.8638054openalex-snapshot
Whack-a-Mole: Software-defined Networking driven Multi-level DDoS defense for Cloud environments
inferred← citeshttps://doi.org/10.1109/memcod.2015.7340482openalex-snapshot
On the deployment problem of embedded systems
inferred← citeshttps://doi.org/10.1109/models.2019.000-8openalex-snapshot
Model-Based Resource Analysis and Synthesis of Service-Oriented Automotive Software Architectures
inferred← citeshttps://doi.org/10.1109/rtas52030.2021.00023openalex-snapshot
ASIL-Decomposition Based Routing and Scheduling in Safety-Critical Time-Sensitive Networking
inferred← citeshttps://doi.org/10.1109/tcst.2021.3054800openalex-snapshot
Model Predictive Control of Priced Timed Automata Encoded With First-Order Logic
inferred← citeshttps://doi.org/10.1109/wfcs.2018.8402355openalex-snapshot
Formally verified latency-aware VNF placement in industrial Internet of things
inferred← citeshttps://doi.org/10.1145/2784731.2784765openalex-snapshot
Practical SMT-based type error localization
inferred← citeshttps://doi.org/10.1145/2814270.2814311openalex-snapshot
Checks and balances: constraint solving without surprises in object-constraint programming languages
inferred← citeshttps://doi.org/10.1145/2837614.2837658openalex-snapshot
Query-guided maximum satisfiability
inferred← citeshttps://doi.org/10.1145/2858949.2784765openalex-snapshot
Practical SMT-based type error localization
inferred← citeshttps://doi.org/10.1145/2970276.2970316openalex-snapshot
Model-based whitebox fuzzing for program binaries
inferred← citeshttps://doi.org/10.1145/2976767.2976791openalex-snapshot
Automatic detection of incomplete requirements via symbolic analysis
inferred← citeshttps://doi.org/10.1145/3009837.3009845openalex-snapshot
Genesis: synthesizing forwarding tables in multi-tenant networks
inferred← citeshttps://doi.org/10.1145/3193992.3193997openalex-snapshot
Modeling time in Java programs for automatic error detection
inferred← citeshttps://doi.org/10.1145/3194696.3194704openalex-snapshot
A workflow for healthcare systems via OCL and SMT solving
inferred← citeshttps://doi.org/10.1145/3385412.3386025openalex-snapshot
Question selection for interactive program synthesis
inferred← citeshttps://doi.org/10.1145/3452143.3465538openalex-snapshot
Extending the Fundamental Theorem of Linear Programming for Strict Inequalities
inferred← citeshttps://doi.org/10.1145/3632871openalex-snapshot
EasyBC: A Cryptography-Specific Language for Security Analysis of Block Ciphers against Differential Cryptanalysis
inferred← citeshttps://doi.org/10.1371/journal.pone.0195021openalex-snapshot
Anonymity-preserving Reputation Management System for health sector
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33011608openalex-snapshot
Concurrency Debugging with MaxSMT
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01332openalex-snapshot
Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1702.02385openalex-snapshot
On Optimization Modulo Theories, MaxSMT and Sorting Networks
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.