Sciweavers

3408 search results - page 333 / 682
» Logic, language, information and computation
Sort
View
POPL
2007
ACM
16 years 7 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
INFOSCALE
2007
ACM
15 years 8 months ago
Ontology driven adaptive data processing in wireless sensor networks
It is important to provide adaptive data processing in wireless sensor networks in order to deal with various applications. In this paper,we propose a WIreless Sensor Networks Ont...
Yuheng Hu, Zhendong Wu, Ming Guo
167
Voted
IWFM
1998
125views Formal Methods» more  IWFM 1998»
15 years 8 months ago
Mathematics for Formal Methods, a Proposal for Education Reform
It is widely recognized that there is a body of mathematics which is crucial to the underpinning of computer science, software engineering, and information and communications tech...
Mícheál Mac an Airchinnigh
CORR
2002
Springer
187views Education» more  CORR 2002»
15 years 6 months ago
Answer Sets for Consistent Query Answering in Inconsistent Databases
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
ICALP
2003
Springer
16 years 5 hour ago
Sophistication Revisited
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
Luis Antunes 0002, Lance Fortnow