Sciweavers

304 search results - page 54 / 61
» Analysis of the paraconsistency in some logics
Sort
View
PLDI
2005
ACM
14 years 2 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
HASE
1997
IEEE
14 years 24 days ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchroniz...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi...
DAGSTUHL
2006
13 years 10 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
EUSFLAT
2009
181views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Fuzzy Concept Lattice is Made by Proto-Fuzzy Concepts
Abstract-- An L-fuzzy context is a triple consisting of a set of objects, a set of attributes and an L-fuzzy binary relation between them. An l-cut is a classical context over the ...
Ondrej Kridlo, Stanislav Krajci
ACMMSP
2005
ACM
101views Hardware» more  ACMMSP 2005»
14 years 2 months ago
Transparent pointer compression for linked data structures
64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and m...
Chris Lattner, Vikram S. Adve