Tools and Algorithms for the Construction and Analysis of Systems
Editat de Bernd Finkbeiner, Laura Kovácsen Limba Engleză Paperback – 4 apr 2024
The 53 full papers and 16 short SVComp contributions included in these proceedings were carefully reviewed and selected from 159 submissions. They were organized in topical sections as follows:
Part I: STA and SMT solving; synthesis; logic and decidability; program analysis and proofs; proof checking;
Part II: Model Checking; automata and learning; software verification; probabilistic systems; simulations;
Part III: Neural networks; testing and verification; games; concurrency; SV-Comp 2024.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (3) | 299.36 lei 6-8 săpt. | |
| Springer – 5 apr 2024 | 299.36 lei 6-8 săpt. | |
| Springer – 4 apr 2024 | 300.16 lei 6-8 săpt. | |
| Springer – 5 apr 2024 | 301.59 lei 6-8 săpt. |
Preț: 300.16 lei
Preț vechi: 375.19 lei
-20% Nou
Puncte Express: 450
Preț estimativ în valută:
53.11€ • 61.96$ • 46.43£
53.11€ • 61.96$ • 46.43£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031572456
ISBN-10: 3031572459
Pagini: 424
Ilustrații: XXVIII, 394 p. 124 illus., 82 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.64 kg
Ediția:2024
Editura: Springer
Locul publicării:Cham, Switzerland
ISBN-10: 3031572459
Pagini: 424
Ilustrații: XXVIII, 394 p. 124 illus., 82 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.64 kg
Ediția:2024
Editura: Springer
Locul publicării:Cham, Switzerland
Cuprins
SAT and SMT Solving.- DRAT Proofs of Unsatisfiability for SAT Modulo Monotonic Theories.- Z3-Noodler: An Automata-based String Solver.- TaSSAT: Transfer and Share SAT.- Speculative SAT modulo SAT.- Happy Ending: An Empty Hexagon in Every Set of 30 Points.- Synthesis.- Fully Generalized Reactivity(1) Synthesis.- Knor: reactive synthesis using Oink.- On Dependent Variables in Reactive Synthesis.- CESAR: Control Envelope Synthesis via Angelic Refinements.- Logic and Decidability.- Answering Temporal Conjunctive Queries over Description Logic Ontologies for Situation Recognition in Complex Operational Domains.- Deciding Boolean Separation Logic via Small Models.- Asynchronous Subtyping by Trace Relaxation.- Program Analysis and Proofs.- SootUp: A Redesign of the Soot Static Analysis Framework.- Formally verified asymptotic consensus in robust networks.- Formally Verifying an Efficient Sorter.- Explainable Online Monitoring of Metric First-Order Temporal Logic.- Proof Checking.- IsaRare: Automatic Veri cation of SMT Rewrites in Isabelle/HOL.- Automate where Automation Fails: Proof Strategies for Frama-C/WP.- VeSCMul: Verified Implementation of S-C-Rewriting for Multiplier Verification.- A Logical Treatment of Finite Automata.- A State-of-the-Art Karp-Miller Algorithm Certified in Coq.
Textul de pe ultima copertă
The open access book 3-volume set LNCS 14570-14573 constitutes the proceedings of the 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2024, which was held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, during April 6-11, 2024, in Luxembourg.
The 53 full papers and 16 short SVComp contributions included in these proceedings were carefully reviewed and selected from 159 submissions. They were organized in topical sections as follows:
The 53 full papers and 16 short SVComp contributions included in these proceedings were carefully reviewed and selected from 159 submissions. They were organized in topical sections as follows:
Part I: STA and SMT solving; synthesis; logic and decidability; program analysis and proofs; proof checking;
Part II: Model Checking; automata and learning; software verification; probabilistic systems; simulations;
Part III: Neural networks; testing and verification; games; concurrency; SV-Comp 2024.
Caracteristici
This book is open access, which means that you have free and unlimited access