top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
Computer Aided Verification [[electronic resource] ] : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XXII, 1015 p. 237 illus.)
Disciplina 005.14
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Computers, Special purpose
Computer Science Logic and Foundations of Programming
Software Engineering
Special Purpose and Application-Based Systems
ISBN 3-642-39799-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Automata Networks -- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets -- TTP: Tool for Tumor Progression -- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking -- Parameterized Verification of Asynchronous Shared-Memory Systems -- Partial Orders for Efficient BMC of Concurrent Software -- Incremental, Inductive Coverability -- Automatic linearizability proofs of concurrent objects with cooperating -- Updates -- Duet: Static Analysis for Unbounded Parallelism -- SVA and PSL Local Variables -- A Practical Approach -- Formal Verification of Hardware Synthesis -- CacBDD: A BDD Package with Dynamic Cache Management -- Distributed Explicit State Model Checking of Deadlock Freedom -- Exponential-Condition-Based Barrier Certificate Generation for Safety -- Verification of Hybrid Systems -- Efficient Robust Monitoring for STL -- Abstraction based Model-Checking of Stability of Hybrid Systems -- Faster Algorithms for Markov Decision Processes with Low Tree width -- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis -- Importance Splitting for Statistical Model Checking Rare Properties -- Minimal Sets over Monotone Predicates in Boolean Formulae -- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries -- QUAIL: a quantitative security analyzer for imperative code -- Effectively Propositional Reasoning about Reachability in Linked Data Structures -- Learning Universally Quantified Invariants of Linear Data Structures -- GOAL for Games, Omega-Automata, and Logics -- Efficient synthesis for concurrency using semantics-preserving Transformations.
Record Nr. UNISA-996466042903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Computer Aided Verification : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
Computer Aided Verification : 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013, Proceedings / / edited by Natasha Sharygina, Helmut Veith
Edizione [1st ed. 2013.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Descrizione fisica 1 online resource (XXII, 1015 p. 237 illus.)
Disciplina 005.14
Collana Theoretical Computer Science and General Issues
Soggetto topico Computer science
Software engineering
Computers, Special purpose
Computer Science Logic and Foundations of Programming
Software Engineering
Special Purpose and Application-Based Systems
ISBN 3-642-39799-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Automata Networks -- Model-Checking Signal Transduction Networks through Decreasing Reachability Sets -- TTP: Tool for Tumor Progression -- Exploring Parameter Space of Stochastic Biochemical Systems using Quantitative Model Checking -- Parameterized Verification of Asynchronous Shared-Memory Systems -- Partial Orders for Efficient BMC of Concurrent Software -- Incremental, Inductive Coverability -- Automatic linearizability proofs of concurrent objects with cooperating -- Updates -- Duet: Static Analysis for Unbounded Parallelism -- SVA and PSL Local Variables -- A Practical Approach -- Formal Verification of Hardware Synthesis -- CacBDD: A BDD Package with Dynamic Cache Management -- Distributed Explicit State Model Checking of Deadlock Freedom -- Exponential-Condition-Based Barrier Certificate Generation for Safety -- Verification of Hybrid Systems -- Efficient Robust Monitoring for STL -- Abstraction based Model-Checking of Stability of Hybrid Systems -- Faster Algorithms for Markov Decision Processes with Low Tree width -- Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis -- Importance Splitting for Statistical Model Checking Rare Properties -- Minimal Sets over Monotone Predicates in Boolean Formulae -- Smten: Automatic Translation of High-level Symbolic Computations into SMT Queries -- QUAIL: a quantitative security analyzer for imperative code -- Effectively Propositional Reasoning about Reachability in Linked Data Structures -- Learning Universally Quantified Invariants of Linear Data Structures -- GOAL for Games, Omega-Automata, and Logics -- Efficient synthesis for concurrency using semantics-preserving Transformations.
Record Nr. UNINA-9910483521103321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design / / Roderick Bloem, Natasha Sharygina ; Association for Computing Machinery-Digital Library, contributor
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design / / Roderick Bloem, Natasha Sharygina ; Association for Computing Machinery-Digital Library, contributor
Autore Bloem Roderick P.
Pubbl/distr/stampa Austin, Taxes : , : FMCAD Inc., , 2010
Descrizione fisica 1 online resource
Disciplina 620.00420285
Soggetto topico Computer-aided design
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Altri titoli varianti FMCAD '10
Record Nr. UNINA-9910376653703321
Bloem Roderick P.  
Austin, Taxes : , : FMCAD Inc., , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (xxiv, 604 pages) : illustrations (some color)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Theory of Computation
ISBN 3-031-30820-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tool Demos -- EVA: a Tool for the Compositional Verification of AUTOSAR Models -- WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification -- Multiparty Session Typing in Java, Deductively -- PyLTA: A Verification Tool for Parameterized Distributed Algorithms -- FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format -- Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit -- Combinatorial Optimization/Theorem Proving -- New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization -- Verified reductions for optimization -- Specifying and Verifying Higher-order Rust Iterators -- Extending a High-Performance Prover to Higher-Order Logic -- Tools (Regular Papers) -- The WhyRel Prototype for Relational Verification of Pointer Programs -- Bridging Hardware and Software Analysis with Btor2C: A Word-Level-Circuit-to-C Converter -- CoPTIC: Constraint Programming Translated Into C -- Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability -- Synthesis -- Computing Adequately Permissive Assumptions for Synthesis -- Verification-guided Programmatic Controller Synthesis -- Taming Large Bounds in Synthesis from Bounded-Liveness Specifications -- Lockstep Composition for Unbalanced Loops -- Synthesis of Distributed Agreement-Based Systems with Effciently Decidable Verification -- LTL Reactive Synthesis with a Few Hints -- Timed Automata Verification and Synthesis via Finite Automata Learning -- Graphs/Probabilistic Systems -- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition -- Transforming quantified Boolean formulas using biclique covers -- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration -- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants -- Runtime Monitoring/Program Analysis -- Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote -- Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis -- Explainable Online Monitoring of Metric Temporal Logic -- 12th Competition on Software Verification — SV-COMP 2023 -- Competition on Software Verification and Witness Validation: SV-COMP 2023 -- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation (Competition Contribution) -- 2LS: Arrays and Loop Unwinding (Competition Contribution) -- Bubaak: Runtime Monitoring of Program Verifiers (Competition Contribution) -- EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs (Competition Contribution) -- Goblint: Autotuning Thread-Modular Abstract Interpretation (Competition Contribution) -- Java Ranger: Supporting String and Array Operations (Competition Contribution) -- Korn–Software Verification with Horn Clauses (Competition Contribution) -- Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution) -- PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution) -- Ultimate Automizer and the CommuHash Normal Form (Competition Contribution) -- Ultimate Taipan and Race Detection in Ultimate (Competition Contribution) -- VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution) -- VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution). .
Record Nr. UNISA-996525668903316
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part I / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part I / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (xxiii, 708 pages) : illustrations (some color)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Theory of Computation
ISBN 3-031-30823-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk.-A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems -- Model Checking -- Bounded Model Checking for Asynchronous Hyperproperties -- Model Checking Linear Dynamical Systems under Floating-point Rounding -- Efficient Loop Conditions for Bounded Model Checking Hyperproperties -- Reconciling Preemption Bounding with DPOR -- Optimal Stateless Model Checking for Causal Consistency -- Symbolic Model Checking for TLA+ Made Faster -- AutoHyper: Explicit-State Model Checking for HyperLTL -- Machine Learning/Neural Networks -- Feature Necessity & Relevancy in ML Classifier Explanations -- Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks -- OccRob: Effcient SMT-Based Occlusion Robustness Verification of Deep Neural Networks -- Neural Network-Guided Synthesis of Recursive List Functions -- Automata -- Modular Mix-and-Match Complementation of Buechi automata -- Validating Streaming JSON Documents With Learned VPAs -- Antichains Algorithms for the Inclusion Problem Between ω -VPL -- Stack-Aware Hyperproperties -- Proofs -- Propositional Proof Skeletons -- Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers -- Carcara: An effcient proof checker and elaborator for SMT proofs in the Alethe format -- Constraint Solving/Blockchain -- The Packing Chromatic Number of the Infinite Square Grid is 15 -- Active Learning for SAT Solver Benchmarking -- ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving -- Inferring Needless Write Memory Accesses on Ethereum Bytecode -- Markov Chains/Stochastic Control -- A Practitioner’s Guide to MDP Model Checking Algorithms -- Correct Approximation of Stationary Distributions -- Robust Almost-Sure Reachability in Multi-Environment MDPs -- Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning -- Verification -- A Formal CHERI-C Semantics for Verification -- Automated Verification for Real-Time Systems via Implicit Clocks and an Extended Antimirov Algorithm -- Parameterized Verification under TSO with Data Types -- Verifying Learning-Based Robotic Navigation Systems: A Case Study -- Make flows small again: revisiting the flow framework -- ALASCA: Reasoning in Quantified Linear Arithmetic -- A Matrix-Based Approach to Parity Games -- A GPU Tree Database for Many-Core Explicit State Space Exploration.
Record Nr. UNISA-996525668703316
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part II / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (xxiv, 604 pages) : illustrations (some color)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Theory of Computation
ISBN 3-031-30820-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Tool Demos -- EVA: a Tool for the Compositional Verification of AUTOSAR Models -- WASIM: A Word-level Abstract Symbolic Simulation Framework for Hardware Formal Verification -- Multiparty Session Typing in Java, Deductively -- PyLTA: A Verification Tool for Parameterized Distributed Algorithms -- FuzzBtor2: A Random Generator of Word-Level Model Checking Problems in Btor2 Format -- Eclipse ESCET™: The Eclipse Supervisory Control Engineering Toolkit -- Combinatorial Optimization/Theorem Proving -- New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization -- Verified reductions for optimization -- Specifying and Verifying Higher-order Rust Iterators -- Extending a High-Performance Prover to Higher-Order Logic -- Tools (Regular Papers) -- The WhyRel Prototype for Relational Verification of Pointer Programs -- Bridging Hardware and Software Analysis with Btor2C: A Word-Level-Circuit-to-C Converter -- CoPTIC: Constraint Programming Translated Into C -- Acacia-Bonsai: A Modern Implementation of Downset-Based LTL Realizability -- Synthesis -- Computing Adequately Permissive Assumptions for Synthesis -- Verification-guided Programmatic Controller Synthesis -- Taming Large Bounds in Synthesis from Bounded-Liveness Specifications -- Lockstep Composition for Unbalanced Loops -- Synthesis of Distributed Agreement-Based Systems with Effciently Decidable Verification -- LTL Reactive Synthesis with a Few Hints -- Timed Automata Verification and Synthesis via Finite Automata Learning -- Graphs/Probabilistic Systems -- A Truly Symbolic Linear-Time Algorithm for SCC Decomposition -- Transforming quantified Boolean formulas using biclique covers -- Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration -- Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants -- Runtime Monitoring/Program Analysis -- Industrial-Strength Controlled Concurrency Testing for C# Programs with Coyote -- Context-Sensitive Meta-Constraint Systems for Explainable Program Analysis -- Explainable Online Monitoring of Metric Temporal Logic -- 12th Competition on Software Verification — SV-COMP 2023 -- Competition on Software Verification and Witness Validation: SV-COMP 2023 -- Symbiotic-Witch 2: More Efficient Algorithm and Witness Refutation (Competition Contribution) -- 2LS: Arrays and Loop Unwinding (Competition Contribution) -- Bubaak: Runtime Monitoring of Program Verifiers (Competition Contribution) -- EBF 4.2: Black-Box Cooperative Verification for Concurrent Programs (Competition Contribution) -- Goblint: Autotuning Thread-Modular Abstract Interpretation (Competition Contribution) -- Java Ranger: Supporting String and Array Operations (Competition Contribution) -- Korn–Software Verification with Horn Clauses (Competition Contribution) -- Mopsa-C: Modular Domains and Relational Abstract Interpretation for C Programs (Competition Contribution) -- PIChecker: A POR and Interpolation based Verifier for Concurrent Programs (Competition Contribution) -- Ultimate Automizer and the CommuHash Normal Form (Competition Contribution) -- Ultimate Taipan and Race Detection in Ultimate (Competition Contribution) -- VeriAbsL: Scalable Verification by Abstraction and Strategy Prediction (Competition Contribution) -- VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution). .
Record Nr. UNINA-9910717415003321
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part I / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Tools and Algorithms for the Construction and Analysis of Systems : 29th International Conference, TACAS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings, Part I / / edited by Sriram Sankaranarayanan, Natasha Sharygina
Edizione [1st ed. 2023.]
Pubbl/distr/stampa Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Descrizione fisica 1 online resource (xxiii, 708 pages) : illustrations (some color)
Disciplina 005.1
Collana Lecture Notes in Computer Science
Soggetto topico Computer science
Theory of Computation
ISBN 3-031-30823-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talk.-A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems -- Model Checking -- Bounded Model Checking for Asynchronous Hyperproperties -- Model Checking Linear Dynamical Systems under Floating-point Rounding -- Efficient Loop Conditions for Bounded Model Checking Hyperproperties -- Reconciling Preemption Bounding with DPOR -- Optimal Stateless Model Checking for Causal Consistency -- Symbolic Model Checking for TLA+ Made Faster -- AutoHyper: Explicit-State Model Checking for HyperLTL -- Machine Learning/Neural Networks -- Feature Necessity & Relevancy in ML Classifier Explanations -- Towards Formal XAI: Formally Approximate Minimal Explanations of Neural Networks -- OccRob: Effcient SMT-Based Occlusion Robustness Verification of Deep Neural Networks -- Neural Network-Guided Synthesis of Recursive List Functions -- Automata -- Modular Mix-and-Match Complementation of Buechi automata -- Validating Streaming JSON Documents With Learned VPAs -- Antichains Algorithms for the Inclusion Problem Between ω -VPL -- Stack-Aware Hyperproperties -- Proofs -- Propositional Proof Skeletons -- Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers -- Carcara: An effcient proof checker and elaborator for SMT proofs in the Alethe format -- Constraint Solving/Blockchain -- The Packing Chromatic Number of the Infinite Square Grid is 15 -- Active Learning for SAT Solver Benchmarking -- ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving -- Inferring Needless Write Memory Accesses on Ethereum Bytecode -- Markov Chains/Stochastic Control -- A Practitioner’s Guide to MDP Model Checking Algorithms -- Correct Approximation of Stationary Distributions -- Robust Almost-Sure Reachability in Multi-Environment MDPs -- Mungojerrie: Linear-Time Objectives in Model-Free Reinforcement Learning -- Verification -- A Formal CHERI-C Semantics for Verification -- Automated Verification for Real-Time Systems via Implicit Clocks and an Extended Antimirov Algorithm -- Parameterized Verification under TSO with Data Types -- Verifying Learning-Based Robotic Navigation Systems: A Case Study -- Make flows small again: revisiting the flow framework -- ALASCA: Reasoning in Quantified Linear Arithmetic -- A Matrix-Based Approach to Parity Games -- A GPU Tree Database for Many-Core Explicit State Space Exploration.
Record Nr. UNINA-9910717415303321
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Validation of Evolving Software / / edited by Hana Chockler, Daniel Kroening, Leonardo Mariani, Natasha Sharygina
Validation of Evolving Software / / edited by Hana Chockler, Daniel Kroening, Leonardo Mariani, Natasha Sharygina
Edizione [1st ed. 2015.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Descrizione fisica 1 online resource (216 p.)
Disciplina 004
Soggetto topico Software engineering
Computer science
Software Engineering
Computer Science Logic and Foundations of Programming
ISBN 3-319-10623-6
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Introduction -- Challenges of Existing Technology -- Static Analysis -- Dynamic Analysis -- Hybrid Analysis -- Quality of Validation.
Record Nr. UNINA-9910299253603321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui