000 05921nam a22006255i 4500
001 978-3-030-51054-1
003 DE-He213
005 20240730171829.0
007 cr nn 008mamaa
008 200629s2020 sz | s |||| 0|eng d
020 _a9783030510541
_9978-3-030-51054-1
024 7 _a10.1007/978-3-030-51054-1
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aAutomated Reasoning
_h[electronic resource] :
_b10th International Joint Conference, IJCAR 2020, Paris, France, July 1-4, 2020, Proceedings, Part II /
_cedited by Nicolas Peltier, Viorica Sofronie-Stokkermans.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXVII, 511 p. 2094 illus., 114 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v12167
505 0 _aInteractive 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 _aThis 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 _aMachine theory.
_9100566
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer science.
_99832
650 0 _aSoftware engineering.
_94138
650 0 _aCompilers (Computer programs).
_93350
650 0 _aComputer programming.
_94169
650 1 4 _aFormal Languages and Automata Theory.
_9100569
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aProgramming Techniques.
_9100573
700 1 _aPeltier, Nicolas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100575
700 1 _aSofronie-Stokkermans, Viorica.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100576
710 2 _aSpringerLink (Online service)
_9100578
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030510534
776 0 8 _iPrinted edition:
_z9783030510558
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v12167
_9100579
856 4 0 _uhttps://doi.org/10.1007/978-3-030-51054-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87839
_d87839