Sciweavers

57 search results - page 6 / 12
» Model Checking and Random Competition - A Study Using the Mo...
Sort
View
ASIAN
2007
Springer
157views Algorithms» more  ASIAN 2007»
14 years 1 months ago
A Logical Framework for Evaluating Network Resilience Against Faults and Attacks
Abstract. We present a logic-based framework to evaluate the resilience of computer networks in the face of incidents, i.e., attacks from malicious intruders as well as random faul...
Elie Bursztein, Jean Goubault-Larrecq
PLDI
2009
ACM
14 years 2 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
SDM
2010
SIAM
146views Data Mining» more  SDM 2010»
13 years 8 months ago
Evaluating Query Result Significance in Databases via Randomizations
Many sorts of structured data are commonly stored in a multi-relational format of interrelated tables. Under this relational model, exploratory data analysis can be done by using ...
Markus Ojala, Gemma C. Garriga, Aristides Gionis, ...
DSN
2008
IEEE
14 years 1 months ago
SymPLFIED: Symbolic program-level fault injection and error detection framework
This paper introduces SymPLFIED, a program-level framework which allows specification of arbitrary error detectors and the verification of their efficacy against hardware errors. ...
Karthik Pattabiraman, Nithin Nakka, Zbigniew Kalba...
BIRTHDAY
2004
Springer
14 years 23 days ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer