Sciweavers

1461 search results - page 131 / 293
» Analysis of Constraint Logic Programs
Sort
View
JDM
2000
82views more  JDM 2000»
14 years 9 months ago
Binary Equivalents of Ternary Relationships in Entity-Relationship Modeling: A Logical Decomposition Approach
Little work has been completed which addresses the logical composition and use of ternary relationships in entity-relationship modeling. Many modeling notations and most CASE tool...
Trevor H. Jones, Il-Yeol Song
ICDCIT
2005
Springer
15 years 3 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...
ACL
2004
14 years 11 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
15 years 10 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...
POPL
2011
ACM
14 years 26 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen