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.
Computer Aided Verification [[electronic resource] ] : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I / / edited by Daniel Kroening, Corina S. Păsăreanu
| Computer Aided Verification [[electronic resource] ] : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I / / edited by Daniel Kroening, Corina S. Păsăreanu |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXIII, 677 p. 141 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer engineering Computer networks Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Engineering and Networks |
| ISBN | 3-319-21690-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Trusted Mechanised Specification of JavaScript: One Year On -- Model Checking and Refinements -- On Automation of CTL* Verification for Infinite-State Systems -- Algorithms for Model Checking HyperLTL and HyperCTL -- Fairness Modulo Theory: A New Approach to LTL Software Model Checking -- Model Checking Parameterized Asynchronous Shared-Memory Systems -- SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms -- Skipping Refinement -- Quantitative Reasoning -- Percentile Queries in Multi-dimensional Markov Decision Processes -- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs -- Counterexample Explanation by Learning Small Strategies in Markov Decision Processes -- Symbolic Polytopes for Quantitative Interpolation and Verification -- Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks -- PROPhESY: A PRObabilistic ParamEter SYnthesis Tool -- Software Analysis -- Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints -- Automata-Based Model Counting for String Constraints -- OpenJDK’s Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case -- Tree Buffers -- Learning Commutativity -- Specifications -- Angelic Verification: Precise Verification Modulo Unknowns -- The SeaHorn Verification Framework -- Automatic Rootcausing for Program Equivalence Failures in Binaries -- Fine-Grained Caching of Verification Results -- Predicting a Correct Program in Programming by Example -- Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation -- Lightning Talks -- ADAM: Causality-Based Synthesis of Distributed Systems -- Alchemist: Learning Guarded Affine Functions -- OptiMathSAT: A Tool for Optimization Modulo Theories -- Systematic Asynchrony Bug Exploration for Android Apps -- Norn: An SMT Solver for String Constraints -- PVSio-web 2.0: Joining PVS to HCI -- The Hanoi Omega-Automata Format -- The Open-Source LearnLib: A Framework for Active Automata Learning -- BBS: A Phase-Bounded Model Checker for Asynchronous Programs -- Time-Aware Abstractions in HybridSal -- A Type-Directed Approach to Program Repair -- Formal Design and Safety Analysis of AIR6110 Wheel Brake System -- Meeting a Powertrain Verification Challenge -- Synthesising Executable Gene Regulatory Networks from Single-Cell Gene Expression Data -- Empirical Software Metrics for Benchmarking of Verification Tools -- Interpolation, IC3/PDR, and Invariants Property-Directed Inference of Universal Invariants or Proving Their Absence -- Efficient Anytime Techniques for Model-Based Safety Analysis -- Boosting k-induction with Continuously-Refined Invariants -- Fast Interpolating BMC -- Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation. |
| Record Nr. | UNISA-996204726603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Aided Verification [[electronic resource] ] : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II / / edited by Daniel Kroening, Corina S. Păsăreanu
| Computer Aided Verification [[electronic resource] ] : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II / / edited by Daniel Kroening, Corina S. Păsăreanu |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 469 p. 107 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer engineering Computer networks Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Engineering and Networks |
| ISBN | 3-319-21668-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | SMT Techniques and Applications -- POLING: SMT Aided Linearizability Proofs -- Finding Bounded Path in Graph Using SMT for Automatic Clock Routing -- Cutting the Mix -- The Inez Mathematical Programming Modulo Theories Framework -- Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets -- Deciding Local Theory Extensions via E-matching -- HW Verification -- Modular Deductive Verification of Multiprocessor Hardware Designs -- Word-Level Symbolic Trajectory Evaluation -- Verifying Linearizability of Intel® Software Guard Extensions -- Synthesis Synthesis Through Unification -- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis -- Counterexample-Guided Quantifier Instantiation for Synthesis in SMT -- Deductive Program Repair -- Quantifying Conformance Using the Skorokhod Metric -- Pareto Curves of Multidimensional Mean-Payoff Games -- Termination -- Conflict-Driven Conditional Termination -- Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs -- Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions -- Measuring with Timed Patterns -- Automatic Verification of Stability and Safety for Delay Differential Equations -- Time Robustness in MTL and Expressivity in Hybrid System Falsification -- Concurrency -- Adaptive Concretization for Parallel Program Synthesis -- Automatic Completion of Distributed Protocols with Symmetry -- An Axiomatic Specification for Sequential Memory Models -- Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems -- Automated and Modular Refinement Reasoning for Concurrent Programs. |
| Record Nr. | UNISA-996204727003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II / / edited by Daniel Kroening, Corina S. Păsăreanu
| Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II / / edited by Daniel Kroening, Corina S. Păsăreanu |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XVIII, 469 p. 107 illus.) |
| Disciplina | 005.14 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer engineering Computer networks Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Engineering and Networks |
| ISBN | 3-319-21668-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | SMT Techniques and Applications -- POLING: SMT Aided Linearizability Proofs -- Finding Bounded Path in Graph Using SMT for Automatic Clock Routing -- Cutting the Mix -- The Inez Mathematical Programming Modulo Theories Framework -- Using Minimal Correction Sets to More Efficiently Compute Minimal Unsatisfiable Sets -- Deciding Local Theory Extensions via E-matching -- HW Verification -- Modular Deductive Verification of Multiprocessor Hardware Designs -- Word-Level Symbolic Trajectory Evaluation -- Verifying Linearizability of Intel® Software Guard Extensions -- Synthesis Synthesis Through Unification -- From Non-preemptive to Preemptive Scheduling Using Synchronization Synthesis -- Counterexample-Guided Quantifier Instantiation for Synthesis in SMT -- Deductive Program Repair -- Quantifying Conformance Using the Skorokhod Metric -- Pareto Curves of Multidimensional Mean-Payoff Games -- Termination -- Conflict-Driven Conditional Termination -- Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs -- Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions -- Measuring with Timed Patterns -- Automatic Verification of Stability and Safety for Delay Differential Equations -- Time Robustness in MTL and Expressivity in Hybrid System Falsification -- Concurrency -- Adaptive Concretization for Parallel Program Synthesis -- Automatic Completion of Distributed Protocols with Symmetry -- An Axiomatic Specification for Sequential Memory Models -- Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems -- Automated and Modular Refinement Reasoning for Concurrent Programs. |
| Record Nr. | UNINA-9910484945103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I / / edited by Daniel Kroening, Corina S. Păsăreanu
| Computer Aided Verification : 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I / / edited by Daniel Kroening, Corina S. Păsăreanu |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XXIII, 677 p. 141 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer engineering Computer networks Computer Science Logic and Foundations of Programming Software Engineering Formal Languages and Automata Theory Computer Engineering and Networks |
| ISBN | 3-319-21690-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Trusted Mechanised Specification of JavaScript: One Year On -- Model Checking and Refinements -- On Automation of CTL* Verification for Infinite-State Systems -- Algorithms for Model Checking HyperLTL and HyperCTL -- Fairness Modulo Theory: A New Approach to LTL Software Model Checking -- Model Checking Parameterized Asynchronous Shared-Memory Systems -- SMT and POR Beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms -- Skipping Refinement -- Quantitative Reasoning -- Percentile Queries in Multi-dimensional Markov Decision Processes -- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs -- Counterexample Explanation by Learning Small Strategies in Markov Decision Processes -- Symbolic Polytopes for Quantitative Interpolation and Verification -- Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks -- PROPhESY: A PRObabilistic ParamEter SYnthesis Tool -- Software Analysis -- Effective Search-Space Pruning for Solvers of String Equations, Regular Expressions and Length Constraints -- Automata-Based Model Counting for String Constraints -- OpenJDK’s Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case -- Tree Buffers -- Learning Commutativity -- Specifications -- Angelic Verification: Precise Verification Modulo Unknowns -- The SeaHorn Verification Framework -- Automatic Rootcausing for Program Equivalence Failures in Binaries -- Fine-Grained Caching of Verification Results -- Predicting a Correct Program in Programming by Example -- Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation -- Lightning Talks -- ADAM: Causality-Based Synthesis of Distributed Systems -- Alchemist: Learning Guarded Affine Functions -- OptiMathSAT: A Tool for Optimization Modulo Theories -- Systematic Asynchrony Bug Exploration for Android Apps -- Norn: An SMT Solver for String Constraints -- PVSio-web 2.0: Joining PVS to HCI -- The Hanoi Omega-Automata Format -- The Open-Source LearnLib: A Framework for Active Automata Learning -- BBS: A Phase-Bounded Model Checker for Asynchronous Programs -- Time-Aware Abstractions in HybridSal -- A Type-Directed Approach to Program Repair -- Formal Design and Safety Analysis of AIR6110 Wheel Brake System -- Meeting a Powertrain Verification Challenge -- Synthesising Executable Gene Regulatory Networks from Single-Cell Gene Expression Data -- Empirical Software Metrics for Benchmarking of Verification Tools -- Interpolation, IC3/PDR, and Invariants Property-Directed Inference of Universal Invariants or Proving Their Absence -- Efficient Anytime Techniques for Model-Based Safety Analysis -- Boosting k-induction with Continuously-Refined Invariants -- Fast Interpolating BMC -- Counterexample-Guided Polynomial Loop Invariant Generation by Lagrange Interpolation. |
| Record Nr. | UNINA-9910484542903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||