Bradley, Manna. The Calculus of Computation, Springer, 2007

References

1.W. Ackermann. Solvable cases of the decision problem. The Journal of Symbolic Logic, 22(1):68–72, March 1957.

2.A. Aiken. Introduction to set constraint-based program analysis. Science of Computer Programming, 35(2-3):79–111, November 1999.

3.R. Alur, T. Henzinger, and O. Kupferman. Alternating-time temporal logic. Journal of the ACM, 49:672–713, 2002.

4.F. Baader, S. Ghilardi, and C. Tinelli. A new combination procedure for the word problem that generalizes fusion decidability results in modal logics.

Information and Computation, 204(10):1413–1452, 2006.

5.N. S. Bjørner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theoretical Computer Science, 173(1):49–87, 1997.

6.A. R. Bradley. Safety Analysis of Systems. PhD thesis, Stanford University, June 2007.

7.A. R. Bradley, Z. Manna, and H. B. Sipma. Linear ranking with reachability. In Computer Aided Verification, volume 3576 of LNCS, pages 491–504. SpringerVerlag, 2005.

8.A. R. Bradley, Z. Manna, and H. B. Sipma. Termination of polynomial programs. In Verification, Model Checking and Abstract Interpretation, volume 3385 of LNCS, pages 113–129. Springer-Verlag, 2005.

9.A. R. Bradley, Z. Manna, and H. B. Sipma. What’s decidable about arrays? In Verification Model Checking and Abstract Interpretation, volume 3855 of

LNCS, pages 427–442. Springer-Verlag, January 2006.

10.R. E. Bryant. Graph-based algorithms for Boolean function manipulation.

IEEE Transactions on Computers, 35(8):677–691, August 1986.

11.R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.

12.J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, 1992.

13.A. Church. A note on the Entscheidungsproblem. Journal of Symbolic Logic, 1, 1936.

14.E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.

15.E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, pages 52–71. Springer-Verlag, 1982.

352References

16.E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexampleguided abstraction refinement. In Computer Aided Verification, volume 1855 of LNCS, pages 154–169. Springer-Verlag, 2000.

17.M. Col´on, S. Sankaranarayanan, and H. B. Sipma. Linear invariant generation using non-linear constraint solving. In Computer Aided Verification, volume 2725 of LNCS, pages 420–433. Springer-Verlag, 2003.

18.M. Col´on and H. B. Sipma. Synthesis of linear ranking functions. In Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of

LNCS, pages 67–81. Springer-Verlag, April 2001.

19.D. C. Cooper. Theorem proving in arithmetic without multiplication. Machine Intelligence, 7:91–99, 1972.

20.P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In

Principles of Programming Languages, pages 238–252. ACM Press, 1977.

21.P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among the variables of a program. In Principles of Programming Languages, pages 84–96. ACM Press, 1978.

22.G. B. Dantzig. Programming in a Linear Structure. USAF, February 1948.

23.G. B. Dantzig. Maximization of linear function of variables subject to linear inequalities. In Cowles Commission for Research in Economics, volume 13, pages 339–347. Wiley, 1951.

24.S. Das and D. L. Dill. Successive approximation of abstract transition relations. In Logic in Computer Science, page 51. IEEE Computer Society, 2001.

25.M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5(7):394–397, July 1962.

26.M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201–215, July 1960.

27.D. L. Detlefs, K. R. M. Leino, G. Nelson, and J. B. Saxe. Extended static checking. Technical Report 159, Compaq SRC, December 1998.

28.E. W. Dijkstra. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM, 18(8):453–457, August 1975.

29.P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subexpressions problem. Journal of the ACM, 27(4):758–771, 1980.

30.B. Dreben and H. Putnam. The Craig interpolation lemma. Notre Dame Journal of Formal Logic, 8(3):229–233, July 1967.

31.H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972.

32.J. Ferrante and C. Racko . A decision procedure for the first order theory of real addition with order. SIAM Journal on Computing, 4(1):69–76, 1975.

33.M. J. Fischer and M. O. Rabin. Super-exponential complexity of Presburger arithmetic. In R. M. Karp, editor, Complexity of Computation, volume 7 of SIAM-AMS Proceedings, pages 27–42. American Mathematical Society, 1974.

34.R. W. Floyd. Assigning meanings to programs. In Symposia in Applied Math-

ematics, volume 19, pages 19–32. American Mathematical Society, 1967.

¨

35. K. G¨odel. Uber die Vollst¨andigkeit des Logikkalk¨uls. PhD thesis, University of Vienna, 1929.

¨

36. K. G¨odel. Uber formal unentscheidbare S¨atze der Principia Mathematica und verwandter Systeme I. Monatshefte f¨ur Mathematik und Physik, 38:173–198, 1931.

References 353

37.S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Computer Aided Verification, volume 1254 of LNCS, pages 72–83. SpringerVerlag, 1997.

38.D. Hilbert. Die Grundlagen der Mathematik. Abhandlungen aus dem Seminar der Hamburgischen Universit¨at, 6:65–85, 1928.

39.C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–580, October 1969.

40.W. Hodges. A Shorter Model Theory. Cambridge University Press, 1997.

41.J. E. Hopcroft, R. Motwani, and J. D. Ullman. Automata Theory, Languages, and Computation. Addison-Wesley, 3rd edition, 2006.

42.R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.

43.J. Ja ar. Presburger arithmetic with array segments. Information Processing Letters, 12(2):79–82, 1981.

44.L. Kantorovich. Mathematical methods of organizing and planning production. Management Science, 6:366–422, 1960. In Russian, Leningrad University, 1939.

45.N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4:373–395, 1984.

46.M. Karr. A ne relationships among variables of a program. Acta Informatica, 6:133–151, 1976.

47.M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, 2000.

48.M. Kaufmann, J. S. Moore, S. Ray, and E. Reeber. Integrating external deduction tools with ACL2. In Workshop on the Implementation of Logics, volume 212, pages 7–26, 2006.

49.L. G. Khachian. A polynomial algorithm in linear programming. Soviet Math. Dokl., 20:191–194, 1979. In Russian, Dokl. Akad. Nauk SSSR 244, 1093–1096, 1979.

50.J. King. A Program Verifier. PhD thesis, Carnegie Mellon University, September 1969.

51.IEEE Symposium on Logic in Computer Science. http://www2.informatik. hu-berlin.de/lics.

52.Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974. Also Dover, 2004.

53.Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1991.

54.Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.

55.Z. Manna and R. Waldinger. The Deductive Foundations of Computer Programming. Addison-Wesley, 1993.

56.Z. Manna and C. G. Zarba. Combining decision procedures. In Formal Methods at the Cross Roads: From Panacea to Foundational Support, volume 2757 of

LNCS, pages 381–422. Springer-Verlag, 2003.

57.P. Mateti. A decision procedure for the correctness of a class of programs.

Journal of the ACM, 28(2), 1981.

58.J. McCarthy. Towards a mathematical science of computation. In International Federation for Information Processing, pages 21–28, 1962.

59.J. McCarthy. A basis for a mathematical theory of computation. Computer Programming and Formal Systems, 1963.

354References

60.R. Milner. Communication and Concurrency. Prentice Hall, 1989.

61.A. Min´e. The octagon abstract domain. In Analysis, Slicing and Transformation (part of Working Conference on Reverse Engineering), IEEE, pages 310–319. IEEE Computer Society, October 2001.

62.S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers Inc., 1997.

63.M. M¨uller-Olm and H. Seidl. A note on Karr’s algorithm. In International Colloquium on Automata, Languages and Programming, volume 3142 of LNCS, pages 1016–1027. Springer-Verlag, 2004.

64.G. Nelson. Combining satisfiability procedures by equality-sharing. Contemporary Mathematics, 29:201–211, 1984.

65.G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures.

ACM Transactions on Programming Languages and Systems, 1(2):245–257, October 1979.

66.G. Nelson and D. C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356–364, April 1980.

67.T. Nipkow, L. C. Paulson, and M. Wenzel. Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer-Verlag, 2002.

68.D. C. Oppen. A 222pn upper bound on the complexity of Presburger arithmetic.

Journal of Computer and System Sciences, 16(3):323–332, 1978.

69.D. C. Oppen. Reasoning about recursively defined data structures. In Principles of Programming Languages, pages 151–157. ACM Press, 1978.

70.D. C. Oppen. Complexity, convexity and combinations of theories. Theoretical Computer Science, 12:291–302, 1980.

71.D. C. Oppen. Reasoning about recursively defined data structures. Journal of the ACM, 27(3):403–411, July 1980.

72.C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1993.

¨

73. M. Presburger. Uber die Vollst¨andigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchen die Addition als einzige Operation hervortritt. In

Comptes Rendus du Premier Congr´es des Math´ematicienes des Pays Slaves, pages 92–101, 1929.

74. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In International Symposium on Programming, volume 137 of LNCS. Springer-Verlag, 1982.

75. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In Logic in Computer Science, pages 55–74. IEEE Computer Society, 2002.

76. A. Riazanov and A. Voronkov. The design and implementation of VAMPIRE. AI Communications, 15(2):91–110, September 2002.

77. L. E. Rosier. A note on Presburger arithmetic with array segments, permutation and equality. Information Processing Letters, 22(1):33–35, 1986.

78. H. Ruess and N. Shankar. Deconstructing Shostak. In Logic in Computer Science. IEEE Computer Society, 2001.

79. B. Russell. Philosophy of Logical Atomism, 1918.

80. S. Sankaranarayanan, M. Col´on, H. Sipma, and Z. Manna. E cient strongly relational polyhedral analysis. In Verification, Model Checking, and Abstract Interpretation, volume 3855 of LNCS, pages 111–125, 2006.

81. The international SAT competitions web page. http://www.satcompetition. org.

82. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.

References 355

83.R. E. Shostak. An algorithm for reasoning about equality. Communications of the ACM, 21(7):583–585, July 1978.

84.R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1– 12, January 1984.

85.M. Sipser. Introduction to the Theory of Computation. Course Technology, 1996.

86.SMT-LIB: SMT solver competition. http://goedel.cs.uiowa.edu/smtlib.

87.R. M. Smullyan. First-Order Logic. Dover, 1968.

88.A. Stump, C. W. Barrett, D. L. Dill, and J. Levitt. A decision procedure for an extensional theory of arrays. In Logic in Computer Science, pages 29–37. IEEE Computer Society, 2001.

89.N. Suzuki and D. Je erson. Verification decidability of Presburger array programs. Journal of the ACM, 27(1):191–205, January 1980.

90.A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.

91.W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 133–191. Elsevier NorthHolland, Inc., 1990.

92.C. Tinelli and M. T. Harandi. A new correctness proof of the Nelson-Oppen combination procedure. In Frontiers of Combining Systems, pages 103–120. Kluwer Academic Publishers, 1996.

93.C. Tinelli and C. Ringeissen. Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science, 290(1):291– 353, January 2003.

94.C. Tinelli and C. Zarba. Combining non-stably infinite theories. Technical Report TinZar-RR-03, University of Iowa, 2003.

95.M. Y. Vardi. An automata-theoretic approach to linear temporal logic. In

Logics for Concurrency: Structure versus Automata, pages 238–266. SpringerVerlag, 1996.

96.R. Wilhelm, S. Sagiv, and T. W. Reps. Parametric shape analysis via 3-valued logic. Transactions on Programming Languages and Systems, 24(3):217–298, May 2002.

97.M. Yadegari. The use of mathematical induction by Abu Kamil Shuja’ Ibn Aslam (850-930). Isis, 69(2):259–262, June 1978.

98.R. Zach. Hilbert’s program. In E. N. Zalta, editor, The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Fall 2003. http: //plato.stanford.edu/archives/fall2003/entries/hilbert-program.

99.C. Zarba, Z. Manna, and H. B. Sipma. Combining theories sharing dense orders. In Automated Reasoning with Analytic Tableaux and Related Methods: Position Papers and Tutorials, pages 83–98, 2003.

100.T. Zhang, H. B. Sipma, and Z. Manna. Decision procedures for term algebras with integer constraints. Information and Computation, 204(10):1526–1574, October 2006.