Sciweavers

754 search results - page 146 / 151
» Nested Expressions in Logic Programs
Sort
View
CORR
2004
Springer
177views Education» more  CORR 2004»
13 years 7 months ago
Typestate Checking and Regular Graph Constraints
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
Viktor Kuncak, Martin C. Rinard
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
BMCBI
2006
127views more  BMCBI 2006»
13 years 7 months ago
Automatic discovery of cross-family sequence features associated with protein function
Background: Methods for predicting protein function directly from amino acid sequences are useful tools in the study of uncharacterised protein families and in comparative genomic...
Markus Brameier, Josien Haan, Andrea Krings, Rober...
JAIR
2008
157views more  JAIR 2008»
13 years 7 months ago
Qualitative System Identification from Imperfect Data
Experience in the physical sciences suggests that the only realistic means of understanding complex systems is through the use of mathematical models. Typically, this has come to ...
George Macleod Coghill, Ashwin Srinivasan, Ross D....
SC
2009
ACM
14 years 2 months ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...