Sciweavers

1598 search results - page 131 / 320
» A Unified Computation Model for Functional and Logic Program...
Sort
View
APLAS
2006
ACM
15 years 10 months ago
Comparing Completeness Properties of Static Analyses and Their Logics
Abstract. Static analyses calculate abstract states, and their logics validate properties of the abstract states. We place into perspective the variety of forwards, backwards, func...
David A. Schmidt
JAR
2008
105views more  JAR 2008»
15 years 6 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow
ICSM
2005
IEEE
15 years 12 months ago
Context-Free Slicing of UML Class Models
In the work presented here, we introduce a method to automatically generate a subset of a UML class model based on a user-defined criterion. The goal of this work is to allow us to...
Huzefa H. Kagdi, Jonathan I. Maletic, Andrew Sutto...
BMCBI
2010
121views more  BMCBI 2010»
15 years 3 months ago
Computing DNA duplex instability profiles efficiently with a two-state model: trends of promoters and binding sites
Background: DNA instability profiles have been used recently for predicting the transcriptional start site and the location of core promoters, and to gain insight into promoter ac...
Miriam R. Kantorovitz, Zoi Rapti, Vladimir Gelev, ...
ICFP
2006
ACM
16 years 6 months ago
Programming monads operationally with Unimo
Monads are widely used in Haskell for modeling computational effects, but defining monads remains a daunting challenge. Since every part of a monad's definition depends on it...
Chuan-Kai Lin