Sciweavers

1461 search results - page 164 / 293
» Analysis of Constraint Logic Programs
Sort
View
VSTTE
2012
Springer
13 years 5 months ago
Deciding Functional Lists with Sublist Sets
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
Thomas Wies, Marco Muñiz, Viktor Kuncak
103
Voted
SAC
2008
ACM
14 years 9 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
FOSSACS
2009
Springer
15 years 4 months ago
Beyond Shapes: Lists with Ordered Data
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
Kshitij Bansal, Rémi Brochenin, Étie...
BMCBI
2008
103views more  BMCBI 2008»
14 years 10 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...