國立高雄大學圖資館 |

Automated reasoning10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings.Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Automated reasoningedited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
其他題名:	10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings.
其他題名:	IJCAR 2020
其他作者:	Peltier, Nicolas.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xvii, 511 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Automatic theorem provingCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-51054-1
ISBN:	9783030510541$q(electronic bk.)

Automated reasoning10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings.Part II /
Automated reasoning10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings.Part II /[electronic resource] :IJCAR 2020edited by Nicolas Peltier, Viorica Sofronie-Stokkermans. - Cham :Springer International Publishing :2020. - xvii, 511 p. :ill., digital ;24 cm. - Lecture notes in computer science,121670302-9743 ;. - Lecture notes in computer science ;4891..

Interactive Theorem Proving/ HOL -- Competing inheritance paths in dependent type theory: a case study in functional analysis -- A Lean tactic for normalising ring expressions with exponents (short paper) -- Practical proof search for Coq by type inhabitation -- Quotients of Bounded Natural Functors -- Trakhtenbrot's Theorem in Coq -- Deep Generation of Coq Lemma Names Using Elaborated Terms -- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs -- Validating Mathematical Structures -- Teaching Automated Theorem Proving by Example: PyRes 1.2 (system description) -- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages -- Formalizations -- Formalizing the Face Lattice of Polyhedra -- Algebraically Closed Fields in Isabelle/HOL -- Formalization of Forcing in Isabelle/ZF -- Reasoning about Algebraic Structures with Implicit Carriers in Isabelle/HOL -- Formal Proof of the Group Law for Edwards Elliptic Curves -- Verifying Farad_zev-Read type Isomorph-Free Exhaustive Generation -- Verification -- Verified Approximation Algorithms -- Efficient Verified Implementation of Introsort and Pdqsort -- A Fast Verified Liveness Analysis in SSA form -- Verification of Closest Pair of Points Algorithms -- Reasoning Systems and Tools -- A Polymorphic Vampire (short paper) -- N-PAT: A Nested Model-Checker (system description) -- HYPNO: Theorem Proving with Hypersequent Calculi for Non-Normal Modal Logics (system description) -- Implementing superposition in iProver (system description) -- Moin: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (system description) -- Make E Smart Again -- Automatically Proving and Disproving Feasibility Conditions -- μ-term: Verify Termination Properties Automatically (system description) -- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description) -- The Imandra Automated Reasoning System (system description) -- A Programmer's Text Editor for a Logical Theory: The SUMOjEdit Editor (system description) -- Sequoia: a playground for logicians (system description) -- Prolog Technology Reinforcement Learning Prover (system description)

This two-volume set LNAI 12166 and 12167 constitutes the refereed proceedings of the 10th International Joint Conference on Automated Reasoning, IJCAR 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving), and TABLEAUX (International Conference on Analytic Tableaux and Related Methods) The 46 full research papers, 5 short papers, and 11 system descriptions presented together with two invited talks were carefully reviewed and selected from 150 submissions. The papers focus on the following topics: Part I: SAT; SMT and QBF; decision procedures and combination of theories; superposition; proof procedures; non classical logics Part II: interactive theorem proving/ HOL; formalizations; verification; reasoning systems and tools *The conference was held virtually due to the COVID-19 pandemic. Chapter 'A Fast Verified Liveness Analysis in SSA Form' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

ISBN: 9783030510541$q(electronic bk.)

Standard No.: 10.1007/978-3-030-51054-1doiSubjects--Topical Terms:

443052
Automatic theorem proving
--Congresses.

LC Class. No.: QA76.9.A96 / I53 2020

Dewey Class. No.: 511.36028563

Automated reasoning10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings.Part II /
LDR:04659nmm a2200361 a 4500 001 592835
003 DE-He213
005 20200703023833.0
006 m d
007 cr nn 008maaau
008 210727s2020 sz s 0 eng d
020 $a 9783030510541$q(electronic bk.)
020 $a 9783030510534$q(paper)
024 7 $a 10.1007/978-3-030-51054-1 $2 doi
035 $a 978-3-030-51054-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A96 $b I53 2020
072 7 $a UYA $2 bicssc
072 7 $a MAT018000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 511.36028563 $2 23
090 $a QA76.9.A96 $b I25 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Automated reasoning $h [electronic resource] : $b 10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020 : proceedings. $n Part II / $c edited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
246 3 $a IJCAR 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xvii, 511 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12167
490 1 $a Lecture notes in artificial intelligence
505 0 $a Interactive Theorem Proving/ HOL -- Competing inheritance paths in dependent type theory: a case study in functional analysis -- A Lean tactic for normalising ring expressions with exponents (short paper) -- Practical proof search for Coq by type inhabitation -- Quotients of Bounded Natural Functors -- Trakhtenbrot's Theorem in Coq -- Deep Generation of Coq Lemma Names Using Elaborated Terms -- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs -- Validating Mathematical Structures -- Teaching Automated Theorem Proving by Example: PyRes 1.2 (system description) -- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages -- Formalizations -- Formalizing the Face Lattice of Polyhedra -- Algebraically Closed Fields in Isabelle/HOL -- Formalization of Forcing in Isabelle/ZF -- Reasoning about Algebraic Structures with Implicit Carriers in Isabelle/HOL -- Formal Proof of the Group Law for Edwards Elliptic Curves -- Verifying Farad_zev-Read type Isomorph-Free Exhaustive Generation -- Verification -- Verified Approximation Algorithms -- Efficient Verified Implementation of Introsort and Pdqsort -- A Fast Verified Liveness Analysis in SSA form -- Verification of Closest Pair of Points Algorithms -- Reasoning Systems and Tools -- A Polymorphic Vampire (short paper) -- N-PAT: A Nested Model-Checker (system description) -- HYPNO: Theorem Proving with Hypersequent Calculi for Non-Normal Modal Logics (system description) -- Implementing superposition in iProver (system description) -- Moin: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (system description) -- Make E Smart Again -- Automatically Proving and Disproving Feasibility Conditions -- μ-term: Verify Termination Properties Automatically (system description) -- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description) -- The Imandra Automated Reasoning System (system description) -- A Programmer's Text Editor for a Logical Theory: The SUMOjEdit Editor (system description) -- Sequoia: a playground for logicians (system description) -- Prolog Technology Reinforcement Learning Prover (system description)
520 $a This two-volume set LNAI 12166 and 12167 constitutes the refereed proceedings of the 10th International Joint Conference on Automated Reasoning, IJCAR 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving), and TABLEAUX (International Conference on Analytic Tableaux and Related Methods) The 46 full research papers, 5 short papers, and 11 system descriptions presented together with two invited talks were carefully reviewed and selected from 150 submissions. The papers focus on the following topics: Part I: SAT; SMT and QBF; decision procedures and combination of theories; superposition; proof procedures; non classical logics Part II: interactive theorem proving/ HOL; formalizations; verification; reasoning systems and tools *The conference was held virtually due to the COVID-19 pandemic. Chapter 'A Fast Verified Liveness Analysis in SSA Form' is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
650 0 $a Automatic theorem proving $v Congresses. $3 443052
650 0 $a Computer logic $v Congresses. $3 443053
650 1 4 $a Mathematical Logic and Formal Languages. $3 275383
650 2 4 $a Artificial Intelligence. $3 212515
650 2 4 $a Logics and Meanings of Programs. $3 275357
650 2 4 $a Software Engineering. $3 274511
650 2 4 $a Programming Languages, Compilers, Interpreters. $3 274102
650 2 4 $a Programming Techniques. $3 274470
700 1 $a Peltier, Nicolas. $3 884063
700 1 $a Sofronie-Stokkermans, Viorica. $3 522444
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Lecture notes in artificial intelligence. $3 822012
856 4 0 $u https://doi.org/10.1007/978-3-030-51054-1
950 $a Computer Science (SpringerNature-11645)