Sciweavers

3691 search results - page 647 / 739
» Bayesian Logic Programs
Sort
View
174
Voted
FTCS
1998
144views more  FTCS 1998»
15 years 6 months ago
Improving Software Robustness with Dependability Cases
Programs fail mainly for two reasons: logic errors in the code, and exception failures. Exception failures can account for up to 2/3 of system crashes [6], hence are worthy of ser...
Roy A. Maxion, Robert T. Olszewski
ISMB
1997
15 years 6 months ago
SEALS: A System for Easy Analysis of Lots of Sequences
We present a system of programs designed to facilitate sequence analysis projects involving large amounts of data. SEALS (System for Easy Analysis of Lots of Sequences) is a logic...
D. Roland Walker, Eugene V. Koonin
DAGSTUHL
1996
15 years 6 months ago
Efficiently Generating Efficient Generating Extensions in Prolog
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evalua...
Jesper Jørgensen, Michael Leuschel
124
Voted
LDTA
2010
15 years 5 months ago
Faster ambiguity detection by grammar filtering
Real programming languages are often defined using ambiguous context-free grammars. Some ambiguity is intentional while other ambiguity is accidental. A good grammar development e...
H. J. S. Basten, Jurgen J. Vinju
ENTCS
2008
64views more  ENTCS 2008»
15 years 4 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader