decoration decoration
Stories

GROKLAW
When you want to know more...
decoration
For layout only
Home
Archives
Site Map
Search
About Groklaw
Awards
Legal Research
Timelines
ApplevSamsung
ApplevSamsung p.2
ArchiveExplorer
Autozone
Bilski
Cases
Cast: Lawyers
Comes v. MS
Contracts/Documents
Courts
DRM
Gordon v MS
GPL
Grokdoc
HTML How To
IPI v RH
IV v. Google
Legal Docs
Lodsys
MS Litigations
MSvB&N
News Picks
Novell v. MS
Novell-MS Deal
ODF/OOXML
OOXML Appeals
OraclevGoogle
Patents
ProjectMonterey
Psystar
Quote Database
Red Hat v SCO
Salus Book
SCEA v Hotz
SCO Appeals
SCO Bankruptcy
SCO Financials
SCO Overview
SCO v IBM
SCO v Novell
SCO:Soup2Nuts
SCOsource
Sean Daly
Software Patents
Switch to Linux
Transcripts
Unix Books

Gear

Groklaw Gear

Click here to send an email to the editor of this weblog.


You won't find me on Facebook


Donate

Donate Paypal


No Legal Advice

The information on Groklaw is not intended to constitute legal advice. While Mark is a lawyer and he has asked other lawyers and law students to contribute articles, all of these articles are offered to help educate, not to provide specific legal advice. They are not your lawyers.

Here's Groklaw's comments policy.


What's New

STORIES
No new stories

COMMENTS last 48 hrs
No new comments


Sponsors

Hosting:
hosted by ibiblio

On servers donated to ibiblio by AMD.

Webmaster
Time is the problem | 758 comments | Create New Account
Comments belong to whoever posts them. Please notify us of inappropriate comments.
It doesn't even "mostly" work.
Authored by: Anonymous on Monday, October 15 2012 @ 03:56 PM EDT
I wasn't talking about "developing systems to analyze
software for correctness" ( That has many problems ). I was talking about
how you check the correctness of the program you are developing.
And that is possible to do. If it were not programming would be an exercise in
futility.

[ Reply to This | Parent | # ]

Time is the problem
Authored by: cjk fossman on Monday, October 15 2012 @ 09:36 PM EDT
Trying to resuscitate some very ancient learning here ...

It is possible to do a more strenuous code evaluation than
running test cases with "typical" values.

It consists of defining code preconditions and
postconditions, then walking through the code to verify the
code handles missing preconditions, that each precondition
is an actual requirement, and that the code yields the
defined postconditions.

Then walk through the code backwards to verify you get back
to the preconditions.

Obviously doing this for every line of code is an
intractable problem.

Back when I studied this stuff, flight software needed to be
verified to the branch level; that is, you had to be able to
prove that every branch in the code could be reached. This
is sufficient to prove, for example, that all your loops
will terminate and you have no divide by zero errors.

[ Reply to This | Parent | # ]

Groklaw © Copyright 2003-2013 Pamela Jones.
All trademarks and copyrights on this page are owned by their respective owners.
Comments are owned by the individual posters.

PJ's articles are licensed under a Creative Commons License. ( Details )