Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Howto best review code that has not been reviewed before?

by Aristotle (Chancellor)
on Aug 18, 2004 at 17:08 UTC ( [id://384045]=note: print w/replies, xml ) Need Help??


in reply to Howto best review code that has not been reviewed before?

I am dismayed that this is an issue at all.

Are they liable if trains crash due to a software bug? Would they rather invest in insurance over code reviews? Are they willing to risk injuries, even casualties?

If I was in your position I'd try to sow some paranoia along these lines.

Makeshifts last the longest.

  • Comment on Re: Howto best review code that has not been reviewed before?

Replies are listed 'Best First'.
Re^2: Howto best review code that has not been reviewed before?
by exussum0 (Vicar) on Aug 18, 2004 at 19:33 UTC
    Perhaps it's like that scene in fightclub where it was more expensive to recall cars than deal with the isnurance claims. :\

    ----
    Then B.I. said, "Hov' remind yourself nobody built like you, you designed yourself"

[reply]

In Section Meditations

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://384045]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others chilling in the Monastery: (6)
As of 2024-04-23 14:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found