Sciweavers

1763 search results - page 98 / 353
» A Formalization of Polytime Functions
Sort
View
IFL
2001
Springer
15 years 2 months ago
Runtime Behavior of Conversion Interpretation of Subtyping
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...
Yasuhiko Minamide
IFL
2001
Springer
15 years 2 months ago
A Polynomial-Cost Non-determinism Analysis
Abstract. This paper is an extension of a previous work where two nondeterminism analyses were presented. One of them was efficient but not very powerful and the other one was more...
Ricardo Pena, Clara Segura
IFL
1997
Springer
158views Formal Methods» more  IFL 1997»
15 years 2 months ago
A Compacting Garbage Collector for Unidirectional Heaps
A unidirectional heap is a heap where all pointers go in one direction, e.g. from newer to older objects. For a strict functional language, such as Erlang, the heap may be arranged...
Kent Boortz, Dan Sahlin
FMCAD
2006
Springer
15 years 1 months ago
Over-Approximating Boolean Programs with Unbounded Thread Creation
Abstract-- This paper describes a symbolic algorithm for overapproximating reachability in Boolean programs with unbounded thread creation. The fix-point is detected by projecting ...
Byron Cook, Daniel Kroening, Natasha Sharygina
IFL
2000
Springer
15 years 1 months ago
Improving Cache Effectiveness through Array Data Layout Manipulation in SAC
Sac is a functional array processing language particularly designed with numerical applications in mind. In this field the runtime performance of programs critically depends on the...
Clemens Grelck