Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Even well-typed programs can go wrong in modern functional languages, by encountering a pattern-match failure, or simply… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Much effort is spent by programmers everyday in trying to reduce long, failing execution traces to the cause of the error. We… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We propose techniques for the verification of hybrid systems using template polyhedra, i.e., polyhedra whose inequalities have… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Context figures in the interpretation of utterances in many different ways. In the tradition of possible-worlds semantics, the… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1998
1998
The main current trend in applied formal methods can be characterized by the term "lightweight". Historically, formal methods… Expand
  • figure 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Prepositional logic formulas containing implications can suffer from antecedent failure, in which the formula is true trivially… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
1. A Software Design Manifesto. 2. Design of the Conceptual Model. 3. The Role of the Artist-Designer. 4. Design Language. 5. The… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Abstract I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present an interprocedural generalization of the well-known (intraprocedural) Coincidence Theorem of Kam and Ullman, which… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Discussed is a distributed system based on communication among disjoint processes, where each process is capable of achieving a… Expand
Is this relevant?