Sciweavers

7123 search results - page 124 / 1425
» The Ordered Set of Rough Sets
Sort
View
FSTTCS
2010
Springer
13 years 8 months ago
Global Model Checking of Ordered Multi-Pushdown Systems
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
Mohamed Faouzi Atig
JSYML
2007
78views more  JSYML 2007»
13 years 10 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
FUIN
2010
83views more  FUIN 2010»
13 years 7 months ago
Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
Vince Bárány, Lukasz Kaiser, Alexand...
CAV
2009
Springer
184views Hardware» more  CAV 2009»
14 years 10 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
EUROCRYPT
2010
Springer
14 years 2 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman