Sciweavers

23 search results - page 2 / 5
» Testing Strong Equivalence of Datalog Programs - Implementat...
Sort
View
CCS
1998
ACM
13 years 9 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 9 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
ICLP
2009
Springer
14 years 6 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
TAP
2009
Springer
178views Hardware» more  TAP 2009»
14 years 1 days ago
Dynamic Symbolic Execution for Testing Distributed Objects
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
Andreas Griesmayer, Bernhard K. Aichernig, Einar B...
EOR
2006
74views more  EOR 2006»
13 years 5 months ago
A mixed-integer programming approach to multi-class data classification problem
This paper presents a new data classification method based on mixed-integer programming. Traditional approaches that are based on partitioning the data sets into two groups perfor...
Fadime Üney Yüksektepe, Metin Türka...