Cantitate/Preț
Produs
Total produse
Vezi coșul
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 de Sriram Sankaranarayanan

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: Lecture Notes in Computer Science, cartea 13993

Editat de Sriram Sankaranarayanan, Natasha Sharygina
en Limba Engleză Paperback – 22 apr 2023
This open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France.
The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions.
The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report.TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems. 
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 31506 lei  6-8 săpt.
  Springer Nature Switzerland – 20 apr 2023 31506 lei  6-8 săpt.
  Springer Nature Switzerland – 22 apr 2023 32010 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 32010 lei

Preț vechi: 40013 lei
-20% Nou

Puncte Express: 480
Preț estimativ în valută:
6129€ • 6382$ • 5085£

Carte tipărită la comandă

Livrare economică 14-28 februarie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031308222
ISBN-10: 3031308220
Pagini: 708
Ilustrații: XXIII, 708 p. 193 illus., 140 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1.01 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.

Textul de pe ultima copertă

This open access book constitutes the proceedings of the 29th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2023, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, during April 22-27, 2023, in Paris, France.
The 56 full papers and 6 short tool demonstration papers presented in this volume were carefully reviewed and selected from 169 submissions.
The proceedings also contain 1 invited talk in full paper length, 13 tool papers of the affiliated competition SV-Comp and 1 paper consisting of the competition report.
TACAS is a forum for researchers, developers, and users interested in rigorously based tools and algorithms for the construction and analysis of systems. The conference aims to bridge the gaps between different communities with this common interest and to support them in their quest to improve the utility, reliability, flexibility, and efficiency of tools and algorithms for building computer-controlled systems.

Caracteristici

This book is open access, which means that you have free and unlimited access