Sciweavers

244 search results - page 47 / 49
» A Way to Interpret Lukasiewicz Logic and Basic Logic
Sort
View
CLA
2007
13 years 9 months ago
Representing Numeric Values in Concept Lattices
Formal Concept Analysis is based on the occurrence of symbolic attributes in individual objects, or observations. But, when the attribute is numeric, treatment has been awkward. In...
John L. Pfaltz
ICFP
2012
ACM
11 years 9 months ago
Introspective pushdown analysis of higher-order programs
In the static analysis of functional programs, pushdown flow analabstract garbage collection skirt just inside the boundaries of soundness and decidability. Alone, each method re...
Christopher Earl, Ilya Sergey, Matthew Might, Davi...
ICDCS
2005
IEEE
14 years 1 months ago
Network-Centric Buffer Cache Organization
A pass-through server such as an NFS server backed by an iSCSI[1] storage server only passes data between the storage server and NFS clients. Ideally it should require at most one...
Gang Peng, Srikant Sharma, Tzi-cker Chiueh
TACAS
2000
Springer
149views Algorithms» more  TACAS 2000»
13 years 11 months ago
Proof General: A Generic Tool for Proof Development
This note describes Proof General, a tool for developing machine proofs with an interactive proof assistant. Interaction is based around a proof script, which is the target of a pr...
David Aspinall
PLDI
2010
ACM
14 years 16 days ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...