Sciweavers

314 search results - page 53 / 63
» Compactness Properties for Stable Semantics of Logic Program...
Sort
View
POPL
2009
ACM
15 years 10 months ago
A combination framework for tracking partition sizes
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
Sumit Gulwani, Tal Lev-Ami, Mooly Sagiv
IWMM
2009
Springer
122views Hardware» more  IWMM 2009»
15 years 4 months ago
Parametric heap usage analysis for functional programs
This paper presents an analysis that derives a formula describing the worst-case live heap space usage of programs in a functional language with automated memory management (garba...
Leena Unnikrishnan, Scott D. Stoller
IFIP
2004
Springer
15 years 2 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham
ESWS
2006
Springer
15 years 1 months ago
Rules with Contextually Scoped Negation
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
Axel Polleres, Cristina Feier, Andreas Harth
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
14 years 11 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001