case class Z3ToolProvider(config: ToolProvider.Configuration = Map("z3Path" -> Z3Installer.z3Path)) extends PreferredToolProvider[Tool] with Product with Serializable
A tool provider that provides Z3 as QE tool and our own bundled algebra tool and diff. solution tool, everything else is None. Initializes the Z3 installation and updates the Z3 binary on version updates.
- Alphabetic
- By Inheritance
- Z3ToolProvider
- Serializable
- Serializable
- Product
- Equals
- PreferredToolProvider
- ToolProvider
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new Z3ToolProvider(config: ToolProvider.Configuration = Map("z3Path" -> Z3Installer.z3Path))
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
-
def
algebraTool(): Option[AlgebraTool]
Returns an algebra tool for algebraic computations.
Returns an algebra tool for algebraic computations.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
cexTool(): Option[CounterExampleTool]
Returns a counterexample tool.
Returns a counterexample tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- val config: ToolProvider.Configuration
-
def
defaultTool(): Option[Tool]
Returns the default tool
Returns the default tool
- Definition Classes
- PreferredToolProvider → ToolProvider
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
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
init(): Boolean
Initializes the tools.
Initializes the tools.
- Definition Classes
- Z3ToolProvider → PreferredToolProvider → ToolProvider
-
def
invGenTool(name: Option[String] = None): Option[InvGenTool]
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
isInitialized: Boolean
Indicates whether the tool is initialized.
Indicates whether the tool is initialized.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
lyapunovTool(): Option[LyapunovSolverTool]
Returns a Control Lyapunov Function solver.
Returns a Control Lyapunov Function solver.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
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
odeTool(): Option[ODESolverTool]
Returns an ODE tool.
Returns an ODE tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
pdeTool(): Option[PDESolverTool]
Returns a PDE tool.
Returns a PDE tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
qeTool(name: Option[String] = None): Option[QETacticTool]
Returns a QE tool.
Returns a QE tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
shutdown(): Unit
Shutdown the tools provided by this provider.
Shutdown the tools provided by this provider. After shutdown, the provider hands out None only.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
simplifierTool(): Option[SimplificationTool]
Returns an arithmetic/logical simplification tool
Returns an arithmetic/logical simplification tool
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
simulationTool(): Option[SimulationTool]
Returns a simulation tool.
Returns a simulation tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
solverTool(): Option[EquationSolverTool]
Returns an equation solver tool.
Returns an equation solver tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
def
sosSolveTool(): Option[SOSsolveTool]
Returns a SOSsolve tool.
Returns a SOSsolve tool.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tool(): Z3
Returns the main Z3 tool.
-
def
tool(name: String): Option[Tool]
Returns the tool with
name
Returns the tool with
name
- Definition Classes
- ToolProvider
-
val
toolPreferences: List[Tool]
- Definition Classes
- PreferredToolProvider
-
def
tools(): List[Tool]
The provided tools.
The provided tools.
- Definition Classes
- PreferredToolProvider → ToolProvider
-
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