Sciweavers

1710 search results - page 183 / 342
» High-Level Programs and Program Conditions
Sort
View
FSTTCS
2005
Springer
14 years 1 months ago
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saras...
CP
2003
Springer
14 years 1 months ago
A Synthesis of Constraint Satisfaction and Constraint Solving
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
Michael J. Maher
ICLP
1999
Springer
14 years 19 days ago
A Linear Tabling Mechanism
Delaying-based tabling mechanisms, such as the one adopted in XSB, are nonlinear in the sense that the computation state of delayed calls has to be preserved. In this paper, we pr...
Neng-Fa Zhou, Yi-Dong Shen, Li-Yan Yuan, Jia-Huai ...
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
14 years 18 days ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
IFL
1997
Springer
153views Formal Methods» more  IFL 1997»
14 years 15 days ago
Common Subexpressions Are Uncommon in Lazy Functional Languages
Common subexpression elimination is a well-known compiler optimisation that saves time by avoiding the repetition of the same computation. In lazy functional languages, referential...
Olaf Chitil