Proving composed specifications of Clean programs in Sparkle-T

MaRDI QIDQ5851847zbMATH OpenFDO

Authors Máté Tejfel

Publication date 25 January 2010

zbMATH Keywords

Cleancomposing specificationsSparkleverification

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Temporal Properties of Clean Programs Proven in Sparkle-T
• scientific article; zbMATH DE number 5036161
• scientific article; zbMATH DE number 2086496
• A semantic model for proving properties of clean object I/O programs
• Proving the correctness of mobile Java code

Cited in

(2)

• scientific article; zbMATH DE number 2086496 (Why is no real title available?)
• Temporal Properties of Clean Programs Proven in Sparkle-T

Describes a project that uses

Uses Software

• CLEAN
• Sparkle
• Sparkle-T

This page was built for publication: Proving composed specifications of Clean programs in Sparkle-T

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5851847)