Sciweavers

492 search results - page 62 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
IJIIDS
2010
136views more  IJIIDS 2010»
14 years 5 months ago
Kleisli category and database mappings
Abstract. This paper presents the semantics of database mappings in the relational database (DB) category, based on the power-view monad T and monadic algebras. The semantics can b...
Zoran Majkic, Bhanu Prasad
81
Voted
ICFP
2008
ACM
15 years 11 months ago
Functional translation of a calculus of capabilities
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
Arthur Charguéraud, François Pottier
89
Voted
SAC
2008
ACM
14 years 10 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...
88
Voted
DAC
2007
ACM
15 years 12 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
123
Voted
CORR
2011
Springer
174views Education» more  CORR 2011»
14 years 2 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato