Sciweavers

1220 search results - page 149 / 244
» Restricting grammatical complexity
Sort
View
ICS
2010
Tsinghua U.
14 years 5 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
ICCAD
2005
IEEE
90views Hardware» more  ICCAD 2005»
14 years 4 months ago
Scalable compositional minimization via static analysis
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
Fadi A. Zaraket, Jason Baumgartner, Adnan Aziz
SOFSEM
2010
Springer
14 years 4 months ago
Flavors of KWQL, a Keyword Query Language for a Semantic Wiki
Abstract. This article introduces KWQL, spoken “quickel”, a rulebased query language for a semantic wiki based on the label-keyword query paradigm. KWQL allows for rich combine...
François Bry, Klara A. Weiand
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
HICSS
2009
IEEE
107views Biometrics» more  HICSS 2009»
14 years 2 months ago
EM Enforcing Information Flow Properties using Compensating Events
Deeply embedded infrastructures are pervasive systems that have significant cyber and physical components, interacting with each other in complex ways. These interactions can vio...
Thoshitha T. Gamage, Bruce M. McMillin