967 search results - page 98 / 194 » Probabilistic Predicative Programming |
133
Voted
CHARME
2003
Springer
15 years 8 months ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...
143
Voted
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
134
Voted
ICTAC
2010
Springer
15 years 21 days ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
118
Voted
ASPLOS
2010
ACM
15 years 8 months ago
2010
ACM
Symbiotic job scheduling boosts simultaneous multithreading (SMT) processor performance by co-scheduling jobs that have ‘compatible’ demands on the processor’s shared resour...
141
Voted
UAI
1997
15 years 4 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...