On the public citation graph

Exploiting Sparsity in Polyhedral Analysis

https://doi.org/10.1007/11547662_23
0 signed · 60 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/3-540-44898-5_20openalex-snapshot
Cartesian Factoring of Polyhedra in Linear Relation Analysis
inferredcites →https://doi.org/10.1007/3-540-45013-0_7openalex-snapshot
Two Variables per Linear Inequality as an Abstract Domain
inferredcites →https://doi.org/10.1007/3-540-45789-5_17openalex-snapshot
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
inferredcites →https://doi.org/10.1007/3-540-55930-2_2openalex-snapshot
Constraint Logic Programming
inferredcites →https://doi.org/10.1007/978-3-031-11806-7openalex-snapshot
Programming Language Design and Implementation
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_23openalex-snapshot
The Octahedron Abstract Domain
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_9openalex-snapshot
Determinacy Inference for Logic Programs
inferredcites →https://doi.org/10.1007/978-3-540-39910-0_19openalex-snapshot
Qualitative Theorem Proving in Linear Constraints
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf01535523openalex-snapshot
Practical issues on the projection of polyhedral sets
inferredcites →https://doi.org/10.1007/bf01917108openalex-snapshot
The Average number of pivot steps required by the Simplex-Method is polynomial
inferredcites →https://doi.org/10.1007/bf03038311openalex-snapshot
Deriving linear size relations for logic programs by abstract interpretation
inferredcites →https://doi.org/10.1007/bfb0121242openalex-snapshot
On fourier’s analysis of linear inequality systems
inferredcites →https://doi.org/10.1016/0304-3975(92)00019-nopenalex-snapshot
Norms on terms and their use in proving universal termination of a logic program
inferredcites →https://doi.org/10.1016/0743-1066(94)90027-2openalex-snapshot
Termination of logic programs: the never-ending story
inferredcites →https://doi.org/10.1016/0743-1066(95)00038-0openalex-snapshot
Generalized semantics and abstract interpretation for constraint logic programs
inferredcites →https://doi.org/10.1017/s1471068404002017openalex-snapshot
cTI: a constraint-based termination inference tool for ISO-Prolog
inferredcites →https://doi.org/10.1017/s1471068404002261openalex-snapshot
Computing convex hulls with a linear solver
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1080/00207160310001650034openalex-snapshot
Convex hull of planarh-polyhedra
inferredcites →https://doi.org/10.1109/wcre.2001.957836openalex-snapshot
The octagon abstract domain
inferredcites →https://doi.org/10.1145/1065167.1065182openalex-snapshot
Security analysis of cryptographically controlled access to XML documents
inferredcites →https://doi.org/10.1145/298514.298581openalex-snapshot
Querying constraints
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/780822.781153openalex-snapshot
A static analyzer for large safety-critical software
inferredcites →https://doi.org/10.21236/ad0659301openalex-snapshot
PROJECTIONS OF CONVEX POLYHEDRAL SETS
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11924661_11openalex-snapshot
Widening Polyhedra with Landmarks
inferred← citeshttps://doi.org/10.1007/978-3-030-31140-7_6openalex-snapshot
A Decomposed Fourier-Motzkin Elimination Framework to Derive Vessel Capacity Models
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_20openalex-snapshot
Efficient Elimination of Redundancies in Polyhedra by Raytracing
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_11openalex-snapshot
Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-99725-4_10openalex-snapshot
Extending Constraint-Only Representation of Polyhedra with Boolean Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-69166-2_21openalex-snapshot
Splitting the Control Flow with Boolean Flags
inferred← citeshttps://doi.org/10.1007/978-3-540-74061-2_8openalex-snapshot
Taming the Wrapping of Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-540-89330-1_2openalex-snapshot
A Sound Floating-Point Polyhedra Abstract Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_23openalex-snapshot
Logahedra: A New Weakly Relational Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_11openalex-snapshot
An Abstract Domain to Discover Interval Linear Equalities
inferred← citeshttps://doi.org/10.1007/978-3-642-11319-2_16openalex-snapshot
Automatic Abstraction for Congruences
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_11openalex-snapshot
Simple and Precise Widenings for H-Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_15openalex-snapshot
The Gauge Domain: Scalable Analysis of Linear Inequality Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_6openalex-snapshot
Polyhedral Analysis Using Parametric Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_19openalex-snapshot
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
inferred← citeshttps://doi.org/10.1007/s10990-010-9062-8openalex-snapshot
The two variable per inequality abstract domain
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.010openalex-snapshot
A Note on the Inversion Join for Polyhedral Analysis
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.011openalex-snapshot
Speeding up Polyhedral Analysis by Identifying Common Constraints
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.008openalex-snapshot
Stratified Static Analysis Based on Variable Dependencies
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.009openalex-snapshot
Summarized Dimensions Revisited
inferred← citeshttps://doi.org/10.1080/23799927.2018.1535525openalex-snapshot
Polyhedron over-approximation for complexity reduction in static analysis
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029610openalex-snapshot
Computing controlled invariant sets in two moves
inferred← citeshttps://doi.org/10.1109/icst.2009.59openalex-snapshot
Optimizing probabilities of real-time test case execution
inferred← citeshttps://doi.org/10.1145/3009837.3009885openalex-snapshot
Fast polyhedra abstract domain
inferred← citeshttps://doi.org/10.1145/3093333.3009885openalex-snapshot
Fast polyhedra abstract domain
inferred← citeshttps://doi.org/10.1145/3158143openalex-snapshot
A practical construction for decomposing numerical abstract domains
inferred← citeshttps://doi.org/10.1145/3457885openalex-snapshot
A Fresh Look at Zones and Octagons
inferred← citeshttps://doi.org/10.1561/2500000034openalex-snapshot
Tutorial on Static Inference of Numeric Invariants by Abstract Interpretation
inferred← citeshttps://doi.org/10.1561/9781680833874openalex-snapshot
Tutorial on Static Inference of Numeric Invariants by Abstract Interpretation
inferred← citeshttps://doi.org/10.70675/6c6519d6zbe2az4c21zb810ze8cac31743e7openalex-snapshot
Static analysis of program portability by abstract interpretation
inferred← citeshttps://doi.org/10.70675/e0a608a3z32a6z4a2cz89dazcd6bd6b3e5b1openalex-snapshot
Static analysis on numeric and structural properties of array contents
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.