Predicate calculus: concepts and misconceptions (original) (raw)

Abstract

Predicate calculus: concepts and misconceptions Lex Bijlsma and Rob Nederpelt Department of Mathematics and Computing Science Eindhoven University of Technology PO Box 513 5600 MB Eindhoven, The Netherlands October 30, 1996 Abstract The paper focusses on the ...

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (74)

  1. C.J. Aarts, R.C. Backhouse, P. Hoogendijk, T.S. Voermans, and J.C.S.P. van der Woude, A relational theory of datatypes. Eindhoven University of Technology, 1992.
  2. K.R. Apt and A.O. Olderog, Verification of sequential and concurrent pro- grams. Springer-Verlag, New York, 1991.
  3. Bi.i93b]
  4. R.J .R. Back, 'Proving total correctness of nondeterministic programs in in- finitary logic'. Acta Informatica 15 (1981),233-249.
  5. D. Billington and R.G. Dromey, 'The co-invariant generator: an aid in deriv- ing loop bodies'. Formal Asp. Comput. 8 (1996),108-126.
  6. R. Berghammer, B. Elbl and U. Schmerl, 'Formalizing Dijkstra's predicate transformer wp in weak second-order logic'. TheoL Compo Sci. 146 (1995), 185 -197.
  7. R.C. Backhouse, Program construction and verification. Prentice-Hall Inter- national, London, 1986.
  8. A. Bijlsma, A case of context dependence in predicate calculus. Memorandum AB36. Eindhoven University of Technology, 1993.
  9. A. Bijlsma, Punctuality, conjunctivity, and monotonicity. Memorandum AB45. Eindhoven University of Technology, 1993.
  10. A. Bijlsma and C.S. Scholten, 'Point-free substitution'. Sci. Comput. Prog. 27 (1996), 205 -214.
  11. E. Cohen, Programming in the 1990s: an introduction to the calculation of programs. Springer-Verlag, New York, 1990.
  12. E.W. Dijkstra, A discipline of programming. Prentice-Hall, Englewood Cliffs N.J., 1976.
  13. E.W. Dijkstra, Our book's omission on quantification over scalar subtypes. Memorandum EWD1184. The University of Texas at Austin, 1994.
  14. E.W. Dijkstra, Boolean connectives yield punctual expressions. Memorandum EWD1187. The University of Texas at Austin, 1994.
  15. R.M. Dijkstra, A mathematical approach to logic. Memorandum rutger20. University of Groningen, 1994.
  16. R.M. Dijkstra, ' "Everywhere" in predicate algebra and modal logic'. Inf. Proc. L. 58 (1996), 237 -243.
  17. E.W. Dijkstra and C.S. Scholten, Predicate calculus and program semantics. Springer-Verlag, New York, 1990.
  18. M. Fitting, First-order logic and automated theorem proving. Springer-Verlag, New York, 1991.
  19. D. Gries, The science of programming. Springer-Verlag, New York, 1981.
  20. D. Gries and F.B. Schneider, A logical approach to discrete math. Springer- Verlag, New York, 1993.
  21. D. Gries and F.B. Schneider, 'Equational propositional logic'. Inf. Proc. L. 53 (1995),145-152.
  22. D. Gries and F.B. Schneider, Adding the everywhere operator to propositional logic. Memorandum. Computer Science Department, Cornell University, 1995.
  23. C.A.R. Hoare, 'An axiomatic approach to computer programming'. Comm. ACM 12 (1969),576-580,583.
  24. A. Kaldewaij, Programming: the derivation of algorithms. Prentice-Hall In- ternational, London, 1990.
  25. B. Meyer, Introduction to the theory of programming languages. Prentice-Hall International, London, 1990.
  26. J.D. Monk and R. Bonnet (eds.), S. Koppelberg, Handbook of boolean alge- bras, vol. I. North-Holland, Amsterdam, 1989.
  27. R.P. Nederpelt, De taal van de wiskunde: een verkenning van wiskundig taal- gebruik en logische redeneerpatronen. Versluys, Almere, 1987.
  28. P. Nickolas, 'The completeness of functional logic'. Formal Asp. Comput. 6 (1994),39-59.
  29. J. Staples, P.J. Robinson, and D. Hazel, 'A functional logic for higher level reasoning about computation'. Formal Asp. Comput. 6 (1994), 1-38.
  30. J.C.S.P. van der Woude, 'Plat-etudes for Carel en de elegance', in: W.H.J. Feijen and A.J.M. van Gasteren (eds.), C.S. Scholten dedicata: van oude machines en nieuwe rel(enwijzen. Academic Service, Schoonhoven, 1991.
  31. H. Schepers and R. Gerth W.M.P. van der Aalst T. KIoks and D. Kratsch F. Kamareddine and R. Nederpelt R. Post and P. De Bra J. Deogun T. Kioks D. Kratsch H. Muller Department of Mathematics and Computing Science Eindhoven University of Technology Deriving the Aho-Corasick algorithms: a case study into the synergy of program- ming methods, p. 36. A continuous version of the Prisoner's Dilemma. p. 17 Quicksort for linked lists, p. 8. Deterministic and randomized local search. p. 78. A congruence theorem for structured operational semantics with predicates, p. 18. On the unavoidability of metastable behaviour, p. 29
  32. Exercises in Multiprogramming. p. 97
  33. A Formal Deterministic Scheduling Model for Hard Real-Time Executions in DEDOS, p. 32, Systems Engineering: a Formal Approach Part I: System Concepts, p. 72. Systems Engineering: a Formal Approach Part II: Frameworks. p. 44. Systems Engineering: a Fonna1 Approach Part III: Modeling Methods, p. lOl. Systems Engineering: a Fonna1 Approach Part IV: Analysis Methods, p. 63.
  34. Systems Engineering: a Fonnal Approach Part V: Specification Language, p. 89. On Sequential Composition, Action Prefixes and Process Prefix, p. 21.
  35. A Real-Time Process Logic, p. 31.
  36. A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems, p. 27
  37. Hard Real-Time Reliable Multicast in the DEDOS system, p. 19. A congruence theorem for structured operational semantics with predicates and negative premises. p. 22. The Design of an Online Help Facility for ExSpect, p.2l. A Process Algebra of Concurrent Constraint Programming. p. 15. Freeness Analysis for Logic Programs -And Correctness, p. 24
  38. A Typechecker for Bijective Pure Type Systems. p. 28. Relational Algebra and Equational Proofs, p. 23. Pure Type Systems with Definitions, p. 38.
  39. A Compositional Proof Theory for Fault Tolerant Real-Time Distributed Systems, p. 31. Multi-dimensional Petri nets, p. 25. Finding all minimal separators of a graph, p. 11. A Semantics for a fine A -calculus with de Bruijn indices, p.49. GOLD, a Graph Oriented Language for Databases. p. 42. On Vertex Ranking for Pennutation and Other Graphs, p. 11.
  40. L. Layens and 1. Moonen 93/34 I.C.M. Baeten and I.A. Bergstra 93/35 W. Ferrer and P. Seven 93/36 I.C.M. Baeten and I.A. Bergstra 93/37 J. Brunekreef J-P. Katoen R. Koymans S. Mauw 93/38 C. Verhoef 93/39 W.P.M. Nuijten E.H.L. Aarts D.A.A. van Erp TaaIman Kip K.M. van Hee 93/40 P.D.V. van dec Stok M.M.M.P.I. Claessen D. Alstein 93/41 A. Bijlsma 93/42 P .M,P. Rambags of delay insensitive and speed independent CMOS circuits, using directed commands and production rule sets, p. 40. On the Correctness of some Algorithms to generate Finite Automata for Regular Expressions, p. 17.
  41. ILIAS, a sequential language for parallel matrix computations, p. 20. Real Time Process Algebra with Infinitesimals, p.39. Abstract Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension theorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predicate transformers, p. 11. Automatic Verification of Regular Protocols in prr Nets, p. 23. A taxomomy of finite automata construction algorithms, p. 87. A taxonomy of finite automata minimization algorithms, p. 23. A precise clock synchronization protocol,p. Treewidth and Patwidth of Cocomparability graphs of Bounded Dimension, p. 14. Browsing Semantics in the "Tower" Model, p. 19.
  42. Verifying Sequentially Consistent Memory using Interface Refinement, p. 20. The object-oriented paradigm, p. 28. Canonical typing and II-conversion, p. 51. Application of Marcov Decision Processe to Search Problems, p. 21.
  43. Graph Isomorphism Models for Non Interleaving Process Algebra, p. 18. Formal Specification and Compositional Verification of an Atomic Broadcast Protocol, p. 22. Time and the Order of Abstract Events in Distributed Computations, p. 29. Logic Programming and Negation: A Survey, p. 62.
  44. A Hierarchical Diagrammatic Representation of Class Structure, p. 22. Process Algebra with Partial Choice, p. 16. ,
  45. T. verhoeff
  46. J. Peleska C. Huizing C. Petersohn 94/12 T. Kloks D. Kratsch H. Muller
  47. R. Selje.,
  48. W. Peremans
  49. R.J.M. Vaessens E.H .L. Aarts
  50. B,W. Watson
  51. B.W. Watson
  52. S. Mauw and M.A. Reniers . 31. A Comparison of Ward & Mellor's Transfonnation Schema with State-& Activitycharts, p. 30. Dominoes, p. 14.
  53. A New Method for Integrity Constraint checking in Deductive Databases, p. 34. Ups and Downs of Type Theory, p. 9. Job Shop Scheduling by Local Search, p. 21. MathematicaJ Induction Made Calculational, p. 36. An Algebraic Semantics of Basic Message Sequence Charts, p. 9. Refining Reduction in the Lambda Calculus, p. 15. The perfonnance of single-keyword and multiple-keyword pattern matching algorithms, p. 46. Beyond p-Reduction in Church's A---*, p. 22. An introduction to the Fire engine: A C++ toolkit for Finite automata and Regular Expressions. The design and implementation of the FIRE engine: A C++ toolkit for Finite automata and regular Expressions. An algebraic semantics of Message Sequence Charts, p. 43. Abstract Interpretation of Reactive Systems: Abstractions Preserving \fCTL*, 3CTL* and CTL*, p. 28. Kl.3-free and Wrfree graphs, p. 10. On the foundations of functionaJ programming: a programmer's point of view, p. 54. Regularity of BPA-Systems is Decidable, p. 14. Stars or Stripes: a comparative study of finite and transfinite techniques for surface modelling, p. 20. Correctness of ReaJ Time Systems by Construction, p. 22. Process Algebra with Feedback, p. 22.
  54. A Boyer-Moore type aJgorithm for regular expression pattern matching, p. 22.
  55. Fischer's Protocol in Timed Process Algebra, p. 38. A fonnalization of the Ramified Type Theory, p.40. The Barendregt Cube with Definitions and Generalised Reduction, p. 37. Delayed choice: an operator for joining Message Sequence Charts, p. 15. Canonical typing and TI-conversion in the Barendregt Cube, p. 19. Simulating and Analyzing Railway Interlockings in ExSpect, p. 30. Point-free substitution, p. 10.
  56. J .C.M. Baeten J .A. Bergstra
  57. H. Geuvers 94/51 T. Kloks D. Kratsch H. Muller
  58. W. Penczek R. Kuiper
  59. R. Gerth R. Kuiper D. Peled W. Penczek
  60. J.J. Lukkien 95/02 M. Bezem R. Bol I.F. Groote
  61. I.C.M. Baeten C. Verhoef
  62. J. Hidders 95/05 P. Severi of splitgraphs. p. 4. Distributed Consensus and Hard Rea1•Time Systems, p. 34. Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph, p. 6. Concatenation of Graphs, p. 7. Category Theory as Coherently Constructive Lattice Theory: An Illustration, p. 35. Verifying Sequentially Consistent Memory, p. 160 Tutorial voor de ExSpect-bibliotheek voor "Administratieve Logistiek", p. 43. The A -cube with classes of tenns modulo conversion, p. 16. On II-conversion in Type Theory, p. 12. Fixed-Point Calculus, p. II. Process Algebra with Propositional Signals, p. 25. A short and flexible proof of Strong Nonnalazation for the Calculus of Constructions, p. 27. Listing simplicial vertices and recognizing diamond-free graphs, p. 4. Traces and Logic, p. 81
  63. A Partial Order Approach to Branching Time Logic Model Checking, p. 20. The Construction of a small CommunicationLibrary, p.l6. Fonnalizing Process Algebraic Verifications in the Calculus of Constructions, p.49. Concrete process algebra, p. 134. An Isotopic Invariant for Planar Drawings of Connected Planar Graphs, p. 9. A Type Inference Algorithm for Pure Type Systems, p.20. A Quantitative Analysis of Iterated Local Search, p.23. Drawing Execution Graphs by Parsing, p. 10. Preservation of Strong Nonnalisation for Explicit Substitution, p. 12. Discrete Time Process Algebra, p. 20
  64. Mathlpad: A System for On-Line Prepararation of Mathematical Documents, p. 15
  65. R. Seljee S. Mauw and M. Reniers B.W. Watson and G. Zwaan A. Ponse, C. Verhoef, S.F.M. Vlijmen (eds.)
  66. P. Niebert and W. Penczek D. Dams, O. Grumberg, R. Gerth S. Mauw and E.A. van dec Meulen F. Kamareddine and T. Laan I.C.M. Baeten and I.A. Bergstra F. van Raamsdonk and P. Severi A. van Deursen B. Arnold, A. v. Deursen, M. Res W.M.P. van dec Aalst F.P.M. Dignum, W.P.M. Nuijten, L.M.A. Janssen L. Feijs W.M.P. van der Aalst P.D.V. van dec Stok, J. van dec Wal W. Fokkink, C. Verhoef H. Jurjus J. Hidders, C. Hoskens, J. Paredaens P. Kelb, D. Dams and R. Gerth W.M.P. van dec Aalst J. Engelfriet and JJ. Vereijken J. Zwanenburg T. Basten and M. Voorhoeve M. Voorhoeve and T. Basten P. de Bra and A. Aerts W.M.P. van dec AaIst S. Mauw T. Basten and W.M.P. v.d. Aalst W.M.P. van dec Aalst and T. Basten M. Voorhoeve A.T.M. Aerts, P.M.E. De Bra, J.T. de Munk F. Dignum, H. Weigand, E. Verharen R. Bloo, H. Geuvers T. Laan F. Kamareddine and T. Laan T. Borghuis Deductive Database Systems and integrity constraint checking, p. 36. Empty Interworkings and Refinement Semantics ofInterworkings Revised, p. 19. A taxonomy of sublinear mUltiple keyword pattern matching algorithms, p. 26. De proceedings: ACP'95, p. On the Connection of Partial Order Logics and Partial Order Reduction Methods, p. 12. Abstract Interpretation of Reactive Systems: Preservation of CTL *. p. 27. Specification of tools for Message Sequence Charts, p. 36.
  67. A Reflection on Russell's Ramified Types and Kripke's Hierarchy of Truths, p. 14. Discrete Time Process Algebra with Abstraction, p. t5. On Normalisation, p. 33. Axiomatizing Early and Late Input by Variable Elimination, p. 44. An Algebraic Specification of a Language for Describing Financial Products, p. 11. Petri net based scheduling, p. 20. Solving a Time Tabling Problem by Constraint Satisfaction, p. 14. Synchronous Sequence Charts In Action, p. 36.
  68. A Class of Petri nets for modeling and analyzing business processes. p. 24. Proceedings of the Real-Time Database Workshop, p. 106.
  69. A Conservative Look at term Deduction Systems with Variable Binding, p. 29. On Nesting of a Nonmonotonic Conditional, p. 14 The formal Model of a Pattern Browsing Technique, p.24. Practical Symbolic Model Checking of the full Jl-calculus using Compositional Abstractions, p. 17. Handboek simulatie, p. 51. Context-Free Graph Grammars and Concatenation of Graphs, p. 35. Record concatenation with intersection types, p. 46. An algebraic semantics for hierarchical Pff Nets, p. 32. Process Algebra with Autonomous Actions. p. 12.
  70. Multi-User Publishing in the Web: DreSS, A Document Repository Service Station. p. 12
  71. Parallel Computation of Reachable Dead States in a Free-choice Petri Net, p. 26. Example specifications in phi-SDL.
  72. A Process-Algebraic Approach to Life-Cycle Inheritance Inheritance = Encapsulation + Abstmction, p. 15. Life-Cycle Inheritance A Petri-Net-Based Approach. p. 18. Structural Petri Net Equivalence, p. 16. OODB Support for WWW Applications: Disclosing the internal structure of Hyperdocuments, p. 14.
  73. A Formal Specification of Deadlines using Dynamic Deontic Logic, p. 18. Explicit Substitution: on the Edge of Strong Normalisation, p. 13. AUTOMATH and Pure Type Systems. p. 30.
  74. A Correspondence between Nuprl and the Ramified Theory of Types, p. 12. Priorean Tense Logics in Modal Pure Type Systems. p. 61