Sciweavers

1382 search results - page 96 / 277
» Formal Analysis of Online Algorithms
Sort
View
IJIS
2008
83views more  IJIS 2008»
15 years 6 months ago
An algorithm for modelling key terms
The ability to analyse and represent formally semantic relations of terms is a core issue in information retrieval (IR), natural language processing (NLP), and in many related are...
D. Cai, C. J. van Rijsbergen
CP
2005
Springer
15 years 12 months ago
Sub-optimality Approximations
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
Russell Bent, Irit Katriel, Pascal Van Hentenryck
SAS
2004
Springer
140views Formal Methods» more  SAS 2004»
15 years 11 months ago
Path-Sensitive Analysis for Linear Arithmetic and Uninterpreted Functions
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
Sumit Gulwani, George C. Necula
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
15 years 10 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
FROCOS
2007
Springer
16 years 15 days ago
Combining Algorithms for Deciding Knowledge in Security Protocols
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Mathilde Arnaud, Véronique Cortier, St&eacu...