Sciweavers

1557 search results - page 10 / 312
» Programming up to Congruence
Sort
View
90
Voted
ICLP
2005
Springer
15 years 4 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
APCSAC
2001
IEEE
15 years 2 months ago
Stacking them up: a Comparison of Virtual Machines
A popular trend in current software technology is to gain program portability by compiling programs to an inte form based on an abstract machine definition. Such approaches date b...
K. John Gough
RIVF
2008
15 years 2 days ago
Speeding up subset seed algorithm for intensive protein sequence comparison
Abstract--Sequence similarity search is a common and repeated task in molecular biology. The rapid growth of genomic databases leads to the need of speeding up the treatment of thi...
Van Hoa Nguyen, Dominique Lavenier
ERLANG
2009
ACM
15 years 5 months ago
Cleaning up Erlang code is a dirty job but somebody's gotta do it
This paper describes opportunities for automatically modernizing Erlang applications, cleaning them up, eliminating certain bad smells from their code and occasionally also improv...
Thanassis Avgerinos, Konstantinos F. Sagonas
CAV
2004
Springer
108views Hardware» more  CAV 2004»
15 years 4 months ago
DPLL( T): Fast Decision Procedures
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
Harald Ganzinger, George Hagen, Robert Nieuwenhuis...