Theory of linear and integer programming
Theory of linear and integer programming
Constraint propagation with interval labels
Artificial Intelligence
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inductive definitions, semantics and abstract interpretations
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Fourier's algorithm for linear arithmetic constraints
Journal of Automated Reasoning
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
Science of Computer Programming - Special issue on concurrent constraint programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Science of Computer Programming
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Double Description Method Revisited
Selected papers from the 8th Franco-Japanese and 4th Franco-Chinese Conference on Combinatorics and Computer Science
Synthesis of Linear Ranking Functions
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Improving the Results of Static Analyses Programs by Local Decreasing Iteration
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
A Note on Abstract Interpretation Strategies for Hybrid Automata
Hybrid Systems II
Inferring Argument Size Relationships with CLP(R)
LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Natural-Semantics-Based Abstract Interpretation (Preliminary Version)
SAS '95 Proceedings of the Second International Symposium on Static Analysis
Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract)
SAS '97 Proceedings of the 4th International Symposium on Static Analysis
On Discrete Modeling and Model Checking for Nonlinear Analog Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A static analyzer for large safety-critical software
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Dynamic Programming
Precise and efficient static array bound checking for large embedded C programs
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
A framework for numeric analysis of array operations
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
cTI: a constraint-based termination inference tool for ISO-Prolog
Theory and Practice of Logic Programming
Not necessarily closed convex polyhedra and the double description method
Formal Aspects of Computing
Precise widening operators for convex polyhedra
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Verifying analog oscillator circuits using forward/backward abstraction refinement
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Some ways to reduce the space dimension in polyhedra computations
Formal Methods in System Design
Widening operators for powerset domains
International Journal on Software Tools for Technology Transfer (STTT) - A View from Formal Methods 2003 (pp 301-354); Special Section on Recent Advances in Hardware Verification (pp 355-447)
Automating mimicry attacks using static binary analysis
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
SPHIN: A model checker for reconfigurable hybrid systems based on SPIN
Electronic Notes in Theoretical Computer Science (ENTCS)
Grids: a domain for analyzing the distribution of numerical values
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Verifying generalized soundness of workflow nets
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Automatic rectangular refinement of affine hybrid systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Polyhedra-Based approach for incremental validation of real-time systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Efficient strongly relational polyhedral analysis
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Generation of basic semi-algebraic invariants using convex polyhedra
SAS'05 Proceedings of the 12th international conference on Static Analysis
Counterexample driven refinement for abstract interpretation
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Convexity recognition of the union of polyhedra
Computational Geometry: Theory and Applications
Exact join detection for convex polyhedra and other numerical abstractions
Computational Geometry: Theory and Applications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic and analytic techniques for resource analysis of java bytecode
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Static contract checking with abstract interpretation
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Parametric verification and test coverage for hybrid automata using the inverse method
RP'11 Proceedings of the 5th international conference on Reachability problems
A new look at the automatic synthesis of linear ranking functions
Information and Computation
| Hi-index | 5.23 |
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission-critical systems. For such applications, the identification of an appropriate complexity-precision trade-off is a particularly acute problem, so that the availability of a wide spectrum of alternative solutions is mandatory. We survey the range of applications of polyhedral computations in this area; give an overview of the different classes of polyhedra that may be adopted; outline the main polyhedral operations required by automatic analyzers and verifiers; and look at some possible combinations of polyhedra with other numerical abstractions that have the potential to improve the precision of the analysis. Areas where further theoretical investigations can result in important contributions are highlighted.