Tools and Algorithms for the Construction and Analysis of Systems 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Ramakrishnan, C. R. (Επιμελητής έκδοσης), Rehof, Jakob (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Lecture Notes in Computer Science, 4963
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04764nam a22005415i 4500
001 978-3-540-78800-3
003 DE-He213
005 20151204150442.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540788003  |9 978-3-540-78800-3 
024 7 |a 10.1007/978-3-540-78800-3  |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 Tools and Algorithms for the Construction and Analysis of Systems  |h [electronic resource] :  |b 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008. Proceedings /  |c edited by C. R. Ramakrishnan, Jakob Rehof. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a XVI, 520 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 4963 
505 0 |a Invited Talk -- Hardware Verification: Techniques, Methodology and Solutions -- Parameterized Systems -- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages -- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols -- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems -- Model Checking – I -- Revisiting Resistance Speeds Up I/O-Efficient LTL Model Checking -- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking -- On-the-Fly Techniques for Game-Based Software Model Checking -- Computing Simulations over Tree Automata -- Applications -- Formal Pervasive Verification of a Paging Mechanism -- Analyzing Stripped Device-Driver Executables -- Model Checking-Based Genetic Programming with an Application to Mutual Exclusion -- Model Checking – II -- Conditional Probabilities over Probabilistic and Nondeterministic Systems -- On Automated Verification of Probabilistic Programs -- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra -- Fast Directed Model Checking Via Russian Doll Abstraction -- Static Analysis -- A SAT-Based Approach to Size Change Termination with Global Ranking Functions -- Efficient Automatic STE Refinement Using Responsibility -- Reasoning Algebraically About P-Solvable Loops -- On Local Reasoning in Verification -- Concurrent/Distributed Systems -- Interprocedural Analysis of Concurrent Programs Under a Context Bound -- Context-Bounded Analysis of Concurrent Queue Systems -- On Verifying Fault Tolerance of Distributed Protocols -- Tools – I -- The Real-Time Maude Tool -- Z3: An Efficient SMT Solver -- Computation and Visualisation of Phase Portraits for Model Checking SPDIs -- GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic -- Symbolic Execution -- RWset: Attacking Path Explosion in Constraint-Based Test Generation -- Demand-Driven Compositional Symbolic Execution -- Peephole Partial Order Reduction -- Abstraction, Interpolation -- Efficient Interpolant Generation in Satisfiability Modulo Theories -- Quantified Invariant Generation Using an Interpolating Saturation Prover -- Accelerating Interpolation-Based Model-Checking -- Automatically Refining Abstract Interpretations -- Tools – II -- SVISS: Symbolic Verification of Symmetric Systems -- RESY: Requirement Synthesis for Compositional Model Checking -- Scoot: A Tool for the Analysis of SystemC Models -- Trust, Reputation -- Trusted Source Translation of a Total Function Language -- Rocket-Fast Proof Checking for SMT Solvers -- SDSIrep: A Reputation System Based on SDSI. 
650 0 |a Computer science. 
650 0 |a Computer communication systems. 
650 0 |a Software engineering. 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 1 4 |a Computer Science. 
650 2 4 |a Software Engineering/Programming and Operating Systems. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Software Engineering. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
700 1 |a Ramakrishnan, C. R.  |e editor. 
700 1 |a Rehof, Jakob.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540787990 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4963 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-78800-3  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)