Sciweavers

367 search results - page 39 / 74
» Adapting functional programs to higher order logic
Sort
View
SCCC
1998
IEEE
14 years 28 days ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
LOPSTR
2004
Springer
14 years 2 months ago
Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
J. B. Wells, Boris Yakobowski
SBACPAD
2004
IEEE
106views Hardware» more  SBACPAD 2004»
13 years 10 months ago
High Performance Communication System Based on Generic Programming
This paper presents a high performance communication system based on generic programming. The system adapts itself according to the protocol being used on communication, simplifyi...
André Luís Gobbi Sanches, Fernando R...
LOPSTR
1997
Springer
14 years 25 days ago
Development of Correct Transformation Schemata for Prolog Programs
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
Julian Richardson, Norbert E. Fuchs
KBSE
2007
IEEE
14 years 3 months ago
Sequential circuits for program analysis
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid