Sciweavers

34 search results - page 4 / 7
» fm 2006
Sort
View
FM
2006
Springer
111views Formal Methods» more  FM 2006»
13 years 9 months ago
A Formal Template Language Enabling Metaproof
Design patterns are usually described in terms of instances. Templates describe sentences of some language with a particular form, generate sentences upon instantiation, and can be...
Nuno Amálio, Susan Stepney, Fiona Polack
IANDC
2007
96views more  IANDC 2007»
13 years 5 months ago
A general mathematics of names
We introduce FMG (Fraenkel-Mostowski Generalised) set theory, a generalisation of FM set theory which allows binding of infinitely many names instead of just finitely many names...
Murdoch Gabbay
JSYML
2007
78views more  JSYML 2007»
13 years 5 months ago
The settling-time reducibility ordering
Abstract. To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a n...
Barbara F. Csima, Richard A. Shore
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 5 months ago
On Minimal Words With Given Subword Complexity
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
Ming-wei Wang, Jeffrey Shallit
EAAI
2006
189views more  EAAI 2006»
13 years 6 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...