462 search results - page 61 / 93 » Symbolic Bounded Synthesis |
113
Voted
FOSSACS
2010
Springer
15 years 8 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
103
click to vote
ESOP
2003
Springer
15 years 7 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
107
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We here address the problem of constructing sets of sequences with low integrated aperiodic auto- and crosscorrelations when the constraint of antipodal symbols is enforced. Our m...
117
Voted
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...
ICRA
1998
IEEE
15 years 6 months ago
1998
IEEE
For a general class of robots with elastic joints, we introduce an inversion algorithm for the synthesis of a dynamic feedback control law that gives input-output decoupling and f...