03965nam 22006135 450 99646559100331620230220171149.03-540-31622-110.1007/11609773(CKB)1000000000213581(SSID)ssj0000320628(PQKBManifestationID)11235359(PQKBTitleCode)TC0000320628(PQKBWorkID)10258633(PQKB)10449851(DE-He213)978-3-540-31622-0(MiAaPQ)EBC3068420(PPN)123099153(EXLCZ)99100000000021358120100419d2006 u| 0engurnn|008mamaatxtccrVerification, Model Checking, and Abstract Interpretation[electronic resource] 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings /edited by E. Allen Emerson, Kedar S. Namjoshi1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XI, 443 p.) Theoretical Computer Science and General Issues,2512-2029 ;3855Bibliographic Level Mode of Issuance: Monograph3-540-31139-4 Includes bibliographical references and index.Closure Operators for ROBDDs -- A CLP Method for Compositional and Intermittent Predicate Abstraction -- Combining Shape Analyses by Intersecting Abstractions -- A Complete Abstract Interpretation Framework for Coverability Properties of WSTS -- Complexity Results on Branching-Time Pushdown Model Checking -- A Compositional Logic for Control Flow -- Detecting Non-cyclicity by Abstract Compilation into Boolean Functions -- Efficient Strongly Relational Polyhedral Analysis -- Environment Abstraction for Parameterized Verification -- Error Control for Probabilistic Model Checking -- Field Constraint Analysis -- A Framework for Certified Program Analysis and Its Applications to Mobile-Code Safety -- Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems -- A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs -- Monitoring Off-the-Shelf Components -- Parallel External Directed Model Checking with Linear I/O -- Piecewise FIFO Channels Are Analyzable -- Ranking Abstraction of Recursive Programs -- Relative Safety -- Resource Usage Analysis for the ?-Calculus -- Semantic Hierarchy Refactoring by Abstract Interpretation -- Strong Preservation of Temporal Fixpoint-Based Operators by Abstract Interpretation -- Symbolic Methods to Enhance the Precision of Numerical Abstract Domains -- Synthesis of Reactive(1) Designs -- Systematic Construction of Abstractions for Model-Checking -- Totally Clairvoyant Scheduling with Relative Timing Constraints -- Verification of Well-Formed Communicating Recursive State Machines -- What’s Decidable About Arrays?.Theoretical Computer Science and General Issues,2512-2029 ;3855Software engineeringComputer scienceCompilers (Computer programs)Software EngineeringComputer Science Logic and Foundations of ProgrammingCompilers and InterpretersSoftware engineering.Computer science.Compilers (Computer programs).Software Engineering.Computer Science Logic and Foundations of Programming.Compilers and Interpreters.005.1Emerson E. Allenedthttp://id.loc.gov/vocabulary/relators/edtNamjoshi Kedar Sedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465591003316Verification, Model Checking, and Abstract Interpretation2593983UNISA