Sciweavers

4192 search results - page 465 / 839
» Probabilistic Logic Programming
Sort
View
AMI
2009
Springer
15 years 8 months ago
Bug-Free Sensors: The Automatic Verification of Context-Aware TinyOS Applications
Abstract. We provide the first tool for verifying the logic of contextaware applications written for the mainstream sensor network operating system TinyOS; we focus on detecting pr...
Doina Bucur, Marta Z. Kwiatkowska
CORR
2004
Springer
97views Education» more  CORR 2004»
15 years 4 months ago
Quantum typing
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
Benoît Valiron
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 2 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 5 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ICFP
2010
ACM
15 years 5 months ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier