3 options
Tools and Algorithms for the Construction and Analysis of Systems : 30th International Conference, TACAS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / edited by Bernd Finkbeiner, Laura Kovács.
Springer Nature - Springer Nature Link Journals and eBooks - Fully Open Access Available online
View online- Format:
- Book
- Author/Creator:
- Finkbeiner, Bernd.
- Series:
- Lecture Notes in Computer Science, 1611-3349 ; 14570
- Language:
- English
- Subjects (All):
- Computer science.
- Microprogramming.
- Computer networks.
- Computer simulation.
- Software engineering.
- Theory of Computation.
- Control Structures and Microprogramming.
- Computer Communication Networks.
- Computer Modelling.
- Software Engineering.
- Local Subjects:
- Theory of Computation.
- Control Structures and Microprogramming.
- Computer Communication Networks.
- Computer Modelling.
- Software Engineering.
- Physical Description:
- 1 online resource (413 pages)
- Edition:
- 1st ed. 2024.
- Place of Publication:
- Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
- Summary:
- 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: 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. .
- Contents:
- 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.
- ISBN:
- 3-031-57246-7
- OCLC:
- 1429288808
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.