Skip to search formSkip to main contentSkip to account menu

Postcondition

Known as: Advertised promise, Post-condition, Postconditions 
In computer programming, a postcondition is a condition or predicate that must always be true just after the execution of some section of code or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
AP Computer Science AAssertion (software development)Assertion definition languageAxiomatic semantics

Broader (2)

Formal methodsLogic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Extracting Action and Event Semantics from Web Text
Most information extraction research identifies the state of the world in text, including the entities and the relationships that… 
2010
2010
VeriFast: Imperative Programs as Proofs
This paper describes the VeriFast prototype program verification tool, which implements a separation-logic-based approach for the… 
2009
2009
Refinement-Based Guidelines for Algorithmic Systems
The correct-by-construction approach can be supported by a progressive and incremental process controlled by the refinement of… 
2009
2009
Finding and exploiting goal opportunities in real-time during plan execution
Autonomous robots that operate in real-world domains face multiple challenges that make planning and goal selection difficult… 
2004
2004
Generating Complete, Unambiguous, and Verifiable Requirements from Stories, Scenarios, and Use Cases
Simple scenarios and stories are typically used for requirements engineering in the Agile community (e.g., eXtreme Programming… 
Highly Cited
2000
Highly Cited
2000
Extending OCL to include Actions
The UML's Object Constraint Language provides the modeller of object-oriented systems with ways to express the semantics of a… 
Highly Cited
1998
Highly Cited
1998
A Lightweight Approach to Formal Methods
The main current trend in applied formal methods can be characterized by the term "lightweight". Historically, formal methods… 
1995
1995
Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report
We apply Dijkstra's semantics for programming languages to formalization of reasoning about action and change. The basic idea is… 
1989
1989
The upsilon-Calculus as an Assertion-Language for Fairness Arguments
1984
1984
Towards multi-level and modular conceptual schema specifications
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)