Published: 3rd July 2012|
|Invited Presentation: Synthesis for Systems Biology Rastislav Bodik|
|Invited Presentation: Bounded Synthesis for Real-Time Systems Bernd Finkbeiner and Hans-Jörg Peter|
|Invited Presentation: Synthesizing Programs using Bounded Domains and Occam's Razor Madhusudan Parthasaraty|
|Invited Presentation: Synthesizing Robust Software Paulo Tabuada, Ayca Balkan, Sina Caliskan, Yasser Shoukry and Rupak Majumdar|
|Invited Presentation: Consistency Checking of OpenMP Programs with TSO CPU Model Farn Wang, Fang Yu, Shun-Ching Yang, Guan-Cheng Chen and Che-Chang Chan|
|Sparse Positional Strategies for Safety Games Rüdiger Ehlers and Daniela Moldovan||1|
|Towards Algorithmic Synthesis of Synchronization for Shared-Memory Concurrent Programs Roopsha Samanta||17|
|Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri, William R. Cook and Douglas R. Smith||33|
|Synthesizing Robust Systems with RATSY Roderick Bloem, Hans-Jürgen Gamauf, Georg Hofferek, Bettina Könighofer and Robert Könighofer||47|
Cellular models constructed in executable biology are programs with well-defined semantics and thus are amenable to reasoning techniques developed for ordinary programs, such as model checking, that can confirm a model's adherence to experimental observations. I will describe our ongoing work on addressing three open questions of executable biology: (i) synthesis: automating the construction of models, which are currently constructed manually; (ii) uniqueness check: verification that a biological hypothesis encoded in a model is the sole explanation of the empirically observed cell phenomena; and, (iii) experiment suggestion: should alternative explanations exist, identification of wet-lab experiments that would disambiguate among alternative biological hypotheses plausible given observations so far.
In bounded synthesis, we fix a bound on the size of the controller, restricting the solutions of interest to just those that meet the bound. Bounded synthesis is useful even if the size of the controller is not known in advance, because the bound can be increased incrementally, guiding the search to the minimal solutions. In this talk, we present recent results on bounded synthesis in the setting of real-time systems. We study the synthesis of timed controllers under partial observability with bounds on the discrete and timed resources of the controller. In addition to decidability and complexity results, indicating which bounds are helpful and which are useless from an algorithmic perspective, we present an effective synthesis algorithm for location-bounded discrete controllers, based on a symbolic fixed point computation.
We first present a technical result that shows how classical results in synthesizing transition systems against regular specifications can be extended to synthesize directly programs over bounded domains. This allows us to synthesize all programs satisfying a specification, allows us to synthesize the simplest programs satisfying a specification, and allows handling a variety of specifications including reactive LTL specifications without recourse to solving parity games. We then propose schemes that use synthesis over bounded domains in order to synthesize programs over unbounded domains, using Occam's principle and synthesizing the simplest programs for a specification. A practically viable synthesis procedure on bounded domains is hence likely to be useful for general program synthesis.
Robustness is the property that a system only exhibits small deviations from the nominal behavior upon the occurrence of small disturbances. While the importance of robustness in engineering design is well accepted, it is less clear how to verify and design discrete systems for robustness. In this talk I will present a theory of input-output (IO) stability for discrete systems inspired by existing notions in continuous control theory. I will show that IO-stability captures two intuitive goals of robustness: bounded disturbances lead to bounded deviations from nominal behavior, and the effect of a sporadic disturbance disappears in finitely many steps. For systems modeled as finite-state transducers, IO-stability can be verified and the synthesis problem can be solved in polynomial time.
We present a symbolic approach for checking consistency of OpenMP parallel programs. A parallel program is consistent if it yields the same result as its sequential version despite the execution order among threads. We find race conditions of an OpenMP parallel program, construct the formal models of its raced segments under relaxed memory models, and perform guided symbolic simulation to search consistency violations. The simulation terminates when (1) a witness of inconsistency has been found, or (2) all reachable states have been explored without finding an evidence of inconsistency. We have developed the tool Pathg by incorporating Omega library to solve race constraints and RED symbolic simulator to perform guided search. We show that Pathg can prove consistency of programs, identify races that modern OpenMP checkers failed to report, and find inconsistency witness effectively against benchmarks from the OpenMP Source Code Repository and the NAS Parallel benchmark suite.