<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for copton</title>
	<atom:link href="http://blogs.ethz.ch/copton/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://blogs.ethz.ch/copton</link>
	<description>2.4263102175e-12</description>
	<lastBuildDate>Mon, 25 Oct 2010 22:43:03 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>Comment on MPS Experience by Rui Curado</title>
		<link>http://blogs.ethz.ch/copton/2010/10/23/mps-experience/#comment-3392</link>
		<dc:creator>Rui Curado</dc:creator>
		<pubDate>Mon, 25 Oct 2010 22:43:03 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=508#comment-3392</guid>
		<description>Now that you&#039;ve tried MPS, maybe it&#039;s time for you to try ABSE.

Although ABSE has grown up on a completely independent path from every other model-driven approach, you&#039;ll find many similarities with Language Workbenches, Intentional Programming, EMF and others.

An ABSE model is also a tree, a tree of concepts, and every node on the tree has its editor. Everything in ABSE is done in Lua (http://www.lua.org), a general-purpose scripting language with a C-like syntax.

However, unlike MPS, ABSE does not focus on language. It focus on reuse: every concept is a reusable asset.

ABSE has a companion IDE, named AtomWeaver.

Like you pointed out for MPS, ABSE and its IDE, AtomWeaver, are newborns (v.1.0) and therefore are lacking documentation, samples, have bugs, and all that comes with new things.

http://www.abse.info for the ABSE paradigm
http://www.atomweaver.com for the AtomWeaver IDE

I&#039;ll be glad to help you if you wish to embark on a new adventure. :-)</description>
		<content:encoded><![CDATA[<p>Now that you&#8217;ve tried MPS, maybe it&#8217;s time for you to try ABSE.</p>
<p>Although ABSE has grown up on a completely independent path from every other model-driven approach, you&#8217;ll find many similarities with Language Workbenches, Intentional Programming, EMF and others.</p>
<p>An ABSE model is also a tree, a tree of concepts, and every node on the tree has its editor. Everything in ABSE is done in Lua (<a href="http://www.lua.org" rel="nofollow">http://www.lua.org</a>), a general-purpose scripting language with a C-like syntax.</p>
<p>However, unlike MPS, ABSE does not focus on language. It focus on reuse: every concept is a reusable asset.</p>
<p>ABSE has a companion IDE, named AtomWeaver.</p>
<p>Like you pointed out for MPS, ABSE and its IDE, AtomWeaver, are newborns (v.1.0) and therefore are lacking documentation, samples, have bugs, and all that comes with new things.</p>
<p><a href="http://www.abse.info" rel="nofollow">http://www.abse.info</a> for the ABSE paradigm<br />
<a href="http://www.atomweaver.com" rel="nofollow">http://www.atomweaver.com</a> for the AtomWeaver IDE</p>
<p>I&#8217;ll be glad to help you if you wish to embark on a new adventure. <img src='http://blogs.ethz.ch/copton/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Did you know? Funny facts about C99 by fire</title>
		<link>http://blogs.ethz.ch/copton/2010/10/06/did-you-know-funny-facts-about-c99/#comment-2579</link>
		<dc:creator>fire</dc:creator>
		<pubDate>Thu, 07 Oct 2010 05:46:39 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=467#comment-2579</guid>
		<description>haha, great stuff ;)</description>
		<content:encoded><![CDATA[<p>haha, great stuff <img src='http://blogs.ethz.ch/copton/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on language-oriented programming by chippy</title>
		<link>http://blogs.ethz.ch/copton/2009/07/23/language-oriented-programming/#comment-96</link>
		<dc:creator>chippy</dc:creator>
		<pubDate>Tue, 28 Jul 2009 12:37:33 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=312#comment-96</guid>
		<description>Hi Alex,
the link to the &quot;Wide Spectrum Language&quot;-Paper seems to be broken. Maybe it is better to cache papers localy on your webserver.</description>
		<content:encoded><![CDATA[<p>Hi Alex,<br />
the link to the &#8220;Wide Spectrum Language&#8221;-Paper seems to be broken. Maybe it is better to cache papers localy on your webserver.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on language-oriented programming by Alexander</title>
		<link>http://blogs.ethz.ch/copton/2009/07/23/language-oriented-programming/#comment-95</link>
		<dc:creator>Alexander</dc:creator>
		<pubDate>Tue, 28 Jul 2009 10:44:37 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=312#comment-95</guid>
		<description>In the paper there are examples. I find them strange, though, which is due to the unfamiliar 90&#039;s context, I guess. 

&quot;increased readability&quot; is neither sharply defined nor objectively measured. It&#039;s more along the lines that C code is more readable than the corresponding assembler code.

I am aware of the fact that the brief bullet points will hardly convince anybody who is not already convinced of meta programming. The purpose of the post was to list the properties, guidelines and other insights on meta programming Ward already had in the 90&#039;s.</description>
		<content:encoded><![CDATA[<p>In the paper there are examples. I find them strange, though, which is due to the unfamiliar 90&#8242;s context, I guess. </p>
<p>&#8220;increased readability&#8221; is neither sharply defined nor objectively measured. It&#8217;s more along the lines that C code is more readable than the corresponding assembler code.</p>
<p>I am aware of the fact that the brief bullet points will hardly convince anybody who is not already convinced of meta programming. The purpose of the post was to list the properties, guidelines and other insights on meta programming Ward already had in the 90&#8242;s.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on language-oriented programming by Tab</title>
		<link>http://blogs.ethz.ch/copton/2009/07/23/language-oriented-programming/#comment-93</link>
		<dc:creator>Tab</dc:creator>
		<pubDate>Fri, 24 Jul 2009 17:45:31 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=312#comment-93</guid>
		<description>Great article! 
It would be good to seem some examples or definitions for your bullet point lists such as what does &#039;increased readability&#039; mean, how is it measured, etc..</description>
		<content:encoded><![CDATA[<p>Great article!<br />
It would be good to seem some examples or definitions for your bullet point lists such as what does &#8216;increased readability&#8217; mean, how is it measured, etc..</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on full disc encryption by mru</title>
		<link>http://blogs.ethz.ch/copton/2009/03/17/full-disc-encryption/#comment-8</link>
		<dc:creator>mru</dc:creator>
		<pubDate>Fri, 20 Mar 2009 11:44:43 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=91#comment-8</guid>
		<description>The method luks use is called &lt;a href=&#039;http://en.wikipedia.org/wiki/PBKDF2&#039; title=&#039;PBKDF2&#039; rel=&quot;nofollow&quot;&gt;PBKDF2&lt;/a&gt;, which is also used in several other solutions.
Other cool stuff integrated in the debian initrd is for example &lt;a href=&#039;http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=465903&#039; title=&#039;crypted root remote unlocking&#039; rel=&quot;nofollow&quot;&gt;crypted root unlocking via ssh&lt;/a&gt;.</description>
		<content:encoded><![CDATA[<p>The method luks use is called <a href='http://en.wikipedia.org/wiki/PBKDF2' title='PBKDF2' rel="nofollow">PBKDF2</a>, which is also used in several other solutions.<br />
Other cool stuff integrated in the debian initrd is for example <a href='http://bugs.debian.org/cgi-bin/bugreport.cgi?bug=465903' title='crypted root remote unlocking' rel="nofollow">crypted root unlocking via ssh</a>.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on full disc encryption by Stefan</title>
		<link>http://blogs.ethz.ch/copton/2009/03/17/full-disc-encryption/#comment-7</link>
		<dc:creator>Stefan</dc:creator>
		<pubDate>Tue, 17 Mar 2009 14:55:44 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=91#comment-7</guid>
		<description>LUKS is a dmcrypt wrapper which provides several additional features: dmcrypt uses a single key to encrypt the harddisk. LUKS offers several key slots, which open access to a single master key (this master key is used as key for dmcrypt) - you can use this feature to allow several people to access a secured harddisk without sharing a single master password.
Additionally, the key data given to LUKS (either by keyboard or by file) is not used directly, but passed through a time-expensive key schedule (afaik it is hashed several thousand times); on a standard computer, this takes something between a quarter and a full second. The advantage: Dictionary attacks are rendered more or less useless, since each plaintext word guess has to be passed through that key schedule.</description>
		<content:encoded><![CDATA[<p>LUKS is a dmcrypt wrapper which provides several additional features: dmcrypt uses a single key to encrypt the harddisk. LUKS offers several key slots, which open access to a single master key (this master key is used as key for dmcrypt) &#8211; you can use this feature to allow several people to access a secured harddisk without sharing a single master password.<br />
Additionally, the key data given to LUKS (either by keyboard or by file) is not used directly, but passed through a time-expensive key schedule (afaik it is hashed several thousand times); on a standard computer, this takes something between a quarter and a full second. The advantage: Dictionary attacks are rendered more or less useless, since each plaintext word guess has to be passed through that key schedule.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cilk++ by Charles E. Leiserson</title>
		<link>http://blogs.ethz.ch/copton/2009/03/09/cilk/#comment-2</link>
		<dc:creator>Charles E. Leiserson</dc:creator>
		<pubDate>Mon, 09 Mar 2009 21:21:06 +0000</pubDate>
		<guid isPermaLink="false">http://blogs.ethz.ch/copton/?p=75#comment-2</guid>
		<description>The scientific basis of the race detector is documented in the following papers:

Efficient Detection of Determinacy Races in Cilk Programs
by Mingdong Feng and Charles E. Leiserson
Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)
Newport, Rhode Island
Pages: 1–11
June 22–25, 1997

Detecting Data Races in Cilk Programs that Use Locks
by Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, and Andrew F. Stark
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA &#039;98)
Puerto Vallarta, Mexico, 1998.

Both papers (and other papers on Cilk and race detection) are available on the MIT Supercomputing Technologies Group website: http://supertech.csail.mit.edu/papers.html.</description>
		<content:encoded><![CDATA[<p>The scientific basis of the race detector is documented in the following papers:</p>
<p>Efficient Detection of Determinacy Races in Cilk Programs<br />
by Mingdong Feng and Charles E. Leiserson<br />
Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)<br />
Newport, Rhode Island<br />
Pages: 1–11<br />
June 22–25, 1997</p>
<p>Detecting Data Races in Cilk Programs that Use Locks<br />
by Guang-Ien Cheng, Mingdong Feng, Charles E. Leiserson, Keith H. Randall, and Andrew F. Stark<br />
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA &#8217;98)<br />
Puerto Vallarta, Mexico, 1998.</p>
<p>Both papers (and other papers on Cilk and race detection) are available on the MIT Supercomputing Technologies Group website: <a href="http://supertech.csail.mit.edu/papers.html" rel="nofollow">http://supertech.csail.mit.edu/papers.html</a>.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

