02772nam 2200649 a 450 991045583100332120200520144314.01-282-08186-197866120818660-309-52516-00-585-14263-7(CKB)110986584752434(EBL)3375767(SSID)ssj0000112736(PQKBManifestationID)11134260(PQKBTitleCode)TC0000112736(PQKBWorkID)10098747(PQKB)10579988(MiAaPQ)EBC3375767(Au-PeEL)EBL3375767(CaPaEBR)ebr10041188(OCoLC)923258731(EXLCZ)9911098658475243419980824d1998 uy 0engur|n|---|||||txtccrBlack and smokeless powders[electronic resource] technologies for finding bombs and the bomb makers /Committee on Smokeless and Black Powder, Board on Chemical Sciences and Technology, Commission on Physical Sciences, Mathematics, and Applications, National Research CouncilWashington, D.C. National Academy Press19981 online resource (180 p.)Description based upon print version of record.0-309-06246-2 Includes bibliographical references (p. 97-99).""Front Matter""; ""Preface""; ""Acknowledgment of Reviewers""; ""Contents""; ""Executive Summary""; ""1 Background and Overview""; ""2 Detection of Black and Smokeless Powder Devices""; ""3 Identification""; ""Bibliography""; ""A Biographical Sketches of Committee Members""; ""B Statement of Task and Enabling Legislation""; ""C Committee Meetings""; ""D Taggant and Marker Concepts""; ""E Presentations by Stakeholder Groups""; ""F Committee Site Visits""; ""G Laboratories Capable of Testing""; ""H Regulation of Black and Smokeless Powders""; ""I Glossary""; ""J Acronyms and Abbreviations""GunpowderGunpowder, SmokelessExplosivesAdditivesExplosivesAnalysisBombingsPreventionTechnological innovationsBomb reconnaissanceTechnological innovationsElectronic books.Gunpowder.Gunpowder, Smokeless.ExplosivesAdditives.ExplosivesAnalysis.BombingsPreventionTechnological innovations.Bomb reconnaissanceTechnological innovations.662/.2MiAaPQMiAaPQMiAaPQBOOK9910455831003321Black and smokeless powders2159481UNINA06627nam 22008535 450 991048370870332120251226202606.01-280-38759-997866135655183-642-14052-110.1007/978-3-642-14052-5(CKB)2550000000015590(SSID)ssj0000399488(PQKBManifestationID)11279260(PQKBTitleCode)TC0000399488(PQKBWorkID)10374971(PQKB)10478333(DE-He213)978-3-642-14052-5(MiAaPQ)EBC3065525(PPN)149072910(BIP)31063942(EXLCZ)99255000000001559020100712d2010 u| 0engurnn|008mamaatxtccrInteractive Theorem Proving First International Conference, ITP 2010 Edinburgh, UK, July 11-14, 2010, Proceedings /edited by Matt Kaufmann, Lawrence C. Paulson1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XI, 495 p. 82 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6172Bibliographic Level Mode of Issuance: Monograph3-642-14051-3 Includes bibliographical references and index.Invited Talks -- A Formally Verified OS Kernel. Now What? -- Proof Assistants as Teaching Assistants: A View from the Trenches -- Proof Pearls -- A Certified Denotational Abstract Interpreter -- Using a First Order Logic to Verify That Some Set of Reals Has No Lesbegue Measure -- A New Foundation for Nominal Isabelle -- (Nominal) Unification by Recursive Descent with Triangular Substitutions -- A Formal Proof of a Necessary and Sufficient Condition for Deadlock-Free Adaptive Networks -- Regular Papers -- Extending Coq with Imperative Features and Its Application to SAT Verification -- A Tactic Language for Declarative Proofs -- Programming Language Techniques for Cryptographic Proofs -- Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder -- Formal Proof of a Wave Equation Resolution Scheme: The Method Error -- An Efficient Coq Tactic for Deciding Kleene Algebras -- Fast LCF-Style Proof Reconstruction for Z3 -- The Optimal Fixed Point Combinator -- Formal Study of Plane Delaunay Triangulation -- Reasoning with Higher-Order Abstract Syntax and Contexts: A Comparison -- A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture -- Automated Machine-Checked Hybrid System Safety Proofs -- Coverset Induction with Partiality and Subsorts: A Powerlist Case Study -- Case-Analysis for Rippling and Inductive Proof -- Importing HOL Light into Coq -- A Mechanized Translation from Higher-Order Logic to Set Theory -- The Isabelle Collections Framework -- Interactive Termination Proofs Using Termination Cores -- A Framework for Formal Verification of Compiler Optimizations -- On the Formalization of the Lebesgue Integration Theory in HOL -- From Total Store Order to Sequential Consistency: A Practical Reduction Theorem -- Equations: A Dependent Pattern-Matching Compiler -- A Mechanically Verified AIG-to-BDD Conversion Algorithm -- Inductive Consequences in the Calculus of Constructions -- Validating QBF Invalidity in HOL4 -- Rough Diamonds -- Higher-Order Abstract Syntax in Isabelle/HOL -- Separation Logic Adapted for Proofs by Rewriting -- Developing the Algebraic Hierarchy with Type Classes in Coq.This volume contains the papers presented at ITP 2010: the First International ConferenceonInteractiveTheoremProving. It washeldduring July11-14,2010 in Edinburgh, Scotland as part of the Federated Logic Conference (FLoC, July 9-21, 2010) alongside the other FLoC conferences and workshops. ITP combines the communities of two venerable meetings: the TPHOLs c- ference and the ACL2 workshop. The former conference originated in 1988 as a workshop for users of the HOL proof assistant. The ?rst two meetings were at the University of Cambridge, but afterwards they were held in a variety of venues. By 1992, the workshop acquired the name Higher-Order Logic Theorem Proving and Its Applications. In 1996, it was christened anew as Theorem Pr- ing in Higher-Order Logics, TPHOLs for short, and was henceforth organizedas a conference. Each of these transitions broadened the meeting's scope from the original HOL system to include other proof assistants based on forms of high- order logic, including Coq, Isabelle and PVS. TPHOLs has regularly published research done using ACL2 (the modern version of the well-known Boyer-Moore theorem prover), even though ACL2 implements a unique computational form of ?rst-order logic. The ACL2 community has run its own series of workshops since1999. BymergingTPHOLswith the ACL2workshop,weinclude a broader community of researchers who work with interactive proof tools. With our enlarged community, it was not surprising that ITP attracted a record-breaking 74 submissions, each of which was reviewed by at least three Programme Committee members.Theoretical Computer Science and General Issues,2512-2029 ;6172Computer scienceSoftware engineeringMachine theoryCompilers (Computer programs)Artificial intelligenceImmunospecificityComputer Science Logic and Foundations of ProgrammingSoftware EngineeringFormal Languages and Automata TheoryCompilers and InterpretersArtificial IntelligenceAdaptive ImmunityComputer science.Software engineering.Machine theory.Compilers (Computer programs).Artificial intelligence.Immunospecificity.Computer Science Logic and Foundations of Programming.Software Engineering.Formal Languages and Automata Theory.Compilers and Interpreters.Artificial Intelligence.Adaptive Immunity.005.1015113Kaufmann Matt1756810Paulson Lawrence C62096ITP (Conference)MiAaPQMiAaPQMiAaPQBOOK9910483708703321Interactive theorem proving4194334UNINA