Sciweavers

8766 search results - page 597 / 1754
» Functional logic programming
Sort
View
CSL
1999
Springer
15 years 9 months ago
Pre-logical Relations
Abstract. We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful but having furth...
Furio Honsell, Donald Sannella
TVLSI
2002
111views more  TVLSI 2002»
15 years 4 months ago
Circular BIST with state skipping
Circular built-in self-test (BIST) is a "test per clock" scheme that offers many advantages compared with conventional BIST approaches in terms of low area overhead, simp...
Nur A. Touba
HASKELL
2009
ACM
15 years 11 months ago
Types are calling conventions
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
Maximilian C. Bolingbroke, Simon L. Peyton Jones
168
Voted
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 8 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
PPDP
2009
Springer
15 years 11 months ago
Path-sensitive region analysis for mercury programs
Dividing the heap memory of programs into regions is the starting point of region-based memory management. In our existing work of enabling region-based memory management for Merc...
Quan Phan, Gerda Janssens