Comments on: Program synthesis talk http://www.weaselhat.com/2006/06/24/synthesis-talk/ Tue, 25 Oct 2011 15:23:07 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Michael Greenberg http://www.weaselhat.com/2006/06/24/synthesis-talk/comment-page-1/#comment-6 Michael Greenberg Thu, 03 Aug 2006 02:18:26 +0000 http://www.weaselhat.com/2006/06/24/synthesis-talk/#comment-6 So it is; my mistake. I still haven't gotten around to reading it! There's never enough time. I like the compositional approach, particularly considering that a lot of the non-reactive correct-by-construction stuff supports some sort of modularity. Many of the more practical heuristics for model checking take advantage of an iterative approach that seems something like the dual of compositional program synthesis. But to answer your question more directly, I haven't seen any (real) specifications at all, much less specifications of that form. So it is; my mistake. I still haven’t gotten around to reading it! There’s never enough time.

I like the compositional approach, particularly considering that a lot of the non-reactive correct-by-construction stuff supports some sort of modularity. Many of the more practical heuristics for model checking take advantage of an iterative approach that seems something like the dual of compositional program synthesis.

But to answer your question more directly, I haven’t seen any (real) specifications at all, much less specifications of that form.

]]> By: Roderick Bloem http://www.weaselhat.com/2006/06/24/synthesis-talk/comment-page-1/#comment-5 Roderick Bloem Wed, 02 Aug 2006 19:39:05 +0000 http://www.weaselhat.com/2006/06/24/synthesis-talk/#comment-5 Kupferman & Vardi's paper gives a 2EXPTIME algorithm. Unfortunately, this is a lower bound as was proven in Rosner's PhD thesis (presumably, that is, I have never read it). One important contribution of this paper is the extension to generalized Buechi automata as inputs while avoiding the counting construction. This improves the complexity. You can argue about the usefulness of the compositional approach. Who has ever seen a specification in the form f1 /\ ... /\ fn? Kupferman & Vardi’s paper gives a 2EXPTIME algorithm. Unfortunately, this is a lower bound as was proven in Rosner’s PhD thesis (presumably, that is, I have never read it).

One important contribution of this paper is the extension to generalized Buechi automata as inputs while avoiding the counting construction. This improves the complexity.

You can argue about the usefulness of the compositional approach. Who has ever seen a specification in the form f1 /\ … /\ fn?

]]>