scientific article; zbMATH DE number 17797

zbMATH Open0754.03017MaRDI QIDQ3975138FDOQ3975138

Authors: István Németi, Ildikó Sain, Hajnal Andréka 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• On the strength of temporal proofs
• scientific article; zbMATH DE number 1786650
• scientific article; zbMATH DE number 4153903
• scientific article; zbMATH DE number 830431
• scientific article; zbMATH DE number 19762

zbMATH Keywords

program verificationtemporal logicsreasoning powerstime-oriented nonstandard logics of programs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cited In (13)

• A Hoare-like proof system for analysing the computation time of programs
• Title not available (Why is that?)
• Similarity saturation for first order linear temporal logic with UNLESS
• Title not available (Why is that?)
• The logic of ``initially and ``next: complete axiomatization and complexity
• VARIABLE TRUTH
• ``During cannot be expressed by ``after
• Does “N+1 times” prove more programs correct than “N times”?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 Q3975138)