<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>frag&#039;s</title>
	<atom:link href="http://www.gadaleta.org/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.gadaleta.org</link>
	<description>Yet Another Personal Page</description>
	<lastBuildDate>Tue, 13 Apr 2010 10:18:10 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>My first marathon</title>
		<link>http://www.gadaleta.org/2010/04/my-first-marathon/</link>
		<comments>http://www.gadaleta.org/2010/04/my-first-marathon/#comments</comments>
		<pubDate>Mon, 12 Apr 2010 20:50:02 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[ed-life]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/?p=472</guid>
		<description><![CDATA[The Fortis Marathon Rotterdam has been my first marathon finished in 3h:27&#8242;:24&#8243; (official time). I am definitely happy for the result. I considered to run a marathon as a great occasion to sponsor the idea to run for charity . I published this page as a reference point for those who wanted to read about [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2010/04/my-first-marathon/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Adobe&amp;Co. please fix your software against heap-spraying</title>
		<link>http://www.gadaleta.org/2010/04/adobeco-please-fix-your-software-against-heap-spraying/</link>
		<comments>http://www.gadaleta.org/2010/04/adobeco-please-fix-your-software-against-heap-spraying/#comments</comments>
		<pubDate>Sat, 03 Apr 2010 11:12:53 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[countermeasure]]></category>
		<category><![CDATA[heap spraying]]></category>
		<category><![CDATA[vulnerability]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/?p=467</guid>
		<description><![CDATA[Heap-spraying is an interesting type of attack which allocates thousands of malicious objects to the heap in order to exploit a vulnerability of the application (Adobe Reader, Safari, Mozilla Firefox, Internet Explorer). In the presence of a memory corruption or buffer overflow vulnerability, a heap-spraying attack has been shown to be very effective (also with [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2010/04/adobeco-please-fix-your-software-against-heap-spraying/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>SwapoutClustering patch tested</title>
		<link>http://www.gadaleta.org/2009/11/swapoutclustering-patch-tested/</link>
		<comments>http://www.gadaleta.org/2009/11/swapoutclustering-patch-tested/#comments</comments>
		<pubDate>Mon, 02 Nov 2009 20:33:15 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[clustering swapout]]></category>
		<category><![CDATA[kernel]]></category>
		<category><![CDATA[kernel hacking]]></category>
		<category><![CDATA[linux]]></category>
		<category><![CDATA[patch]]></category>
		<category><![CDATA[swapping]]></category>
		<category><![CDATA[test]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/?p=438</guid>
		<description><![CDATA[When NetBSD and FreeBSD swap out a page from a process, they look in the process virtual address space to find nearby pages that are also candidates for being swapped out. This greatly increases the chance of swapin IO pulling in related data, reducing the number of disk seeks involved in swap IO (from kernelnewbies.org). [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2009/11/swapoutclustering-patch-tested/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>BitTorrent &#8220;magic tricks&#8221;</title>
		<link>http://www.gadaleta.org/2009/07/bittorrent-magic-tricks/</link>
		<comments>http://www.gadaleta.org/2009/07/bittorrent-magic-tricks/#comments</comments>
		<pubDate>Thu, 30 Jul 2009 01:07:31 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[bittorrent]]></category>
		<category><![CDATA[content]]></category>
		<category><![CDATA[deontologia]]></category>
		<category><![CDATA[etica]]></category>
		<category><![CDATA[informazioni]]></category>
		<category><![CDATA[maggiolini]]></category>
		<category><![CDATA[poisoning]]></category>
		<category><![CDATA[tricks]]></category>
		<category><![CDATA[trusted computing]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/main/?p=354</guid>
		<description><![CDATA[A recent research paper in the field of P2P technology has been published and considered the &#8220;most effective&#8221; solution to kill P2P as it is intended nowadays. The research comes indeed with the scary title Proactive Content Poisoning To Prevent Collusive Piracy in P2P File Sharing. It consists in injecting fake pieces of files to [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2009/07/bittorrent-magic-tricks/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Days&#8230;</title>
		<link>http://www.gadaleta.org/2009/07/days/</link>
		<comments>http://www.gadaleta.org/2009/07/days/#comments</comments>
		<pubDate>Sat, 18 Jul 2009 09:08:33 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/main/?p=332</guid>
		<description><![CDATA[]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2009/07/days/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Traditional computing for new tasks: an overview of modern Internet browsers</title>
		<link>http://www.gadaleta.org/2009/07/traditional-computers-for-a-new-task-internet-browsing/</link>
		<comments>http://www.gadaleta.org/2009/07/traditional-computers-for-a-new-task-internet-browsing/#comments</comments>
		<pubDate>Thu, 16 Jul 2009 11:48:37 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[browser]]></category>
		<category><![CDATA[browser war]]></category>
		<category><![CDATA[firefox]]></category>
		<category><![CDATA[gazelle]]></category>
		<category><![CDATA[isolation]]></category>
		<category><![CDATA[security]]></category>
		<category><![CDATA[virtualization]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/main/?p=257</guid>
		<description><![CDATA[In the last ten years the web has evolved from a set of interconnected static pages to a system of complex, distributed applications and active content. Traditional browsers are no more appropriate tools to handle such contents and many security issues have arisen from the usage of tools designed to handle traditional types of content.<br />
Insufficient studies have been accomplished to surf the new contents of the Internet, referring to dynamic and potentially malicious applications.]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2009/07/traditional-computers-for-a-new-task-internet-browsing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Address Space Layout Randomization: an Overview</title>
		<link>http://www.gadaleta.org/2008/09/address-space-layout-randomization-an-overview/</link>
		<comments>http://www.gadaleta.org/2008/09/address-space-layout-randomization-an-overview/#comments</comments>
		<pubDate>Thu, 18 Sep 2008 17:12:35 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[address space layout randomization]]></category>
		<category><![CDATA[ASLR]]></category>
		<category><![CDATA[randomization]]></category>
		<category><![CDATA[tutorial]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/main/2008/09/18/address-space-layout-randomization-an-overview/</guid>
		<description><![CDATA[Internet and the proliferation of opensource programs that have given source code informations to exploit vulnerabilities of applications, made buffer overflow attacks more common and insidious methods to compromise software security. Since these attacks require knowledge of the memory layout schema, the basic idea to design a countermeasure is to randomize locations of target memory [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2008/09/address-space-layout-randomization-an-overview/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>const pointer vs. pointer to const</title>
		<link>http://www.gadaleta.org/2008/06/const-pointer-vs-pointer-to-const/</link>
		<comments>http://www.gadaleta.org/2008/06/const-pointer-vs-pointer-to-const/#comments</comments>
		<pubDate>Sat, 28 Jun 2008 04:35:36 +0000</pubDate>
		<dc:creator>frag</dc:creator>
				<category><![CDATA[Computer Science]]></category>
		<category><![CDATA[C]]></category>
		<category><![CDATA[constant]]></category>
		<category><![CDATA[pointer]]></category>
		<category><![CDATA[programming languages]]></category>

		<guid isPermaLink="false">http://www.gadaleta.org/main/2008/06/27/const-pointer-vs-pointer-to-const/</guid>
		<description><![CDATA[/* ex. usage of a constant pointer to a (variable integer) ex. how to fuck a pointer to a constant variable */ #include int main(void) { const int c=0; // constant pointer to a (variable) integer: can change the value of the var but not the pointer int* const ptr1 = malloc(sizeof(int)); *ptr1 = 10; [...]]]></description>
		<wfw:commentRss>http://www.gadaleta.org/2008/06/const-pointer-vs-pointer-to-const/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
