On the public citation graph

An Efficient Decision Procedure for UTVPI Constraints

0 signed · 100 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10721959openalex-snapshot
Automated deduction - CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings
inferredcites →https://doi.org/10.1007/10721959_3openalex-snapshot
Proof Generation in the Touchstone Theorem Prover
inferredcites →https://doi.org/10.1007/11591191_2openalex-snapshot
Zap: Automated Theorem Proving for Software Analysis
inferredcites →https://doi.org/10.1007/3-540-58601-6_92openalex-snapshot
Beyond finite domains
inferredcites →https://doi.org/10.1007/3-540-61680-2_67openalex-snapshot
Negative-cycle detection algorithms
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_36openalex-snapshot
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_33openalex-snapshot
Deductive Verification of Advanced Out-of-Order Microprocessors
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.004openalex-snapshot
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1090/qam/102435openalex-snapshot
On a routing problem
inferredcites →https://doi.org/10.1109/lics.2004.1319604openalex-snapshot
Deciding quantifier-free Presburger formulas using parameterized solution bounds
inferredcites →https://doi.org/10.1109/wcre.2001.957836openalex-snapshot
The octagon abstract domain
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0214016openalex-snapshot
The Computational Complexity of Simultaneous Diophantine Approximation Problems
inferredcites →https://doi.org/10.1145/2166.357217openalex-snapshot
Postpass Code Optimization of Pipeline Constraints
inferredcites →https://doi.org/10.1145/2442776.2442783openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/378795.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/512529.512558openalex-snapshot
Extended static checking for Java

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11591191_2openalex-snapshot
Zap: Automated Theorem Proving for Software Analysis
inferred← citeshttps://doi.org/10.1007/11814771_39openalex-snapshot
Solving Sparse Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-0-387-39940-9_391openalex-snapshot
Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4614-8265-9_391openalex-snapshot
Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4899-7993-3_391-2openalex-snapshot
Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_10openalex-snapshot
An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_36openalex-snapshot
Read-Once Certification of Linear Infeasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-35166-3_16openalex-snapshot
A Graphical Analysis of Integer Infeasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_29openalex-snapshot
Trichotomy for the Reconfiguration Problem of Integer Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_23openalex-snapshot
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-20350-3_24openalex-snapshot
On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-23101-8_21openalex-snapshot
A Faster Algorithm for Determining the Linear Feasibility of Systems of BTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-27481-7_26openalex-snapshot
The Octatope Abstract Domain for Verification of Neural Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-49614-1_28openalex-snapshot
Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_2openalex-snapshot
Unit Refutations in Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_10openalex-snapshot
Finding Short Tree-Like Unit Refutations in UTVPI Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-10085-2_27openalex-snapshot
Translatable Updates of Selection Views under Constant Complement
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_20openalex-snapshot
A Graphical Theorem of the Alternative for UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-30139-6_13openalex-snapshot
An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-40229-1_11openalex-snapshot
Colors Make Theories Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_18openalex-snapshot
Speeding up the Constraint-Based Method in Difference Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_25openalex-snapshot
A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-58747-9_28openalex-snapshot
On a Generalization of Horn Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-66158-2_39openalex-snapshot
Analyzing Lattice Point Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_23openalex-snapshot
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_2openalex-snapshot
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-78163-9_6openalex-snapshot
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_15openalex-snapshot
Interpolant Generation for UTVPI
inferred← citeshttps://doi.org/10.1007/978-3-642-31540-4_3openalex-snapshot
Automated and Efficient Analysis of Role-Based Access Control with Attributes
inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_8openalex-snapshot
Minimum Clique Cover in Claw-Free Perfect Graphs and the Weak Edmonds-Johnson Property
inferred← citeshttps://doi.org/10.1007/978-3-642-39467-6_10openalex-snapshot
Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes
inferred← citeshttps://doi.org/10.1007/978-981-96-2845-2_24openalex-snapshot
Dag-Like Unit Refutations in UTVPI Constraint Systems
inferred← citeshttps://doi.org/10.1007/s00453-016-0131-1openalex-snapshot
A Combinatorial Certifying Algorithm for Linear Feasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/s00453-019-00554-zopenalex-snapshot
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints
inferred← citeshttps://doi.org/10.1007/s00453-022-01048-1openalex-snapshot
Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling
inferred← citeshttps://doi.org/10.1007/s10107-024-02174-0openalex-snapshot
Neighborhood persistency of the linear optimization relaxation of integer linear optimization
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/s10472-020-09703-5openalex-snapshot
On integer closure in a system of unit two variable per inequality constraints
inferred← citeshttps://doi.org/10.1007/s10479-026-07064-6openalex-snapshot
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
inferred← citeshttps://doi.org/10.1007/s10515-011-0085-0openalex-snapshot
Symbolic modular deadlock analysis
inferred← citeshttps://doi.org/10.1007/s10703-009-0073-1openalex-snapshot
Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness
inferred← citeshttps://doi.org/10.1007/s10703-017-0314-7openalex-snapshot
Incrementally closing octagons
inferred← citeshttps://doi.org/10.1007/s10703-024-00457-yopenalex-snapshot
The hexatope and octatope abstract domains for neural network verification
inferred← citeshttps://doi.org/10.1007/s10817-009-9139-4openalex-snapshot
Optimal Length Resolution Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.09.002openalex-snapshot
Exact join detection for convex polyhedra and other numerical abstractions
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.004openalex-snapshot
Trichotomy for integer linear systems based on their sign patterns
inferred← citeshttps://doi.org/10.1016/j.dam.2020.10.016openalex-snapshot
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.048openalex-snapshot
Combining Decision Procedures by (Model-)Equality Propagation
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.10.008openalex-snapshot
Theory decision by decomposition
inferred← citeshttps://doi.org/10.1016/j.scico.2010.04.003openalex-snapshot
Combining decision procedures by (model-)equality propagation
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.016openalex-snapshot
Feasibility checking in Horn constraint systems through a reduction based approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.001openalex-snapshot
Incremental Closure for Systems of Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.08.012openalex-snapshot
Analyzing fractional Horn constraint systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.025openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.05.007openalex-snapshot
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
inferred← citeshttps://doi.org/10.1017/s0960129523000300openalex-snapshot
Constrained read-once refutations in UTVPI constraint systems: A parallel perspective
inferred← citeshttps://doi.org/10.1093/logcom/exm055openalex-snapshot
On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
inferred← citeshttps://doi.org/10.1109/ase.2009.14openalex-snapshot
Symbolic Deadlock Analysis in Concurrent Libraries and Their Clients
inferred← citeshttps://doi.org/10.1109/csf57540.2023.00001openalex-snapshot
Subterm-Based Proof Techniques for Improving the Automation and Scope of Security Protocol Analysis
inferred← citeshttps://doi.org/10.1109/tkde.2014.2334327openalex-snapshot
Lossless Selection Views under Conditional Domain Constraints
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.1145/1838552.1838559openalex-snapshot
Efficient generation of craig interpolants in satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/2593793.2593798openalex-snapshot
Towards the formalization of properties of cloud-based elastic systems
inferred← citeshttps://doi.org/10.1145/3457885openalex-snapshot
A Fresh Look at Zones and Octagons
inferred← citeshttps://doi.org/10.1155/2009/845804openalex-snapshot
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0369openalex-snapshot
Incremental Satisfiability and Implication for UTVPI Constraints
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.17760/d20194113openalex-snapshot
Mathematical programming modulo theories
inferred← citeshttps://doi.org/10.22028/d291-26567openalex-snapshot
Efficient querying and learning in probabilistic and temporal databases
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102243openalex-snapshot
Safety verification of phaser programs
inferred← citeshttps://doi.org/10.24963/kr.2023/13openalex-snapshot
Tractable Explaining of Multivariate Decision Trees
inferred← citeshttps://doi.org/10.3233/faia230520openalex-snapshot
Unit Refutations of Difference Constraint Systems
inferred← citeshttps://doi.org/10.3233/sat190011openalex-snapshot
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.3233/sat190030openalex-snapshot
On Solving Boolean Combinations of UTVPI Constraints
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3384/diss.diva-173568openalex-snapshot
Parameterized Verification of Synchronized Concurrent Programs
inferred← citeshttps://doi.org/10.33915/etd.3843openalex-snapshot
Analyzing Satisfiability and Refutability in Selected Constraint Systems
inferred← citeshttps://doi.org/10.33915/etd.430openalex-snapshot
Optimal certifying algorithms for linear and lattice point feasibility in a system of UTVPI constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02786openalex-snapshot
Trichotomy for the reconfiguration problem of integer linear systems
inferred← citeshttps://doi.org/10.70675/384aa4bbzc607z4077zb165z8c8dfd910f34openalex-snapshot
Génération automatique de jeux de tests avec analyse symbolique des données pour les systèmes embarqués
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.