Sciweavers

217 search results - page 21 / 44
» Automatic Termination
Sort
View
CSFW
2005
IEEE
14 years 2 months ago
Reconstruction of Attacks against Cryptographic Protocols
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
Xavier Allamigeon, Bruno Blanchet
ACL
2006
13 years 10 months ago
Learning Accurate, Compact, and Interpretable Tree Annotation
We present an automatic approach to tree annotation in which basic nonterminal symbols are alternately split and merged to maximize the likelihood of a training treebank. Starting...
Slav Petrov, Leon Barrett, Romain Thibaux, Dan Kle...
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 8 months ago
Verification of Java Bytecode using Analysis and Transformation of Logic Programs
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...
Elvira Albert, Miguel Gómez-Zamalloa, Laure...
ICIC
2005
Springer
14 years 2 months ago
Orthogonal Forward Selection for Constructing the Radial Basis Function Network with Tunable Nodes
Abstract. An orthogonal forward selection (OFS) algorithm based on the leaveone-out (LOO) criterion is proposed for the construction of radial basis function (RBF) networks with tu...
Sheng Chen, Xia Hong, Chris J. Harris
CCS
2006
ACM
14 years 10 days ago
EXE: automatically generating inputs of death
This paper presents EXE, an effective bug-finding tool that automatically generates inputs that crash real code. Instead of running code on manually or randomly constructed input,...
Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, ...