Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Verified bytecode subroutines

From MaRDI portal
Publication:1405993
Jump to:navigation, search

DOI10.1023/A:1025095122199zbMath1031.68040OpenAlexW1696656935MaRDI QIDQ1405993

M. Wildmoser, Gerwin Klein

Publication date: 9 September 2003

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025095122199


zbMATH Keywords

theorem provingJavaIsabellebytecode verificationsubroutinesdataflow analysis


Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)


Related Items (3)

Formal verification of C systems code. Structured types, separation logic and theorem proving ⋮ Tool-assisted specification and verification of typed low-level languages ⋮ Mechanising a type-safe model of multithreaded Java with a verified compiler


Uses Software

  • Isabelle
  • Isabelle/HOL



This page was built for publication: Verified bytecode subroutines

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1405993&oldid=13565377"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 17:13.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki