06596nam 22007815 450 99646577280331620200705221920.03-540-36577-X10.1007/3-540-36577-X(CKB)1000000000211949(SSID)ssj0000327273(PQKBManifestationID)11232918(PQKBTitleCode)TC0000327273(PQKBWorkID)10301415(PQKB)10108850(DE-He213)978-3-540-36577-8(MiAaPQ)EBC3073356(PPN)155189832(EXLCZ)99100000000021194920121227d2003 u| 0engurnn|008mamaatxtccrTools and Algorithms for the Construction and Analysis of Systems[electronic resource] 9th International Conference, TACAS 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings /edited by Hubert Garavel, John Hatcliff1st ed. 2003.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2003.1 online resource (XVI, 604 p.) Lecture Notes in Computer Science,0302-9743 ;2619Bibliographic Level Mode of Issuance: Monograph3-540-00898-5 Includes bibliographical references at the end of each chapters and index.Invited Contributions -- What Are We Trying to Prove? Reflections on Experiences with Proof-Carrying Code -- Bounded Model Checking and SAT-Based Methods -- Automatic Abstraction without Counterexamples -- Bounded Model Checking for Past LTL -- Experimental Analysis of Different Techniques for Bounded Model Checking -- Mu-Calculus and Temporal Logics -- On the Universal and Existential Fragments of the ?-Calculus -- Resets vs. Aborts in Linear Temporal Logic -- A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems -- Verification of Parameterized Systems -- Decidability of Invariant Validation for Paramaterized Systems -- Verification and Improvement of the Sliding Window Protocol -- Simple Representative Instantiations for Multicast Protocols -- Rapid Parameterized Model Checking of Snoopy Cache Coherence Protocols -- Abstractions and Counter-Examples -- Proof-Like Counter-Examples -- Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation -- Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement -- Counter-Example Guided Predicate Abstraction of Hybrid Systems -- Real-Time and Scheduling -- Schedulability Analysis Using Two Clocks -- On Optimal Scheduling under Uncertainty -- Static Guard Analysis in Timed Automata Verification -- Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications -- ?erics: A Tool for Verifying Timed Automata and Estelle Specifications -- Security and Cryptography -- A New Knowledge Representation Strategy for Cryptographic Protocol Analysis -- Pattern-Based Abstraction for Verifying Secrecy in Protocols -- Modules and Compositional Verification -- Compositional Analysis for Verification of Parameterized Systems -- Learning Assumptions for Compositional Verification -- Automated Module Composition -- Modular Strategies for Recursive Game Graphs -- Symbolic State Spaces and Decision Diagrams -- Saturation Unbound -- Construction of Efficient BDDs for Bounded Arithmetic Constraints -- Performance and Mobility -- Modeling and Analysis of Power-Aware Systems -- A Set of Performance and Dependability Analysis Components for CADP -- The Integrated CWB-NC/PIOATool for Functional Verification and Performance Analysis of Concurrent Systems -- Banana - A Tool for Boundary Ambients Nesting ANAlysis -- State Space Reductions -- State Class Constructions for Branching Analysis of Time Petri Nets -- Branching Processes of High-Level Petri Nets -- Using Petri Net Invariants in State Space Construction -- Optimistic Synchronization-Based State-Space Reduction -- Constraint-Solving and Decision Procedures -- Checking Properties of Heap-Manipulating Procedures with a Constraint Solver -- An Online Proof-Producing Decision Procedure for Mixed-Integer Linear Arithmetic -- Strategies for Combining Decision Procedures -- Testing and Verification -- Generalized Symbolic Execution for Model Checking and Testing -- Code-Based Test Generation for Validation of Functional Processor Descriptions -- Large State Space Visualization -- Automatic Test Generation with AGATHA -- LTSA-MSC: Tool Support for Behaviour Model Elaboration Using Implied Scenarios.Lecture Notes in Computer Science,0302-9743 ;2619ComputersSoftware engineeringComputer logicComputer communication systemsAlgorithmsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Logics and Meanings of Programshttps://scigraph.springernature.com/ontologies/product-market-codes/I1603XComputer Communication Networkshttps://scigraph.springernature.com/ontologies/product-market-codes/I13022Software Engineeringhttps://scigraph.springernature.com/ontologies/product-market-codes/I14029Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computers.Software engineering.Computer logic.Computer communication systems.Algorithms.Theory of Computation.Software Engineering/Programming and Operating Systems.Logics and Meanings of Programs.Computer Communication Networks.Software Engineering.Algorithm Analysis and Problem Complexity.005.1Garavel Hubertedthttp://id.loc.gov/vocabulary/relators/edtHatcliff Johnedthttp://id.loc.gov/vocabulary/relators/edtTACAS 2003MiAaPQMiAaPQMiAaPQBOOK996465772803316Tools and Algorithms for the Construction and Analysis of Systems772021UNISA01421nam0 22003011i 450 VAN003725620221201010954.39088-7146-155-X20050617d1991 |0itac50 baitaIT|||| |||||F77S il Fortran strutturatolibreria di programmialgoritmi di base, strutture dati, gestione degli archiviCarlo Savy, Paolo DonzelliNapoliCuenc1991411 p.24 cmVAN0246012F77S il Fortran strutturato1423015NapoliVANL000005SavyCarloVANV015655651DonzelliPaoloVANV0310567508CuenVANV108076650ITSOL20221209RICA/sebina/repository/catalogazione/documenti/doc E I 042~00800520221201112715.pdfdoc E I 042~00800520221201112715.pdfVAN0037256BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST E 090 05 429 20050617 BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST E 091 05 114 20060522 BIBLIOTECA DEL DIPARTIMENTO DI INGEGNERIA05PREST E 092 05 2786 20050623 F77S il Fortran strutturato1423015UNISOB03535nam 2200445 450 99646536340331620210301124028.0981-15-6533-310.1007/978-981-15-6533-5(CKB)5590000000002281(MiAaPQ)EBC6362066(DE-He213)978-981-15-6533-5(PPN)250219522(EXLCZ)99559000000000228120210301d2020 uy 0engurnn|008mamaatxtrdacontentcrdamediacrrdacarrierBeyond planar graphs communications of NII Shonan meetings /Seok-Hee Hong, Takeshi Tokuyama, editors1st ed. 2020.Gateway East, Singapore :Springer,[2020]©20201 online resource (VIII, 270 p. 130 illus., 48 illus. in color.) 981-15-6532-5 Chapter 1: Introduction -- Chapter 2: Quantitative Restrictions on Crossing Patterns -- Chapter 3: Quasi-planar Graphs -- Chapter 4: 1-Planar Graphs -- Chapter 5: Algorithms for 1-planar Graphs -- Chapter 6:^= 2 -- Chapter 8: Fan-Planarity -- Chapter 9: Right Angle Crossing Drawings of Graphs -- Chapter 10: Angular Resolutions -- Chapter 11: Crossing Layout in Non-Planar Graph Drawings -- Chapter 12: Beyond Clustered Planarity -- Chapter: Simultaneous Embedding. .This book is the first general and extensive review on the algorithmics and mathematical results of beyond planar graphs. Most real-world data sets are relational and can be modelled as graphs consisting of vertices and edges. Planar graphs are fundamental for both graph theory and graph algorithms and are extensively studied. Structural properties and fundamental algorithms for planar graphs have been discovered. However, most real-world graphs, such as social networks and biological networks, are non-planar. To analyze and visualize such real-world networks, it is necessary to solve fundamental mathematical and algorithmic research questions on sparse non-planar graphs, called beyond planar graphs.This book is based on the National Institute of Informatics (NII) Shonan Meeting on algorithmics on beyond planar graphs held in Japan in November, 2016. The book consists of 13 chapters that represent recent advances in various areas of beyond planar graph research. The main aims and objectives of this book include 1) to timely provide a state-of-the-art survey and a bibliography on beyond planar graphs; 2) to set the research agenda on beyond planar graphs by identifying fundamental research questions and new research directions; and 3) to foster cross-disciplinary research collaboration between computer science (graph drawing and computational geometry) and mathematics (graph theory and combinatorics). New algorithms for beyond planar graphs will be in high demand by practitioners in various application domains to solve complex visualization problems. This book therefore will be a valuable resource for researchers in graph theory, algorithms, and theoretical computer science, and will stimulate further deep scientific investigations into many areas of beyond planar graphs.Graph algorithmsGraph algorithms.511.5Hong Seok-HeeTokuyama TakeshiMiAaPQMiAaPQMiAaPQBOOK996465363403316Beyond planar graphs2095531UNISA01215nam a2200361 i 450099100094699970753620020507180357.0930722s1987 ||| ||| | eng 3540170154b10779681-39ule_instLE01304719ExLDip.to Matematicaeng516AMS 51-01AMS 52-01AMS 53-01Berger, Marcel440912Geometry II /Marcel Berger ; translated from the French by M. Cole, S. LevyBerlin :Springer-Verlag,1987x, 405 p. :364 fig. ;24 cm.UniversitextIncludes bibliographical references and indexes.Orig. French ed. - Paris : CEDIC, 1977.Transl. of: GéométrieGeometryCole, MichaelLevy, Silvio.b1077968123-02-1728-06-02991000946999707536LE013 51-XX BER12 V.II (1977)V. 212013000143347le013-E0.00-l- 03030.i1087908028-06-02Geometry II921830UNISALENTOle01301-01-93ma -engxx 0101265nam a2200373 i 450099100111917970753620020507183618.0960326s1982 us ||| | eng 0824715179b10803555-39ule_instLE01307326ExLDip.to Matematicaeng511.6516AMS 05B45AMS 51F15AMS 51M20Wieting, Thomas W.55201The mathematical theory of chromatic plane ornaments /Thomas W. WietingNew York :Marcel Dekker,1982vii, 369 p. :ill. ;24 cm.Monographs and textbooks in pure and applied mathematics ;71Bibliography: p. 363-365.Includes indexDecoration and ornamentDivision of spacesPlane geometryTiling.b1080355523-02-1728-06-02991001119179707536LE013 51M WIE11 (1982)12013000044538le013-E0.00-l- 02020.i1090791928-06-02Mathematical Theory of Chromatic Plane Ornaments346350UNISALENTOle01301-01-96ma -engus 41