On the public citation graph
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
0 signed · 74 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/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-44898-5_19openalex-snapshot
Precise Widening Operators for Convex Polyhedra
inferredcites →https://doi.org/10.1007/3-540-45319-9_9openalex-snapshot
A Technique for Invariant Generation
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-56922-7_28openalex-snapshot
Delay analysis in synchronous programs
inferredcites →https://doi.org/10.1007/3-540-64358-3openalex-snapshot
Hybrid Systems: Computation and Control: First International Workshop, HSCC'98, Berkeley, California, USA, April 13 - 15, 1998, Proceedings
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_23openalex-snapshot
Analysis of Recursive Game Graphs Using Data Flow Equations
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_85openalex-snapshot
A Note on Karr’s Algorithm
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_21openalex-snapshot
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_22openalex-snapshot
Approximating the Algebraic Relational Semantics of Imperative Programs
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_7openalex-snapshot
Constraint-Based Linear-Relations Analysis
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_1openalex-snapshot
Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_2openalex-snapshot
Scalable Analysis of Linear Systems Using Mathematical Programming
inferredcites →https://doi.org/10.1007/978-3-540-31954-2_39openalex-snapshot
Modeling, Optimization and Computation for Software Verification
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_12openalex-snapshot
FAST: Fast Acceleration of Symbolic Transition Systems
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_4openalex-snapshot
A Transformational Approach for Generating Non-linear Invariants
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1007/s10990-004-4867-yopenalex-snapshot
Algebraic Power Analysis by Abstract Interpretation
inferredcites →https://doi.org/10.1016/b978-1-4832-1447-4.50029-8openalex-snapshot
“COMMONSENSE” ARITHMETIC REASONING
inferredcites →https://doi.org/10.1016/j.ipl.2004.05.004openalex-snapshot
Computing polynomial program invariants
inferredcites →https://doi.org/10.1016/j.scico.2005.02.003openalex-snapshot
Precise widening operators for convex polyhedra
inferredcites →https://doi.org/10.1145/1005285.1005324openalex-snapshot
Automatic Generation of Polynomial Loop Invariants
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/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/780822.781153openalex-snapshot
A static analyzer for large safety-critical software
inferredcites →https://doi.org/10.1145/781131.781153openalex-snapshot
A static analyzer for large safety-critical software
inferredcites →https://doi.org/10.1145/964001.964028openalex-snapshot
Non-linear loop invariant generation using Gröbner bases
inferredcites →https://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferredcites →https://doi.org/10.4230/dagsemproc.05431.3openalex-snapshot
Automatically Generating Loop Invariants Using Quantifier Elimination
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-65474-0_8openalex-snapshot
Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_13openalex-snapshot
Affine Loop Invariant Generation via Matrix Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_4openalex-snapshot
Automated Resource Analysis with Coq Proof Objects
inferred← citeshttps://doi.org/10.1007/978-3-319-65765-3_6openalex-snapshot
Augmented Complex Zonotopes for Computing Invariants of Affine Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-68167-2_22openalex-snapshot
Synthesizing Invariants by Solving Solvable Loops
inferred← citeshttps://doi.org/10.1007/978-3-319-78449-6_5openalex-snapshot
Template Complex Zonotope Based Stability Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6openalex-snapshot
Principles of Security and Trust
inferred← citeshttps://doi.org/10.1007/978-3-319-89722-6_1openalex-snapshot
What’s the Over/Under? Probabilistic Bounds on Information Leakage
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_35openalex-snapshot
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_3openalex-snapshot
Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_6openalex-snapshot
Transfer Function Synthesis without Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-37036-6_31openalex-snapshot
A Data Driven Approach for Algebraic Loop Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-38856-9_21openalex-snapshot
Verification as Learning Geometric Concepts
inferred← citeshttps://doi.org/10.1007/978-3-662-48288-9_14openalex-snapshot
Property-based Polynomial Invariant Generation Using Sums-of-Squares Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_21openalex-snapshot
Validating Numerical Semidefinite Programming Solvers for Polynomial Invariants
inferred← citeshttps://doi.org/10.1007/s10703-017-0302-yopenalex-snapshot
Validating numerical semidefinite programming solvers for polynomial invariants
inferred← citeshttps://doi.org/10.1007/s11704-014-3150-6openalex-snapshot
Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.005openalex-snapshot
View-Augmented Abstractions
inferred← citeshttps://doi.org/10.1016/j.nahs.2015.08.006openalex-snapshot
Change-of-bases abstractions for non-linear hybrid systems
inferred← citeshttps://doi.org/10.1016/j.scico.2007.08.001openalex-snapshot
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.033openalex-snapshot
Applications of polyhedral computations to the analysis and verification of hardware and software systems
inferred← citeshttps://doi.org/10.1109/snr.2016.7479379openalex-snapshot
Template complex zonotopes: a new set representation for verification of hybrid systems
inferred← citeshttps://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferred← citeshttps://doi.org/10.1145/3385412.3385969openalex-snapshot
Polynomial invariant generation for non-deterministic recursive programs
inferred← citeshttps://doi.org/10.1145/3563295openalex-snapshot
Scalable linear invariant generation with Farkas’ lemma
inferred← citeshttps://doi.org/10.1145/3571237openalex-snapshot
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
inferred← citeshttps://doi.org/10.1145/3708559openalex-snapshot
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
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.2168/lmcs-6(3:4)2010openalex-snapshot
Automatic Modular Abstractions for Template Numerical Constraints
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:1)2012openalex-snapshot
Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:17)2012openalex-snapshot
Transfer Function Synthesis without Quantifier Elimination
inferred← citeshttps://doi.org/10.23919/acc.2017.7963335openalex-snapshot
Template complex zonotopes for stability and invariant verification
inferred← citeshttps://doi.org/10.25561/25723openalex-snapshot
Polynomial Template Generation using Sum-of-Squares Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07025openalex-snapshot
Property-based Polynomial Invariant Generation using Sums-of-Squares Optimization
inferred← citeshttps://doi.org/10.70675/6c6519d6zbe2az4c21zb810ze8cac31743e7openalex-snapshot
Static analysis of program portability by abstract interpretation
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.