Sciweavers

767 search results - page 82 / 154
» Logic for Mathematical Writing
Sort
View
SAC
2008
ACM
13 years 7 months ago
Adding background knowledge to formal concept analysis via attribute dependency formulas
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
Radim Belohlávek, Vilém Vychodil
AMCS
2011
341views Mathematics» more  AMCS 2011»
13 years 2 months ago
FSP and FLTL framework for specification and verification of middle-agents
Agents are a useful abstraction frequently employed as a basic building block in modeling service, information and resource sharing in global environments. The connecting of reques...
Amelia Badica, Costin Badica
ICFP
2009
ACM
14 years 8 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
FPGA
2010
ACM
276views FPGA» more  FPGA 2010»
14 years 4 months ago
Accelerating Monte Carlo based SSTA using FPGA
Monte Carlo based SSTA serves as the golden standard against alternative SSTA algorithms, but it is seldom used in practice due to its high computation time. In this paper, we acc...
Jason Cong, Karthik Gururaj, Wei Jiang, Bin Liu, K...
CCS
2005
ACM
14 years 1 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...