Sciweavers

206 search results - page 29 / 42
» Weak Alternating Automata Are Not That Weak
Sort
View
ESWS
2009
Springer
14 years 2 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
TLCA
2009
Springer
14 years 2 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
SRDS
2008
IEEE
14 years 1 months ago
Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems
The efficiency of service discovery is critical in the development of fully decentralized middleware intended to manage large scale computational grids. This demand influenced t...
Eddy Caron, Ajoy Kumar Datta, Franck Petit, C&eacu...
HASE
2007
IEEE
14 years 1 months ago
Integrating Product-Line Fault Tree Analysis into AADL Models
Fault Tree Analysis (FTA) is a safety-analysis technique that has been recently extended to accommodate product-line engineering for critical domains. This paper describes a tool-...
Hongyu Sun, Miriam Hauptman, Robyn R. Lutz
CEAS
2007
Springer
14 years 1 months ago
Slicing Spam with Occam's Razor
To evade blacklisting, the vast majority of spam email is sent from exploited MTAs (i.e., botnets) and with forged “From” addresses. In response, the anti-spam community has d...
Chris Fleizach, Geoffrey M. Voelker, Stefan Savage