Efficient Well-Definedness Checking (Q3541692)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Efficient Well-Definedness Checking	scientific article

Statements

scholarly article

0 references

Efficient Well-Definedness Checking (English)

0 references

0 references

0 references

0 references

Automated Reasoning

0 references

publication date

27 November 2008

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-71070-7_8

0 references

0 references

0 references

Computer Aided Verification

0 references

A logic covering undefinedness in program proofs

0 references

0 references

Are the logical foundations of verifying compiler prototypes matching user expectations?

0 references

Simplify: a theorem prover for program checking

0 references

0 references

Many-Valued Logic, Partiality, and Abstraction in Formal Specification Languages

0 references

On a Formalization of the Non-Definedness Notion

0 references

0 references

On notation for ordinal numbers

0 references

0 references

Isabelle/HOL. A proof assistant for higher-order logic

0 references

Adapting Calculational Logic to the Undefined

0 references

0 references

The TPTP problem library

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-71070-7_8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3541692

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3541692&oldid=35082787"