2012
DOI: 10.1007/978-3-642-31374-5
|View full text |Cite
|
Sign up to set email alerts
|

Intelligent Computer Mathematics

Abstract: The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 0 publications
0
5
0
Order By: Relevance
“…Auto-active verifiers, such as Dafny [6,7] and AutoProof [23] hide verification and interaction with the verification tool entirely behind annotations in the analyzed code. Interactive theorem provers, such as Coq [2] and Isabelle/HOL [14], primarily interact with users through scripts, such as structured proofs in Isabelle/Isar [13] and hide only little of the proof complexity behind other means of presentation even in advanced editors [25] or when proofs are found automatically, e.g., with Sledgehammer [15]. Many (hybrid systems) theorem provers (e.g., [1,18,20,24]) opt for implementing their proof calculus using axiom schemata or with trusted rules, which renders the features presented here soundness-critical.…”
Section: Discussionmentioning
confidence: 99%
“…Auto-active verifiers, such as Dafny [6,7] and AutoProof [23] hide verification and interaction with the verification tool entirely behind annotations in the analyzed code. Interactive theorem provers, such as Coq [2] and Isabelle/HOL [14], primarily interact with users through scripts, such as structured proofs in Isabelle/Isar [13] and hide only little of the proof complexity behind other means of presentation even in advanced editors [25] or when proofs are found automatically, e.g., with Sledgehammer [15]. Many (hybrid systems) theorem provers (e.g., [1,18,20,24]) opt for implementing their proof calculus using axiom schemata or with trusted rules, which renders the features presented here soundness-critical.…”
Section: Discussionmentioning
confidence: 99%
“…Interactive theorem provers, such as Coq [20] and Isabelle [22], primarily interact with users through tactic scripts, such as structured proofs in Isabelle/Isar [21]. Their user interfaces (e. g., CoqIDE [20], ProofGeneral [5], jEdit [31]) focus on text editing support for writing tactics and let users inspect the proof state and open goals by placing the cursor in the tactic script. Navigation with cursors introduced a limited form of proof by pointing [4] to fold or unfold equations.…”
Section: Related Workmentioning
confidence: 99%
“…This case is out of the scope of this paper, it requires semantic alignment. Several approaches to align semantics have proposed in the literature, they are based on the definition of institutions as models [72][73][74].…”
Section: Modeling Languagesmentioning
confidence: 99%