<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM15Wiklicky</id>
	<title>WG211/M15Wiklicky - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM15Wiklicky"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M15Wiklicky&amp;action=history"/>
	<updated>2026-04-05T19:28:08Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M15Wiklicky&amp;diff=1300&amp;oldid=prev</id>
		<title>Paul: Created page with &quot;On Framework for Quantitative Program Synthesis  Arguably most work on the problem of program synthesis is based on  various models based in discrete structures, e.g. related to ...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M15Wiklicky&amp;diff=1300&amp;oldid=prev"/>
		<updated>2015-10-22T11:23:28Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;On Framework for Quantitative Program Synthesis  Arguably most work on the problem of program synthesis is based on  various models based in discrete structures, e.g. related to ...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;On Framework for Quantitative Program Synthesis&lt;br /&gt;
&lt;br /&gt;
Arguably most work on the problem of program synthesis is based on &lt;br /&gt;
various models based in discrete structures, e.g. related to model &lt;br /&gt;
checking, game theoretic models, combinatorial optimisation, etc. &lt;br /&gt;
In this talk we aim in recasting program synthesis as a non-linear, &lt;br /&gt;
continuous optimisation problem. This allows among other things &lt;br /&gt;
for a smoother integration of non-functional constraints. Initial&lt;br /&gt;
experiments demonstrate that, maybe surprisingly, it is possible &lt;br /&gt;
to avoid algebraic reasoning for algebraic problems and replace it &lt;br /&gt;
entirely by continuous optimisation constraints.&lt;br /&gt;
&lt;br /&gt;
———&lt;br /&gt;
&lt;br /&gt;
Dr. Herbert Wiklicky holds Master (MSc) degrees in theoretical physics,&lt;br /&gt;
mathematics, and computer science and a PhD in computer science from&lt;br /&gt;
the University and TU Vienna. He held positions in Vienna, Amsterdam, &lt;br /&gt;
Tokyo, Mannheim and London where his work concentrated on various &lt;br /&gt;
topics in theoretical computer science in particular in semantics (of &lt;br /&gt;
concurrency) and program analysis. Since 2001 he is at the Department &lt;br /&gt;
of Computing at Imperial College London (most recently as Reader in &lt;br /&gt;
Computer Science). His main research interests are in models, in &lt;br /&gt;
particular, of probabilistic computation, expressiveness of languages, &lt;br /&gt;
computer security and general quantitative approaches in computation. &lt;br /&gt;
Together with Dr. Alessandra Di Pierro (Pisa, Verona) his research &lt;br /&gt;
focused on quantitative program analysis, which lead e.g to the &lt;br /&gt;
development of Probabilistic Abstract Interpretation (PAI) based on&lt;br /&gt;
Linear Operator Semantics (LOS).&lt;/div&gt;</summary>
		<author><name>Paul</name></author>
	</entry>
</feed>