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

Program verification by coinduction

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

DOI10.1007/978-3-319-89884-1_21zbMath1418.68060OpenAlexW1165569327MaRDI QIDQ2324001

Lucas Peña, Grigore Roşu, Brandon Moore

Publication date: 13 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-89884-1_21



Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)


Related Items (3)

A complete semantics of \(\mathbb{K}\) and its translation to Isabelle ⋮ Reasoning about iteration and recursion uniformly based on big-step semantics ⋮ (Co)inductive proof systems for compositional proofs in reachability logic


Uses Software

  • Unnamed Item
  • Unnamed Item
  • OCaml
  • JavaScript
  • Boogie
  • Python
  • K-Java
  • KJS






This page was built for publication: Program verification by coinduction

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