Patrick Cousot
Nicolas Halbwachs
- M. L. BALINSKI, An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Indust. Appl. Mathem., 9, {March 1961}Google Scholar
- A. CHARNES, W. W. COOPER and A. HENDERSON, An Introduction to Linear Programming, J.Wiley, New-York, {1953}Google Scholar
- P. COUSOT and R. COUSOT, Static determination of dynamic properties of programs, 2nd Int. Symposium on Programming, B. Robinet(Ed.), Dunod, Paris, {1976}Google Scholar
- P. COUSOT and R. COUSOT, Abstracts interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Conf. Record of the 4th ACM Symposium on Principles of Programming Languages, {Jan.1977} Google ScholarDigital Library
- N. E. DYER and L. G. PROLL, An algorithm for determining all extreme points of a convex polytope, Mathematical Programming, 12, {1977}Google Scholar
- M. KARR, Affine relationships among variables of a program, Acta Informatica, 6, {1976}Google Scholar
- V. KLEE, Some characterizations of convex polyhedra, Acta Mathematica, 102, {1959}Google Scholar
- V. KLEE, On the number of vertices of a convex polytope, Canadian J. of Mathematics, 16,{1964}Google Scholar
- D. E. KNUTH, The art of computer programming, vol.3, Sorting and Searching, Addison-Wensley Pub.Co., Reading, Mass, {1973} Google ScholarDigital Library
- H. W. KUHN, Solvability and consistency for linear equations and inequalities, Amer. Math. Monthly, 63, {1956}Google Scholar
- E. LANERY, Recherche d'un système générateur minimal d'un polyhedre convexe, Thèse de 3ème cycle, Caen, France, {1966}Google Scholar
- M. MANAS and J. NEDOMA, Finding all vertices of a convex polyhedron, Numerische Mathematik, 12, {1968}Google Scholar
- T. H. MATTHEIS, An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Operations Research, 21, {1973}Google Scholar
- T. L. SAATY, The number of vertices of a polyhedron, Amer. Math. Monthly, 62, {1955}Google Scholar
- M. SIMONNARD, Programmation Linéaire, Dunod, Paris, {1973}Google Scholar
- N. SUZUKI and K. ISHIHATA, Implementation of an array bound checker, Conf. Record of the 4th ACM Symposium on Principles of programming languages, {Jan.1977} Google ScholarDigital Library
- B. WEGBREIT, Property extraction in well founded property sets, IEEE Trans. on Soft. Eng., vol. SE-1, no3, {Sept.1975}Google Scholar
- H. WEYL, The elementary theory of convex polyhedra, Annals of Math. Study, 24, {1950}Google Scholar
Recommendations
Talk amongst yourselves: inviting users to participate in online conversations
IUI '07: Proceedings of the 12th international conference on Intelligent user interfacesMany small online communities would benefit from increased diversity or activity in their membership. Some communities run the risk of dying out due to lack of participation. Others struggle to achieve the critical mass necessary for diverse and ...
“Use-once” variables and linear objects: storage management, reflection and multi-threading
Programming languages should have 'use-once' variables in addition to the usual 'multiple-use' variables. 'Use-once' variables are bound to linear (unshared, unaliased, or singly-referenced) objects. Linear objects are cheap to access and manage, ...
Comments