Sciweavers

1805 search results - page 39 / 361
» Functional programming with structured graphs
Sort
View
VISSOFT
2005
IEEE
14 years 1 months ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...
EMSOFT
2003
Springer
14 years 26 days ago
Generating Heap-Bounded Programs in a Functional Setting
Abstract. High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide stron...
Walid Taha, Stephan Ellner, Hongwei Xi
GLVLSI
2007
IEEE
189views VLSI» more  GLVLSI 2007»
14 years 2 months ago
Hardware-accelerated path-delay fault grading of functional test programs for processor-based systems
The path-delay fault simulation of functional tests on complex circuits such as current processor-based systems is a daunting task. The amount of computing power and memory needed...
Paolo Bernardi, Michelangelo Grosso, Matteo Sonza ...
ERLANG
2006
ACM
14 years 1 months ago
Model checking erlang programs: the functional approach
We present the new model checker McErlang for verifying Erlang programs. In comparison with the etomcrl tool set, McErlang differs mainly in that it is implemented in Erlang. The ...
Lars-Åke Fredlund, Clara Benac Earle
IJCAI
2003
13 years 9 months ago
Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
Tina Dell'Armi, Wolfgang Faber, Giuseppe Ielpa, Ni...