000 03744nam a22005415i 4500
001 978-3-540-31622-0
003 DE-He213
005 20240423125705.0
007 cr nn 008mamaa
008 100419s2006 gw | s |||| 0|eng d
020 _a9783540316220
_9978-3-540-31622-0
024 7 _a10.1007/11609773
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aVerification, Model Checking, and Abstract Interpretation
_h[electronic resource] :
_b7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings /
_cedited by E. Allen Emerson, Kedar S. Namjoshi.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXI, 443 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3855
505 0 _aClosure 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?.
650 0 _aSoftware engineering.
650 0 _aComputer science.
650 0 _aCompilers (Computer programs).
650 1 4 _aSoftware Engineering.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aCompilers and Interpreters.
700 1 _aEmerson, E. Allen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aNamjoshi, Kedar S.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540311393
776 0 8 _iPrinted edition:
_z9783540819417
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3855
856 4 0 _uhttps://doi.org/10.1007/11609773
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c180680
_d180680