Groklaw - Digging for Truth

	When you want to know more...

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

You won't find me on Facebook

Donate

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:

On servers donated to ibiblio by AMD.

Webmaster

LINT is better than nothing... | 758 comments | Create New Account

Comments belong to whoever posts them. Please notify us of inappropriate comments.

Only trivial programs can be analyzed...

Authored by: Anonymous on Monday, October 15 2012 @ 07:26 AM EDT

If that were true all programs were trivial.
Nevertheless all programs, not only the trivial, can be analyzed one way or
another.

[ Reply to This | Parent | # ]

But not for correctness. - Authored by: jesse on Monday, October 15 2012 @ 08:18 AM EDT
- But not for correctness. - Authored by: Anonymous on Monday, October 15 2012 @ 08:44 AM EDT
  - It doesn't even "mostly" work. - Authored by: jesse on Monday, October 15 2012 @ 09:23 AM EDT
    - It doesn't even "mostly" work. - Authored by: Anonymous on Monday, October 15 2012 @ 03:56 PM EDT
      - No, it still isn't. - Authored by: jesse on Monday, October 15 2012 @ 05:25 PM EDT
    - Time is the problem - Authored by: cjk fossman on Monday, October 15 2012 @ 09:36 PM EDT
      - Yes. And one side note.. - Authored by: jesse on Tuesday, October 16 2012 @ 05:57 AM EDT
  - Which universe is "praxis" in? n/t - Authored by: Anonymous on Monday, October 15 2012 @ 12:13 PM EDT
    - Praxis. I might have used a word from Swedish. - Authored by: Anonymous on Monday, October 15 2012 @ 03:44 PM EDT
      - nonsense. - Authored by: Anonymous on Tuesday, October 16 2012 @ 11:36 AM EDT

LINT is better than nothing...

Authored by: Anonymous on Monday, October 15 2012 @ 11:30 PM EDT

And, as noted, if I have some bit of programming for which a proof of the
stopping problem is difficult, then I'd better be prepared for the possibility
that the bit runs for more than a reasonable amount of time.

Not that I mind if you start doing a problem in computational number theory,
like hunting for a counterexample of the "3N+1" problem... But such
things
normally have no place on embedded systems like the ones I work on, and
generally no place on interactive systems except as owner's pet projects.

(Christenson)

[ 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 )