Sciweavers

1264 search results - page 108 / 253
» Abstract machines for programming language implementation
Sort
View
LISP
2008
96views more  LISP 2008»
13 years 8 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
CONCUR
2006
Springer
14 years 2 days ago
Minimization, Learning, and Conformance Testing of Boolean Programs
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
AGP
2010
IEEE
14 years 1 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
GPCE
2007
Springer
14 years 2 months ago
Generative programming techniques for Java library migration
Embedded systems can be viewed as scaled-down versions of their one counterparts. In many cases, the software abstractions and libraries for embedded systems can be derived from l...
Victor L. Winter, Azamatbek Mametjanov
SAMOS
2010
Springer
13 years 6 months ago
Programming multi-core architectures using Data-Flow techniques
Abstract—In this paper we present a Multithreaded programming methodology for multi-core systems that utilizes DataFlow concurrency. The programmer augments the program with macr...
Samer Arandi, Paraskevas Evripidou