scientific article; zbMATH DE number 3628347
From MaRDI portal
Publication:4190096
zbMath0404.68011MaRDI QIDQ4190096
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)
Related Items
Does “N+1 times” prove more programs correct than “N times”? ⋮ A logic to reason about likelihood ⋮ Problems concerning fairness and temporal logic for conflict-free Petri nets ⋮ Temporal Specifications with Accumulative Values ⋮ 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 ⋮ Unnamed Item ⋮ Decision procedures and expressiveness in the temporal logic of branching time ⋮ Total correctness in nonstandard logics of programs ⋮ Semantics of algorithmic languages ⋮ Is ``Some-other-time sometimes better than ``Sometime for proving partial correctness of programs? ⋮ The temporal logic of branching time ⋮ A taxonomy of fairness and temporal logic problems for Petri nets ⋮ On the strength of temporal proofs
