967 search results - page 55 / 194 » Probabilistic Predicative Programming |
128
Voted
LOPSTR
1995
Springer
15 years 6 months ago
1995
Springer
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...
109
click to vote
CAV
2007
Springer
15 years 8 months ago
2007
Springer
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
124
click to vote
ESOP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. General refinement types allow types to be refined by predicates written in a general-purpose programming language, and can express function pre- and postconditions and d...
102
click to vote
ISCA
2006
IEEE
15 years 8 months ago
2006
IEEE
We present Program Demultiplexing (PD), an execution paradigm that creates concurrency in sequential programs by "demultiplexing" methods (functions or subroutines). Cal...
118
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...