Verification, Model Checking, and Abstract Interpretation 9th International Conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Logozzo, Francesco (Επιμελητής έκδοσης), Peled, Doron A. (Επιμελητής έκδοσης), Zuck, Lenore D. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Lecture Notes in Computer Science, 4905
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03331nam a22005055i 4500
001 978-3-540-78163-9
003 DE-He213
005 20151204170051.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540781639  |9 978-3-540-78163-9 
024 7 |a 10.1007/978-3-540-78163-9  |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 9th International Conference, VMCAI 2008, San Francisco, USA, January 7-9, 2008. Proceedings /  |c edited by Francesco Logozzo, Doron A. Peled, Lenore D. Zuck. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a X, 325 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 4905 
505 0 |a Abstract Interpretation of Non-monotone Bi-inductive Semantic Definitions -- CTL as an Intermediate Language -- Multi-valued Logics, Automata, Simulations, and Games -- Verification of Register Allocators -- Program Analysis and Programming Languages for Security -- An Improved Tight Closure Algorithm for Integer Octagonal Constraints -- Handling Parameterized Systems with Non-atomic Global Conditions -- Abstract Interpretation of the Physical Inputs of Embedded Programs -- Diagnostic Information for Realizability -- Approximation Refinement for Interpolation-Based Model Checking -- Abstract Interpretation of Cellular Signalling Networks -- Is Lazy Abstraction a Decision Procedure for Broadcast Protocols? -- Model Checking for Action Abstraction -- On Bridging Simulation and Formal Verification -- Extending Model Checking with Dynamic Analysis -- Deriving Bisimulations by Simplifying Partitions -- Precise Set Sharing Analysis for Java-Style Programs -- Sufficient Preconditions for Modular Assertion Checking -- Runtime Checking for Separation Logic -- Decision Procedures for Multisets with Cardinality Constraints -- All You Need Is Compassion -- A Forward-Backward Abstraction Refinement Algorithm -- Internal and External Logics of Abstract Interpretations -- From LTL to Symbolically Represented Deterministic Automata -- Monitoring Temporal Properties of Stochastic Systems -- A Hybrid Algorithm for LTL Games. 
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 Logozzo, Francesco.  |e editor. 
700 1 |a Peled, Doron A.  |e editor. 
700 1 |a Zuck, Lenore D.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540781622 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4905 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-78163-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)