492 search results - page 68 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
97
Voted
ICTAC
2010
Springer
14 years 8 months 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 ...
80
Voted
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
95
Voted
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
102
click to vote
CALCO
2005
Springer
15 years 4 months ago
2005
Springer
Recently, various process calculi have been introduced which are suited for the modelling of mobile computation and in particular the mobility of program code; a prominent example ...
117
Voted
FOSSACS
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...