Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/tools-and-algorithms-for-the-construction-and-analysis-of-systems/descriptif_4550960
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4550960

Tools and Algorithms for the Construction and Analysis of Systems, 1st ed. 2021 27th International Conference, TACAS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Part II Theoretical Computer Science and General Issues Series

Langue : Anglais

Coordonnateurs : Groote Jan Friso, Larsen Kim Guldstrand

Couverture de l’ouvrage Tools and Algorithms for the Construction and Analysis of Systems

This open access two-volume set constitutes the proceedings of the 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2021, which was held during March 27 ? April 1, 2021, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021. The conference was planned to take place in Luxembourg and changed to an online format due to the COVID-19 pandemic.

The total of 41 full papers presented in the proceedings was carefully reviewed and selected from 141 submissions. The volume also contains 7 tool papers; 6 Tool Demo papers, 9 SV-Comp Competition Papers.

The papers are organized in topical sections as follows:

Part I: Game Theory; SMT Verification; Probabilities; Timed Systems; Neural Networks; Analysis of Network Communication.

Part II: Verification Techniques (not SMT); Case Studies; Proof Generation/Validation; Tool Papers; Tool Demo Papers; SV-Comp Tool Competition Papers.

Verification Techniques (not SMT).- Directed Reachability for Infinite-State Systems.- Bridging Arrays and ADTs in Recursive Proofs.- A Two-Phase Approach for Conditional Floating-Point Verification.- Symbolic Coloured SCC Decomposition.- Case Studies.- Local Search with a SAT Oracle for Combinatorial Optimization.- Analyzing Infrastructure as Code to Prevent Intra-update Sniping Vulnerabilities.- Proof Generation/Validation.- Certifying Proofs in the First-Order Theory of Rewriting.- Syntax-Guided Quantifier Instantiation.- Making Theory Reasoning Simpler.- Deductive Stability Proofs for Ordinary Differential Equations.- Tool Papers.- An SMT-Based Approach for Verifying Binarized Neural Networks.- cake lpr: Verified Propagation Redundancy Checking in CakeML.- Deductive Veri cation of Floating-Point Java Programs in KeY.- Helmholtz: A Verifier for Tezos Smart Contracts Based on Refinement Types.- SyReNN: A Tool for Analyzing Deep Neural Networks.- MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers.- dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts.- Tool Demo Papers.- HLola: a Very Functional Tool for Extensible Stream Runtime Verification.- AMulet 2.0 for Verifying Multiplier Circuits.- RTLola on Board: Testing Real Driving Emissions on your Phone.- Replicating Restart with Prolonged Retrials: An Experimental Report.- A Web Interface for Petri Nets with Transits and Petri Games.- Momba: JANI Meets Python.- SV-Comp Tool Competition Papers.- Software Veri cation: 10th Comparative Evaluation (SV-COMP 2021).- CPALockator: Thread-Modular Approach with Projections (Competition Contribution).- Dartagnan: Leveraging Compiler Optimizations and the Price of Precision (Competition Contribution).- Gazer-Theta: LLVM-based Veri er Portfolio with BMC/CEGAR (Competition Contribution).- Goblint: Thread-Modular Abstract Interpretation Using Side-Effecting Constraints (Competition Contribution).- Towards String Support in JayHorn (Competition Contribution).- JDart: Portfolio Solving, Breadth-First Search and SMT-Lib Strings (Competition Contribution).- Symbiotic 8: Beyond Symbolic Execution (Competition Contribution).- VeriAbs: A Tool for Scalable Verification by Abstraction (Competition Contribution).

Date de parution :

Ouvrage de 465 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Prix indicatif 42,19 €

Ajouter au panier