object Context
Context management, position splitting, and extraction tools. Useful for splitting a formula at a position into the subexpression at that position and the remaining context around it. Or for replacing a subexpression by another subexpression at all cost. Or for splitting a position into a formula position and a term position.
Split a formula at a position into subformula and its context
val parser = KeYmaeraXParser val f = parser("x^2>=0 & x<44 -> [x:=2;{x'=1&x<=10}]x>=1") // split f into context ctx and subformula g such that f is ctx{g} val (ctx,g) = Context.at(f, PosInExpr(1::1::Nil)) // x^2>=0 & x<44 -> [x:=2;{x'=1&x<=10}]_ println(ctx) // x>=1 println(f) println(f + " is the same as " + ctx(g))
- See also
- Alphabetic
- By Inheritance
- Context
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
val
DotDiffProgram: DifferentialProgramConst
Placeholder for differential programs.
Placeholder for differential programs. Reserved predicational symbol _ for substitutions are unlike ordinary predicational symbols
-
val
DotProgram: ProgramConst
Placeholder for programs.
Placeholder for programs. Reserved predicational symbol _ for substitutions are unlike ordinary predicational symbols
-
def
apply[T <: Expression](ctx: T): Context[T]
Make a context for expression
ctx
guarded by the protection of uniform substitutions. -
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
at(a: Program, pos: PosInExpr): (Context[Program], Expression)
Split
C{e}=a(pos)
programa
at position pos into the expression e at that position and the context C within which that expression occurs.Split
C{e}=a(pos)
programa
at position pos into the expression e at that position and the context C within which that expression occurs. ThusC{e}
will equal the originala
ande
occurs at position pos ina
. (provided that back-substitution is admissible, otherwise a direct replacement inC
atpos
toe
will equalt
). -
def
at(f: Formula, pos: PosInExpr): (Context[Formula], Expression)
Split
C{e}=f(pos)
formula f at position pos into the expression e at that position and the context C within which that expression occurs.Split
C{e}=f(pos)
formula f at position pos into the expression e at that position and the context C within which that expression occurs. ThusC{e}
will equal the originalf
ande
occurs at position pos inf
(provided that back-substitution is admissible, otherwise a direct replacement inC
atpos
toe
will equalt
). -
def
at(t: Term, pos: PosInExpr): (Context[Term], Expression)
Split
C{e}=t(pos)
term t at position pos into the expression e at that position and the context C within which that expression occurs.Split
C{e}=t(pos)
term t at position pos into the expression e at that position and the context C within which that expression occurs. ThusC{e}
will equal the originalt
ande
occurs at position pos int
(provided that back-substitution is admissible, otherwise a direct replacement inC
atpos
toe
will equalt
). -
def
at(t: Expression, pos: PosInExpr): (Context[Expression], Expression)
Split
C{e}=t(pos)
expression t at position pos into the expression e at that position and the context C within which that expression occurs.Split
C{e}=t(pos)
expression t at position pos into the expression e at that position and the context C within which that expression occurs. ThusC{e}
will equal the originalt
ande
occurs at position pos int
(provided that back-substitution is admissible, otherwise a direct replacement inC
atpos
toe
will equalt
). -
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
replaceAt(program: Program, pos: PosInExpr, repl: Expression): Program
Replace within program at position pos by repl @see StaticSemanticsTools.boundAt() for same positions
-
def
replaceAt(formula: Formula, pos: PosInExpr, repl: Expression): Formula
Replace within formula at position pos by repl @see StaticSemanticsTools.boundAt() for same positions
-
def
replaceAt(term: Term, pos: PosInExpr, repl: Expression): Term
Replace within term at position pos by repl @see StaticSemanticsTools.boundAt() for same positions
-
def
replaceAt(expr: Expression, pos: PosInExpr, repl: Expression): Expression
Replace within term at position pos by repl
Replace within term at position pos by repl
- See also
edu.cmu.cs.ls.keymaerax.infrastruct.StaticSemanticsTools.boundAt() for same positions
-
def
splitPos(f: Formula, pos: PosInExpr): (PosInExpr, PosInExpr)
Split the given position into formula position and term position within that formula.
Split the given position into formula position and term position within that formula.
- returns
._1 will be the formula position of the atomic formula around pos and ._2 will be the term position that pos refers to within that atomic formula.
- To do
horribly slow implementation by marching from the right and researching from the left. Trigger at transition to split(Term) would be much faster.
-
def
sub(t: Expression, pos: PosInExpr): Expression
Subexpression of
t
at the indicated positionpos
or exception if ill-defined position. -
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
KeYmaera X: An aXiomatic Tactical Theorem Prover
KeYmaera X is a theorem prover for differential dynamic logic (dL), a logic for specifying and verifying properties of hybrid systems with mixed discrete and continuous dynamics. Reasoning about complicated hybrid systems requires support for sophisticated proof techniques, efficient computation, and a user interface that crystallizes salient properties of the system. KeYmaera X allows users to specify custom proof search techniques as tactics, execute tactics in parallel, and interface with partial proofs via an extensible user interface.
http://keymaeraX.org/
Concrete syntax for input language Differential Dynamic Logic
Package Structure
Main documentation entry points for KeYmaera X API:
edu.cmu.cs.ls.keymaerax.core
- KeYmaera X kernel, proof certificates, main data structuresExpression
- Differential dynamic logic expressions:Term
,Formula
,Program
Sequent
- Sequents of formulasProvable
- Proof certificates transformed by rules/axiomsRule
- Proof rules as well asUSubstOne
for (one-pass) uniform substitutions and renaming.StaticSemantics
- Static semantics with free and bound variable analysisKeYmaeraXParser
.edu.cmu.cs.ls.keymaerax.parser
- Parser and pretty printer with concrete syntax and notation for differential dynamic logic.KeYmaeraXPrettyPrinter
- Pretty printer producing concrete KeYmaera X syntaxKeYmaeraXParser
- Parser reading concrete KeYmaera X syntaxKeYmaeraXArchiveParser
- Parser reading KeYmaera X model and proof archive.kyx
filesDLParser
- Combinator parser reading concrete KeYmaera X syntaxDLArchiveParser
- Combinator parser reading KeYmaera X model and proof archive.kyx
filesedu.cmu.cs.ls.keymaerax.infrastruct
- Prover infrastructure outside the kernelUnificationMatch
- Unification algorithmRenUSubst
- Renaming Uniform Substitution quickly combining kernel's renaming and substitution.Context
- Representation for contexts of formulas in which they occur.Augmentors
- Augmenting formula and expression data structures with additional functionalityExpressionTraversal
- Generic traversal functionality for expressionsedu.cmu.cs.ls.keymaerax.bellerophon
- Bellerophon tactic language and tactic interpreterBelleExpr
- Tactic language expressionsSequentialInterpreter
- Sequential tactic interpreter for Bellerophon tacticsedu.cmu.cs.ls.keymaerax.btactics
- Bellerophon tactic library for conducting proofs.TactixLibrary
- Main KeYmaera X tactic library including many proof tactics.HilbertCalculus
- Hilbert Calculus for differential dynamic logicSequentCalculus
- Sequent Calculus for propositional and first-order logicHybridProgramCalculus
- Hybrid Program Calculus for differential dynamic logicDifferentialEquationCalculus
- Differential Equation Calculus for differential dynamic logicUnifyUSCalculus
- Unification-based uniform substitution calculus underlying the other calculi[edu.cmu.cs.ls.keymaerax.btactics.UnifyUSCalculus.ForwardTactic ForwardTactic]
- Forward tactic framework for conducting proofs from premises to conclusionsedu.cmu.cs.ls.keymaerax.lemma
- Lemma mechanismLemma
- Lemmas are Provables stored under a name, e.g., in files.LemmaDB
- Lemma database stored in files or database etc.edu.cmu.cs.ls.keymaerax.tools.qe
- Real arithmetic back-end solversMathematicaQETool
- Mathematica interface for real arithmetic.Z3QETool
- Z3 interface for real arithmetic.edu.cmu.cs.ls.keymaerax.tools.ext
- Extended back-ends for noncritical ODE solving, counterexamples, algebra, simplifiers, etc.Mathematica
- Mathematica interface for ODE solving, algebra, simplification, invariant generation, etc.Z3
- Z3 interface for real arithmetic including simplifiers.Entry Points
Additional entry points and usage points for KeYmaera X API:
edu.cmu.cs.ls.keymaerax.launcher.KeYmaeraX
- Command-line launcher for KeYmaera X supports command-line argument-help
to obtain usage informationedu.cmu.cs.ls.keymaerax.btactics.AxIndex
- Axiom indexing data structures with keys and recursors for canonical proof strategies.edu.cmu.cs.ls.keymaerax.btactics.DerivationInfo
- Meta-information on all derivation steps (axioms, derived axioms, proof rules, tactics) with user-interface info.edu.cmu.cs.ls.keymaerax.bellerophon.UIIndex
- Index determining which canonical reasoning steps to display on the KeYmaera X User Interface.edu.cmu.cs.ls.keymaerax.btactics.Ax
- Registry for derived axioms and axiomatic proof rules that are proved from the core.References
Full references on KeYmaera X are provided at http://keymaeraX.org/. The main references are the following:
1. André Platzer. A complete uniform substitution calculus for differential dynamic logic. Journal of Automated Reasoning, 59(2), pp. 219-265, 2017.
2. Nathan Fulton, Stefan Mitsch, Jan-David Quesel, Marcus Völp and André Platzer. KeYmaera X: An axiomatic tactical theorem prover for hybrid systems. In Amy P. Felty and Aart Middeldorp, editors, International Conference on Automated Deduction, CADE'15, Berlin, Germany, Proceedings, volume 9195 of LNCS, pp. 527-538. Springer, 2015.
3. André Platzer. Logical Foundations of Cyber-Physical Systems. Springer, 2018. Videos