Sciweavers

850 search results - page 151 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
PASTE
2004
ACM
14 years 25 days ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick
IEAAIE
1998
Springer
13 years 11 months ago
Managing the Usage Experience in a Library of Software Components
The users of libraries of object-oriented software components face with both a terminological and a cognitive gap. Usually, library users do not understand the vocabulary used in t...
Pedro A. González-Calero, Mercedes Gó...
CP
2007
Springer
14 years 1 months ago
The Log-Support Encoding of CSP into SAT
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
Marco Gavanelli
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 22 days ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ASC
2006
13 years 8 months ago
A WAM implementation for flexible query answering
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...
Pascual Julián Iranzo, Clemente Rubio-Manza...