03889nam 2200697 450 99646533480331620220426210420.03-540-79124-810.1007/978-3-540-79124-9(CKB)1000000000491023(SSID)ssj0000320344(PQKBManifestationID)11242686(PQKBTitleCode)TC0000320344(PQKBWorkID)10348334(PQKB)11713498(DE-He213)978-3-540-79124-9(MiAaPQ)EBC4975659(MiAaPQ)EBC5590612(MiAaPQ)EBC6698659(Au-PeEL)EBL4975659(CaONFJC)MIL185682(OCoLC)1024284017(Au-PeEL)EBL5590612(OCoLC)233974074(Au-PeEL)EBL6698659(PPN)125218818(EXLCZ)99100000000049102320220426d2008 uy 0engurnn|008mamaatxtccrTests and proofs second international conference, TAP 2008, Prato, Italy, April 9-11, 2008 : proceedings /Bernhard Beckert, Reiner Hähnle (editors)1st ed. 2008.Berlin, Germany ;New York, New York :Springer,[2008]©20081 online resource (X, 193 p.) Programming and Software Engineering ;4966Bibliographic Level Mode of Issuance: Monograph3-540-79123-X Includes bibliographical references and index.Invited Talks -- The First Thirty Years: Experience with Software Verification -- Vacuity in Testing -- What Can Fault Prediction Do for YOU? -- Research Papers -- Equivalence Checking for a Finite Higher Order ?-Calculus -- Finding Counter Examples in Induction Proofs -- A Logic-Based Approach to Combinatorial Testing with Constraints -- Functional Testing in the Focal Environment -- Bounded Relational Analysis of Free Data Types -- Static Analysis Via Abstract Interpretation of the Happens-Before Memory Model -- Pex–White Box Test Generation for .NET -- Non-termination Checking for Imperative Programs -- Tutorials -- Parameterized Unit Testing with Pex -- Integrating Verification and Testing of Object-Oriented Software.This book constitutes the refereed proceedings of the Second International Conference on Test and Proofs, TAP 2008, held in Prato, Italy, in April 2008. The 8 revised full papers presented together with 3 invited papers and the extended abstracts of 2 tutorials were carefully reviewed and selected for inclusion in the book. The papers cover the area of convergence of software proofing and testing and feature current research work that combines ideas from both areas for the advancement of software quality. Topics addressed are generation of test cases, oracles, or preambles by theorem proving, model checking, symbolic execution, or constraint logic programming; generation of specifications by deduction; verification techniques combining proofs and tests; program proving with the aid of testing techniques; transfer of concepts from testing to proving; automatic tools; formal frameworks; as well as case studies.Programming and Software Engineering ;4966Computer softwareTestingCongressesComputer softwareReliabilityCongressesComputer softwareQuality controlCongressesComputer softwareTestingComputer softwareReliabilityComputer softwareQuality control005.1/4Beckert BernhardHähnle ReinerMiAaPQMiAaPQMiAaPQBOOK996465334803316Tests and Proofs2841686UNISA04021nam 22007695 450 991048384700332120251226203027.03-319-12340-810.1007/978-3-319-12340-0(CKB)3710000000269698(SSID)ssj0001372644(PQKBManifestationID)11761808(PQKBTitleCode)TC0001372644(PQKBWorkID)11310799(PQKB)10964829(DE-He213)978-3-319-12340-0(MiAaPQ)EBC6302742(MiAaPQ)EBC5587847(Au-PeEL)EBL5587847(OCoLC)895040308(PPN)182097862(EXLCZ)99371000000026969820141020d2014 u| 0engurnn#008mamaatxtccrGraph-Theoretic Concepts in Computer Science 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers /edited by Dieter Kratsch, Ioan Todinca1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (XI, 422 p. 81 illus.)Lecture Notes in Computer Science,1611-3349 ;8747Bibliographic Level Mode of Issuance: Monograph3-319-12339-4 Includes bibliographical references and index.Design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications.This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014.   The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.Lecture Notes in Computer Science,1611-3349 ;8747Computer scienceMathematicsDiscrete mathematicsAlgorithmsArtificial intelligenceData processingGeometryDiscrete Mathematics in Computer ScienceAlgorithmsData ScienceGeometryComputer scienceMathematics.Discrete mathematics.Algorithms.Artificial intelligenceData processing.Geometry.Discrete Mathematics in Computer Science.Algorithms.Data Science.Geometry.511.5Kratsch Dieteredthttp://id.loc.gov/vocabulary/relators/edtTodinca Ioanedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910483847003321Graph-Theoretic Concepts in Computer Science2569248UNINA