|
|
|
|
| LEADER |
03467nam a22004935i 4500 |
| 001 |
978-3-540-31622-0 |
| 003 |
DE-He213 |
| 005 |
20151204152052.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100419s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540316220
|9 978-3-540-31622-0
|
| 024 |
7 |
|
|a 10.1007/11609773
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Verification, Model Checking, and Abstract Interpretation
|h [electronic resource] :
|b 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006. Proceedings /
|c edited by E. Allen Emerson, Kedar S. Namjoshi.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2006.
|
| 300 |
|
|
|a XI, 443 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3855
|
| 505 |
0 |
|
|a 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?.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 700 |
1 |
|
|a Emerson, E. Allen.
|e editor.
|
| 700 |
1 |
|
|a Namjoshi, Kedar S.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540311393
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3855
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11609773
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|