scientific article; zbMATH DE number 3628347

MaRDI QIDQ4190096zbMATH OpenFDO

Authors Zohar Manna, Amir Pnueli

Publication date 1979

zbMATH Keywords

CorrectnessModal Logic of Programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Cited in

(17)

• A logic to reason about likelihood
• Problems concerning fairness and temporal logic for conflict-free Petri nets
• A formal system for parallel programs in discrete time and space
• A unified approach for studying the properties of transition systems
• Process logic: Expressiveness, decidability, completeness
• Temporal logics need their clocks
• Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs?
• Decision procedures and expressiveness in the temporal logic of branching time
• Temporal specifications with accumulative values
• scientific article; zbMATH DE number 3902618 (Why is no real title available?)
• Total correctness in nonstandard logics of programs
• Does “N+1 times” prove more programs correct than “N times”?
• State machines for large scale computer software and systems
• Semantics of algorithmic languages
• The temporal logic of branching time
• A taxonomy of fairness and temporal logic problems for Petri nets
• On the strength of temporal proofs

This page was built for publication:

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