Theory of linear and integer programming
Theory of linear and integer programming
Theory of hybrid systems and discrete event systems
Theory of hybrid systems and discrete event systems
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A New Numerical Abstract Domain Based on Difference-Bound Matrices
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
A Discrete Strategy Improvement Algorithm for Solving Parity Games
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
WCRE '01 Proceedings of the Eighth Working Conference on Reverse Engineering (WCRE'01)
Precise interprocedural analysis through linear algebra
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static analysis by policy iteration on relational domains
ESOP'07 Proceedings of the 16th European conference on Programming
Precise fixpoint computation through strategy iteration
ESOP'07 Proceedings of the 16th European conference on Programming
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
A policy iteration algorithm for computing fixed points in static analysis of programs
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Precise Interval Analysis vs. Parity Games
FM '08 Proceedings of the 15th international symposium on Formal Methods
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Computing relaxed abstract semantics w.r.t. quadratic zones precisely
SAS'10 Proceedings of the 17th international conference on Static analysis
Solving systems of rational equations through strategy iteration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving strategies via SMT solving
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Widening with thresholds for programs with complex control graphs
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Template-Based unbounded time verification of affine hybrid automata
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Abstract interpretation meets convex optimization
Journal of Symbolic Computation
Tropical linear-fractional programming and parametric mean payoff games
Journal of Symbolic Computation
Proving Termination by Policy Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract acceleration of general linear loops
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Bias-variance tradeoffs in program analysis
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
We present a practical algorithm for computing exact least solutions of systems of equations over the rationals with addition, multiplication with positive constants, minimum and maximum. The algorithm is based on strategy improvement combined with solving linear programming problems for each selected strategy. We apply our technique to compute the abstract least fixpoint semantics of affine programs over the relational template constraint matrix domain [20]. In particular, we thus obtain practical algorithms for computing the abstract least fixpoint semantics over the zone and octagon abstract domain.