Does “N+1 times” prove more programs correct than “N times”?

DOI10.1007/BFb0040269MaRDI QIDQ5887528

Ana Pasztor

Publication date: 12 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

dynamic logictemporal logicKripke modelverification systemvalidity relation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Non-standard algorithmic and dynamic logic
• The temporal semantics of concurrent programs
• A complete logic for reasoning about programs via nonstandard model theory. I
• STRUCTURED NONSTANDARD DYNAMIC LOGIC
• On the Logic of “To‐morrow”¹
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Does “N+1 times” prove more programs correct than “N times”?