Sciweavers

1532 search results - page 200 / 307
» The Symbol Grounding Problem
Sort
View
FROCOS
2007
Springer
15 years 10 months ago
Towards an Automatic Analysis of Web Service Security
Web services send and receive messages in XML syntax with some parts hashed, encrypted or signed, according to the WS-Security standard. In this paper we introduce a model to forma...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...
ISSTA
2006
ACM
15 years 10 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
WORDS
2005
IEEE
15 years 10 months ago
Enhancing DNS Security using the SSL Trust Infrastructure
The main functionality of the Domain Name System (DNS) is to translate symbolic names into IP addresses. Due to the criticality of DNS for the proper functioning of the Internet, ...
Christof Fetzer, Gert Pfeifer, Trevor Jim
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
15 years 10 months ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
SPIN
2005
Springer
15 years 10 months ago
Execution Generated Test Cases: How to Make Systems Code Crash Itself
Abstract. This paper presents a technique that uses code to automatically generate its own test cases at run-time by using a combination of symbolic and concrete (i.e., regular) ex...
Cristian Cadar, Dawson R. Engler