797 search results - page 50 / 160 » Eliminating Proofs from Programs |
116
click to vote
KI
1990
Springer
15 years 4 months ago
1990
Springer
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
119
click to vote
AGP
1995
IEEE
15 years 4 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
76
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We present an incomplete filtering algorithm for the circuit constraint. The filter removes redundant values by eliminating nonHamiltonian edges from the associated gra...
124
click to vote
PLDI
1994
ACM
15 years 4 months ago
1994
ACM
: Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not k...
115
click to vote
ENTCS
2008
15 years 23 days ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...