26 papers:
SAC-2015-AlbertiM #array- Polyhedra to the rescue of array interpolants (FA, DM), pp. 1745–1750.
SAS-2013-FouilheMP #abstract domain #correctness #generative #performance- Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra (AF, DM, MP), pp. 345–365.
POPL-2013-UpadrastaC #scheduling #using- Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra (RU, AC), pp. 483–496.
VMCAI-2013-SeladjiB #abstract domain #analysis #fixpoint #tool support #using- Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools (YS, OB), pp. 149–168.
PLDI-2012-Chen #revisited- Polyhedra scanning revisited (CC), pp. 499–508.
LATA-2012-BoigelotBD- Automata-Based Symbolic Representations of Polyhedra (BB, JB, JFD), pp. 3–20.
TACAS-2009-SchollDPK #constraints #detection #linear- Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints (CS, SD, FP, SK), pp. 383–397.
- SAS-2009-ChenMWC #abstract domain #linear
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (LC, AM, JW, PC), pp. 309–325.
- VMCAI-2009-LavironL #approach #linear #named #scalability
- SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities (VL, FL), pp. 229–244.
- TACAS-2008-SankaranarayananDI #hybrid #model checking #using
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra (SS, TD, FI), pp. 188–202.
- SAS-2008-AllamigeonGG #invariant #using
- Inferring Min and Max Invariants Using Max-Plus Polyhedra (XA, SG, EG), pp. 189–204.
CAV-2007-WangYGI #precise #reachability #using- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra (CW, ZY, AG, FI), pp. 352–365.
- SAS-2005-BagnaraRZ #algebra #generative #invariant #using
- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra (RB, ERC, EZ), pp. 19–34.
CC-2004-Meister- Periodic Polyhedra (BM), pp. 134–149.
LICS-2004-Latour #automaton #integer- From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.
- SAS-2003-BagnaraHRZ #precise
- Precise Widening Operators for Convex Polyhedra (RB, PMH, ER, EZ), pp. 337–354.
- SAS-2003-HalbwachsMP #analysis #linear
- Cartesian Factoring of Polyhedra in Linear Relation Analysis (NH, DM, CPV), pp. 355–365.
- SAS-2002-BagnaraRZH #library
- Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library (RB, ER, EZ, PMH), pp. 213–229.
ICALP-2000-BournezM #on the #representation- On the Representation of Timed Polyhedra (OB, OM), pp. 793–807.
STOC-1999-Schaeffer #random #scalability- Random Sampling of Large Planar Maps and Convex Polyhedra (GS), pp. 760–769.
LOPSTR-1999-HoweK #source code #using- Specialising Fininte Domain Programs Using Polyhedra (JMH, AK), pp. 118–135.
ICPR-1996-SchlicherBV #locality #performance- Fast analytical medial-axis localization in convex polyhedra (MPPS, EB, PWV), pp. 55–61.
PODS-1995-BrodskyLLM #constraints- Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data (AB, CL, JLL, MJM), pp. 54–65.
PPoPP-1991-AncourtI- Scanning Polyhedra with DO Loops (CA, FI), pp. 39–50.
- ICALP-1990-DobkinK #approach
- Determining the Separation of Preprocessed Polyhedra — A Unified Approach (DPD, DGK), pp. 400–413.
- STOC-1981-Chazelle
- Convex Decompositions of Polyhedra (BC), pp. 70–79.
