Sciweavers

489 search results - page 76 / 98
» Reasoning about confidentiality at requirements engineering ...
Sort
View
ICFP
2009
ACM
14 years 11 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
POPL
2008
ACM
14 years 10 months ago
Relational inductive shape analysis
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
Bor-Yuh Evan Chang, Xavier Rival
ERLANG
2008
ACM
14 years 5 days ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna
P2PKM
2004
13 years 11 months ago
Ontology-based Service Discovery in P2P Networks
The ubiquitous computing vision is to make knowledge and services easily available in our everyday environments. A wide range of devices, applications and services can be intercon...
Daniel Elenius, Magnus Ingmarsson
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
12 years 6 months ago
Domain bias in web search
This paper uncovers a new phenomenon in web search that we call domain bias — a user’s propensity to believe that a page is more relevant just because it comes from a particul...
Samuel Ieong, Nina Mishra, Eldar Sadikov, Li Zhang