Sciweavers

1864 search results - page 326 / 373
» Formal topology and domains
Sort
View
FIW
2009
120views Communications» more  FIW 2009»
13 years 6 months ago
Software Security Vulnerabilities Seen As Feature Interactions
The security of software applications is an important domain, and one that mixes formalisms (e.g. when dealing with cryptography and security protocols) with very ad hoc, low level...
Guy-Vincent Jourdan
CLEIEJ
2010
13 years 6 months ago
Typing Textual Entities and M2T/T2M Transformations in a Model Management Environment
Global Model Management (GMM) is a model-based approach for managing large sets of interrelated heterogeneous and complex MDE artifacts. Such artifacts are usually represented as ...
Andrés Vignaga
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 6 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 3 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
JCS
2011
91views more  JCS 2011»
13 years 3 months ago
A framework for analyzing RFID distance bounding protocols
Many distance bounding protocols appropriate for the RFID technology have been proposed recently. Unfortunately, they are commonly designed without any formal approach, which lead...
Gildas Avoine, Muhammed Ali Bingöl, Süle...