|
|
|
|
| LEADER |
03412nam a22005655i 4500 |
| 001 |
978-3-540-31971-9 |
| 003 |
DE-He213 |
| 005 |
20151204144354.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100315s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540319719
|9 978-3-540-31971-9
|
| 024 |
7 |
|
|a 10.1007/11547662
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a UL
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Static Analysis
|h [electronic resource] :
|b 12th International Symposium, SAS 2005, London, UK, September 7-9, 2005. Proceedings /
|c edited by Chris Hankin, Igor Siveroni.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a X, 374 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 3672
|
| 505 |
0 |
|
|a Invited Talks -- Algorithmic Game Semantics and Static Analysis -- From Typed Process Calculi to Source-Based Security -- Contributed Papers -- Widening Operators for Weakly-Relational Numeric Abstractions -- Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra -- Inference of Well-Typings for Logic Programs with Application to Termination Analysis -- Memory Space Conscious Loop Iteration Duplication for Reliable Execution -- Memory Usage Verification for OO Programs -- Abstraction Refinement for Termination -- Data-Abstraction Refinement: A Game Semantic Approach -- Locality-Based Abstractions -- Type-Safe Optimisation of Plugin Architectures -- Using Dependent Types to Certify the Safety of Assembly Code -- The PER Model of Abstract Non-interference -- A Relational Abstraction for Functions -- Taming False Alarms from a Domain-Unaware C Analyzer by a Bayesian Statistical Post Analysis -- Banshee: A Scalable Constraint-Based Analysis Toolkit -- A Generic Framework for Interprocedural Analysis of Numerical Properties -- Finding Basic Block and Variable Correspondence -- Boolean Heaps -- Interprocedural Shape Analysis for Cutpoint-Free Programs -- Understanding the Origin of Alarms in Astrée -- Pair-Sharing Analysis of Object-Oriented Programs -- Exploiting Sparsity in Polyhedral Analysis -- Secure Information Flow as a Safety Problem.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Programming languages (Electronic computers).
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
| 650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 700 |
1 |
|
|a Hankin, Chris.
|e editor.
|
| 700 |
1 |
|
|a Siveroni, Igor.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540285847
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3672
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/11547662
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
