Synthesis of linear ranking functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2031 LNCS, Issue , 2001, Pages 67-81

  Colón, Michael A ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; ALGORITHMS; COMPUTATION THEORY;

DEDUCTIVE VERIFICATION; LINEAR EXPRESSION; LINEAR INEQUALITIES; LINEAR RANKING; POLYHEDRAL CONE; RANKING FUNCTIONS;

ALGORITHMS; INFORMATION RETRIEVAL;

EID: 84903179505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (19)

1. Nikolaj S. Bjørner, Anca Browne, Eddie S. Chang, Michael Colon, Arjun Kapur, Zohar Manna, Henny B. Sipma, and Tomás E. Uribe. STeP: The Stanford Temporal Prover, User's Manual. Technical Report STAN-CS-TR-95-1562, Computer Science Department, Stanford University, 1995.
2. Nikolaj S. Bjørner, Anca Browne, and Zohar Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49-87, 1997.
3. Saddek Bensalem, Yassine Lakhnech, and Hassen Saidi. Powerful techniques for the automatic generation of invariants. In Rajeev Alur and Thomas A. Henzinger, editors, GAVJ96, volume 1102 of LNCS, pages 323-335. Springer-Verlag, 1996.
4. Patrick Cousot and Nicolas Halbwachs. Automatic discovery of linear re- straints among variables of a program. In 4th A.CM. Symposium on Principles of Programming Languages, 1977.
5. Joanne R. Collier, Nicholas A.M. Monk, Philip K. Maini, and Julian H. Lewis. Pattern formation by lateral inhibition with feedback: a mathematical model of delta-notch intercellular signalling. J. Theoretical. Biology, 183:429-446, 1996.
6. Dennis Dams, Rob Gerth, and Orna Grumberg. A heuristic for the automatic generation of ranking functions. In Workshop on Advances in Verification (WAVe'00), pages 1-8, 2000.
7. David Dill, personal communication. August 2000.
8. Komei Fukuda and Alain Prodon. Double description method revisited. In Combinatorics and Computer Science. 1996.
9. David Gale. The Theory of Linear Economic Models. McGraw Hill, 1960.
10. Steven M. German and B. Wegbreit. A Synthesizer of Inductive Assertions. IEEE transactions on Software Engineering, 1(1):68-75, March 1975.
11. Shmuel Katz and Zohar Manna. Logical analysis of programs. Communi- cations of the ACM, 19(4):188-206, April 1976.
12. H. W. Kuhn. Solvability and consistency for linear equations and inequalities. American Mathematics Monthly, 63, 1956.
13. P. McMullen. The maximum numbers of faces of a convex poly tope. Math-ematika, 17(4):179-184, 1970.
14. Zohar Manna and Amir Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
15. T.S. Motzkin, H. Raiffa, G. L. Thompson, and R. M. Thrall. The double description method. In H. W. Kuhn and A. W. Tucker, editors, Contributions to the Theory of Games II Princeton University Press, 1953.
16. Gosh Ronojoy and Claire Tomlin. Lateral inhibition through delta-notch signaling, a piecewise affine hybrid model. Technical report, Stanford University, 2000.
17. Alexander Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
18. J. Telgen. Minimal representation of convex polyhedral sets. Journal of Optimization Theory and Application, 38:1-24, 1982.
19. Doran K. Wilde. A library for doing polyhedral operations. Technical report, IRISA, 1993.