[Full-disclosure] So long, and thanks for all the fish!

Hello, Please excuse the corny subject line, but it is my farewell speech, and I couldn't help it... My apologies also if you received two copies of this note, as I wanted to ensure that everyone did in fact get a copy. The purpose of this email is to notify you of my moving on from the

Re: [Full-disclosure] So long, and thanks for all the fish!

Tell me the new service business is male prostitution o.0 On 7/1/09 11:48 PM, Daniel H. Renner d...@losangelescomputerhelp.com wrote: Hello, Please excuse the corny subject line, but it is my farewell speech, and I couldn't help it... My apologies also if you received two copies of this

Re: [Full-disclosure] So long, and thanks for all the fish!

Looks like it's something Green. His new email is @ engineecology.com. Hey, look on the bright side: the rush of cash chasers with no true understanding or love for computer tech that flooded the industry and wrecked it in the '90s are moving on to green tech. Now we'll have a smaller, but more

[Full-disclosure] [ISecAuditors Security Advisories] Joomla! 1.5.12 Multiple XSS vulnerabilities in HTTP Headers

= INTERNET SECURITY AUDITORS ALERT 2009-007 - Original release date: June 30th, 2009 - Last revised: July 2nd, 2009 - Discovered by: Juan Galiana Lara - Severity: 6.8/10 (CVSS Base Score) = I. VULNERABILITY

Re: [Full-disclosure] radware AppWall Web Application Firewall: Source code disclosure on management interface

Radware team has completed analysis of the reported issue, concluding that no AppWall customer using the product according to Radware deployment recommendations would be exposed to vulnerability as a result of this issue. This is due to the facts that this issue exists only on the management

[Full-disclosure] [USN-794-1] Perl vulnerability

=== Ubuntu Security Notice USN-794-1 July 02, 2009 libcompress-raw-zlib-perl, perl vulnerability CVE-2009-1391 === A security issue affects the following Ubuntu releases:

[Full-disclosure] [USN-795-1] Nagios vulnerability

=== Ubuntu Security Notice USN-795-1 July 02, 2009 nagios2, nagios3 vulnerability CVE-2009-2288 === A security issue affects the following Ubuntu releases: Ubuntu 8.04 LTS

[Full-disclosure] [ GLSA 200907-02 ] ModSecurity: Denial of Service

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gentoo Linux Security Advisory GLSA 200907-02 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - http://security.gentoo.org/ - - - - -

[Full-disclosure] [ GLSA 200907-01 ] libwmf: User-assisted execution of arbitrary code

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Gentoo Linux Security Advisory GLSA 200907-01 - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - http://security.gentoo.org/ - - - - -

[Full-disclosure] Soulseek 157 NS 13e 156.* Remote Direct Peer Search Code Execution

Soulseek 157 NS 13e 156.* Remote Peer Search Code Execution = - Release date: July 02, 2009 - Discovered by: Laurent Gaffié ; http://g-laurent.blogspot.com/ - Severity: critical = I. VULNERABILITY

Re: [Full-disclosure] [Code-Crunchers] a simple race condition and how you'd solve it

On Fri, Jul 3, 2009 at 10:25 AM, Gadi Evrong...@linuxbox.org wrote: A friend recently demonstrated on his blog a simple race condition he encountered. He also challenged folks to solve the problem. http://www.algorithm.co.il/blogs/index.php/programming/a-simple-race-condition/ There's an

Re: [Full-disclosure] [Code-Crunchers] a simple race condition and how you'd solve it

On Fri, 03 Jul 2009 11:01:34 +1000, silky said: Basically, you just need to check if you should still be computing, and, at the end of computation, if your data is still wanted. All that does is push the race condition around. You *still* need to do some sort of locking around the tail end.

Re: [Full-disclosure] [Code-Crunchers] a simple race condition and how you'd solve it

I may be seriously wrong here; But how about implementing a simple bool cache as a check for cache result computation. result = cache.select(input) if result: return result resultcompute = cache.select(resultcompute) if (resultcompute == true) { while(!cache.select(resultcompute)) {