Muutke küpsiste eelistusi

Verified Software. Theories, Tools and Experiments: 17th International Conference, VSTTE 2025, Menlo Park, CA, USA, October 6, 2025, Revised Selected Papers [Pehme köide]

  • Formaat: Paperback / softback, 110 pages, kõrgus x laius: 235x155 mm, XX, 110 p.
  • Sari: Lecture Notes in Computer Science
  • Ilmumisaeg: 27-Jun-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032273390
  • ISBN-13: 9783032273390
  • Pehme köide
  • Hind: 43,12 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,49 €
  • Säästad 25%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 3-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Verified Software. Theories, Tools and Experiments: 17th International Conference, VSTTE 2025, Menlo Park, CA, USA, October 6,  2025, Revised Selected Papers
  • Formaat: Paperback / softback, 110 pages, kõrgus x laius: 235x155 mm, XX, 110 p.
  • Sari: Lecture Notes in Computer Science
  • Ilmumisaeg: 27-Jun-2026
  • Kirjastus: Springer Nature Switzerland AG
  • ISBN-10: 3032273390
  • ISBN-13: 9783032273390
This book constitutes the refereed proceedings of the 17th International Conference on Verified Software, VSTTE 2025, held in Menlo Park, USA, during October 6, 2025.



The 4 full papers and 2 short papers presented in this proceedings were carefully selected and reviewed from 15 submissions. The book also contains extended abstracts of an invited talk and an invited tutorial.



VSTTE focusses on critical research challenges in the spectrum of software verification.



 



 
.- Design and Formal Verification of Hardware-Software
Security Contracts.
.- End-to-End Verification of Cryptographic Primitives with Jasmin
and EasyCrypt.
.- Rely-Guarantee Verification of Queue Locks with Proof Support
in Isabelle/HOL.
.- Template DBM: A New Weakly Relational Domain for Efficient Memory-Access
Validation.
.- An Upper Bound on Number of Trajectories Required for Reachable Set
Computation of Discrete Linear Systems.
.- Verifying the Functional Correctness of Braun Trees with LiquidHaskell.
.- HOL4P4.EXE: A Formally Verified P4 Software Switch.
.- Bounding the Execution Cost of WebAssembly Functions.