Sciweavers

462 search results - page 2 / 93
» Symbolic Bounded Synthesis
Sort
View
IJFCS
2008
158views more  IJFCS 2008»
13 years 5 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
ATVA
2007
Springer
152views Hardware» more  ATVA 2007»
13 years 11 months ago
Bounded Synthesis
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
Sven Schewe, Bernd Finkbeiner
MLQ
2006
92views more  MLQ 2006»
13 years 4 months ago
The strength of sharply bounded induction
We prove that the sharply bounded arithmetic T0 2 in a language containing the function symbol x
Emil Jerábek
CUZA
2010
150views Cryptology» more  CUZA 2010»
13 years 2 months ago
Symbolic Synthesis of Mealy Machines from Arithmetic Bitstream Functions
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
Helle Hvid Hansen, Jan J. M. M. Rutten
ICDCS
2007
IEEE
13 years 11 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni