00976nam--2200349---450-99000231244020331620090505145523.0000231244USA01000231244(ALEPH)000231244USA0100023124420041228d1966----km-y0itay0103----baengUS||||||||001yyElementary logicWillard Van Orman QuineRevised edCambridge (Mass.)Harvard University press1966X, 130 p.22 cm20012001001-------2001QUINE,Willard Van Orman58505ITsalbcISBD990002312440203316II.1.D. 4868 (ISP III 91)7722 E.C.ISP III00191091BKECOSIAV21020041228USA011518RSIAV19020090505USA011455Elementary Logic17000UNISA03479oam 2200661I 450 991077881810332120200520144314.00-429-10704-81-4665-1311-X1-283-59624-597866139086981-4398-5167-010.1201/b11564 (CKB)2550000000079606(EBL)830228(OCoLC)809766583(SSID)ssj0000571303(PQKBManifestationID)11380641(PQKBTitleCode)TC0000571303(PQKBWorkID)10619036(PQKB)10739614(Au-PeEL)EBL830228(CaPaEBR)ebr10522558(CaONFJC)MIL390869(OCoLC)773208257(CaSebORM)9781439851678(MiAaPQ)EBC830228(EXLCZ)99255000000007960620180331d2012 uy 0engur|n|---|||||txtccrSoftware maintenance success recipes /Donald J. Reifer1st editionBoca Raton :CRC Press,2012.1 online resource (577 p.)An Auerbach book.1-4665-1312-8 1-4398-5166-2 Includes bibliographical references.Cover; Title Page; Copyright; Contents; Foreword-Software Maintenance Success Recipes; Preface; Acknowledgments; Chapter 1: Maintenance Is Everybody's Primary Business; Chapter 2: Software Mainte.nance Overview; Chapter 3: The Maintenance Pie-What Work Needs to Be Done; Chapter 4: Ten Success Recipes for Surviving the Maintenance Battles; Chapter 5: Adequate Transition and Turnover Planning; Chapter 6: Establishing a Solid Management Infrastructure; Chapter 7: Best-in-Class Facilities; Chapter 8: Responsive User Support Structure; Chapter 9: A Focus on Regression TestingChapter 10: Content-Based Annual ReleasesChapter 11: Proper Resourcing (Staff and Equipment); Chapter 12: Effective Measurement Data Utilization; Chapter 13: Being Ready for the Next Major Upgrade; Chapter 14: Knowing When to Retire the System; Chapter 15: Future Shock-An Action Plan; Chapter 16: Winning the Battles for Prestige, Resources, and Recognition; Appendix A: Acronyms; Appendix B: Glossary; Appendix C: Recommended Readings, References, and Resources; IndexDispelling much of the folklore surrounding software maintenance, Software Maintenance Success Recipes identifies actionable formulas for success based on in-depth analysis of more than 200 real-world maintenance projects. It details the set of factors that are usually present when effective software maintenance teams do their work and instructs on the methods required to achieve success.Donald J. Reifer-an award winner for his contributions to the field of software engineering and whose experience includes managing the DoD Software Initiatives Office-provides step-bComputer programmingManagementComputer softwareDevelopmentManagementComputer programmingManagement.Computer softwareDevelopmentManagement.005.3068Reifer Donald J.491472MiAaPQMiAaPQMiAaPQBOOK9910778818103321Software maintenance success recipes3822606UNINA05446nam 22007935 450 991048357660332120251226195349.03-319-08970-610.1007/978-3-319-08970-6(CKB)3710000000143901(SSID)ssj0001276170(PQKBManifestationID)11836027(PQKBTitleCode)TC0001276170(PQKBWorkID)11238628(PQKB)10523525(DE-He213)978-3-319-08970-6(MiAaPQ)EBC3092950(PPN)179766678(EXLCZ)99371000000014390120140628d2014 u| 0engurnn|008mamaatxtccrInteractive Theorem Proving 5th International Conference, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014, Proceedings /edited by Gerwin Klein, Ruben Gamboa1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (XXII, 555 p. 90 illus.) Theoretical Computer Science and General Issues,2512-2029 ;8558Bibliographic Level Mode of Issuance: Monograph3-319-08969-2 Microcode Verification – Another Piece of the Microprocessor Verification Puzzle -- Are We There Yet? 20 Years of Industrial Theorem Proving with SPARK -- Towards a Formally Verified Proof Assistant -- Implicational Rewriting Tactics in HOL -- A Heuristic Prover for Real Inequalities -- A Formal Library for Elliptic Curves in the Coq Proof Assistant -- Truly Modular (Co) data types for Isabelle/HOL -- Cardinals in Isabelle/HOL -- Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code -- Showing Invariance Compositionally for a Process Algebra for Network Protocols -- A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) -- From Operational Models to Information Theory; Side Channels in pGCL with Isabelle -- A Coq Formalization of Finitely Presented Modules -- Formalized, Effective Domain Theory in Coq -- Completeness and Decidability Results for CTL in Coq -- Hypermap Specification and Certified Linked Implementation Using Orbits -- A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction -- Experience Implementing a Performant Category-Theory Library in Coq -- A New and Formalized Proof of Abstract Completion -- HOL with Definitions: Semantics, Soundness and a Verified Implementation -- Verified Efficient Implementation of Gabow’s Strongly Connected Component Algorithm -- Recursive Functions on Lazy Lists via Domains and Topologies -- Formal Verification of Optical Quantum Flip Gate -- Compositional Computational Reflection -- An Isabelle Proof Method Language -- Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete -- The Reflective Milawa Theorem Prover Is Sound (Down to the Machine Code That Runs It) -- Balancing Lists: A Proof Pearl -- Unified Decision Procedures for Regular Expression Equivalence -- Collaborative Interactive Theorem Proving with Clide -- On the Formalization of Z-Transform in HOL -- Universe Polymorphism in Coq -- Asynchronous User Interaction and Tool Integration inIsabelle/PIDE -- HOL Constant Definition Done Right -- Rough Diamond: An Extension of Equivalence-Based Rewriting -- Formal C Semantics: Comp Cert and the C Standard -- Mechanical Certification of Loop Pipelining Transformations: A Preview.This book constitutes the proceedings of the 5th International Conference on Interactive Theorem Proving, ITP 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. The 35 papers presented in this volume were carefully reviewed and selected from 59 submissions. The topics range from theoretical foundations to implementation aspects and applications in program verification, security and formalization of mathematics.Theoretical Computer Science and General Issues,2512-2029 ;8558Machine theoryArtificial intelligenceComputer scienceSoftware engineeringData protectionAlgorithmsFormal Languages and Automata TheoryArtificial IntelligenceComputer Science Logic and Foundations of ProgrammingSoftware EngineeringData and Information SecurityAlgorithmsMachine theory.Artificial intelligence.Computer science.Software engineering.Data protection.Algorithms.Formal Languages and Automata Theory.Artificial Intelligence.Computer Science Logic and Foundations of Programming.Software Engineering.Data and Information Security.Algorithms.004.015113Klein Gerwinedthttp://id.loc.gov/vocabulary/relators/edtGamboa Rubenedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910483576603321Interactive Theorem Proving2010767UNINA