The Domain of Parametric Hypercubes for Static Analysis of Computer Games Software

Computer Games Software deeply relies on physics simulations, which are particularly demanding to analyze because they manipulate a large amount of interleaving floating point variables. Therefore, this application domain is an interesting workbench to stress the trade-off between accuracy and efficiency of abstract domains for static analysis.

[1]  Gogul Balakrishnan,et al.  Donut Domains: Efficient Non-convex Domains for Abstract Interpretation , 2012, VMCAI.

[2]  Gianluca Amato,et al.  The Abstract Domain of Parallelotopes , 2012, Electron. Notes Theor. Comput. Sci..

[3]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[4]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[5]  Sriram Sankaranarayanan,et al.  Static Analysis in Disjunctive Numerical Domains , 2006, SAS.

[6]  Nicolas Halbwachs,et al.  Verification of Linear Hybrid Systems by Means of Convex Approximations , 1994, SAS.

[7]  Olivier Bouissou.  From control-command synchronous programs to hybrid automata , 2012, ADHS.

[8]  Gilberto Filé,et al.  The Powerset Operator on Abstract Interpretations , 1999, Theor. Comput. Sci..

[9]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[10]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[11]  Antoine Miné,et al.  The octagon abstract domain , 2001, High. Order Symb. Comput..

[12]  Edmund M. Clarke,et al.  Counterexample-Guided Abstraction Refinement , 2000, CAV.

[13]  Samuel Mimram,et al.  HySon: Set-based simulation of hybrid systems , 2012, 2012 23rd IEEE International Symposium on Rapid System Prototyping (RSP).

[14]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[15]  Rajeev Alur,et al.  Reachability Analysis of Hybrid Systems via Predicate Abstraction , 2002, HSCC.

[16]  Agostino Cortesi,et al.  Linear Approximation of Continuous Systems with Trapezoid Step Functions , 2012, APLAS.

[17]  Patrick Cousot,et al.  The calculational design of a generic abstract interpreter , 1999 .

[18]  David H. Eberly.  3D game engine architecture - engineering real-time applications with wild magic , 2005, The Morgan Kaufmann series in interactive 3D technology.

[19]  Sagar Chaki,et al.  Boxes: A Symbolic Abstract Domain of Boxes , 2010, SAS.

[20]  Yassamine Seladji,et al.  Fixpoint Computation in the Polyhedra Abstract Domain Using Convex and Numerical Analysis Tools , 2013, VMCAI.

[21]  P. Hill,et al.  Widening operators for powerset domains , 2006 .

[22]  Nicolas Halbwachs,et al.  Some ways to reduce the space dimension in polyhedra computations , 2006, Formal Methods Syst. Des..

[23]  Xavier Rival,et al.  Trace Partitioning in Abstract Interpretation Based Static Analyzers , 2005, ESOP.

[24]  Shlomo Nir,et al.  NATO ASI Series , 1995 .

[25]  Manfred Broy,et al.  Calculational system design , 1999 .

[26]  Stefan Ratschan,et al.  Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement , 2005, HSCC.

[27]  Dave H. Eberly.  Game Physics , 2003 .

[28]  Jacob M. Howe,et al.  Quadtrees as an Abstract Domain , 2010, Electron. Notes Theor. Comput. Sci..

[29]  George J. Pappas,et al.  Discrete abstractions of hybrid systems , 2000, Proceedings of the IEEE.

[30]  Olivier Bouissou.  Proving the Correctness of the Implementation of a Control-Command Algorithm , 2009, SAS.