Sciweavers

FOSSACS
2010
Springer
15 years 8 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
129
Voted
FOIKS
2010
Springer
15 years 8 months ago
On the Existence of Armstrong Data Trees for XML Functional Dependencies
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
Sven Hartmann, Henning Köhler, Thu Trinh
FOIKS
2010
Springer
15 years 8 months ago
Towards a Unified Model of Preference-Based Argumentation
Abstract. Argumentation is a reasoning model based on the construction and the evaluation of arguments. In his seminal paper, Dung has proe most abstract argumentation framework. I...
Jean-Rémi Bourguet, Leila Amgoud, Rallou Th...
90
Voted
FC
2010
Springer
140views Cryptology» more  FC 2010»
15 years 8 months ago
Intention-Disguised Algorithmic Trading
William Yuen, Paul F. Syverson, Zhenming Liu, Chri...
FC
2010
Springer
169views Cryptology» more  FC 2010»
15 years 8 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea