Uniform Substitution At One Fell Swoop

Uniform substitution of function, predicate, program or game symbols is the core operation in parsimonious provers for hybrid systems and hybrid games. By postponing soundness-critical admissibility checks does this paper introduce a uniform substitution mechanism that proceeds in a linear pass homomorphically along the formula. Soundness is recovered using a simple variable condition at the replacements performed by the substitution. The setting in this paper is that of hybrid games, in which discrete, continuous, and adversarial dynamics interact in differential game logic dGL. This paper proves soundness and completeness of one-pass uniform substitutions for dGL.

[1]  Nathan Fulton,et al.  KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems , 2015, CADE.

[2]  Alonzo Church,et al.  Introduction to Mathematical Logic , 1991 .

[3]  H. Hornich.  A system of logistic , 1936 .

[4]  André Platzer,et al.  A Complete Uniform Substitution Calculus for Differential Dynamic Logic , 2016, Journal of Automated Reasoning.

[5]  W. Ackermann,et al.  Grundzuge der Theoretischen Logik , 1928 .

[6]  Bernhard Beckert,et al.  Deductive Software Verification – The KeY Book , 2016, Lecture Notes in Computer Science.

[7]  Hubert H. Schneider.  Substitutions for predicate variables and functional variables , 1980, Notre Dame J. Formal Log..

[8]  André Platzer,et al.  Playing Hybrid Games with KeYmaera , 2012, IJCAR.

[9]  Arne Meier,et al.  Parametrised Complexity of Satisfiability in Temporal Logic , 2017, ACM Trans. Comput. Log..

[10]  Leon Henkin,et al.  Banishing the rule of substitution for functional variables , 1953, Journal of Symbolic Logic.

[11]  L. M.-T..  Grundzüge der theoretischen Logik , 1929, Nature.

[12]  André Platzer,et al.  Differential Hybrid Games , 2015, ACM Trans. Comput. Log..

[13]  André Platzer,et al.  Formally verified differential dynamic logic , 2017, CPP.

[14]  R. Elliott,et al.  Cauchy problems for certain Isaacs-Bellman equations and games of survival , 1974 .

[15]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.

[16]  André Platzer.  Uniform Substitution for Differential Game Logic , 2018, IJCAR.

[17]  P. Souganidis,et al.  Differential Games and Representation Formulas for Solutions of Hamilton-Jacobi-Isaacs Equations. , 1983 .

[18]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[19]  de Ng Dick Bruijn,et al.  Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem , 1972 .

[20]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[21]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[22]  André Platzer,et al.  Differential Game Logic , 2014, ACM Trans. Comput. Log..