Sciweavers

394 search results - page 38 / 79
» Formal polytypic programs and proofs
Sort
View
TPHOL
2007
IEEE
14 years 2 months ago
Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
Tom Ridge
ALT
2004
Springer
14 years 5 months ago
Probabilistic Inductive Logic Programming
Probabilistic inductive logic programming, sometimes also called statistical relational learning, addresses one of the central questions of artificial intelligence: the integratio...
Luc De Raedt, Kristian Kersting
CP
2001
Springer
14 years 15 days ago
A Temporal Concurrent Constraint Programming Calculus
Abstract The tcc model is a formalism for reactive concurrent constraint programming. In this paper we propose a model of temporal concurrent constraint programming which adds to t...
Catuscia Palamidessi, Frank D. Valencia
NJC
2002
109views more  NJC 2002»
13 years 7 months ago
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of mo...
Mogens Nielsen, Catuscia Palamidessi, Frank D. Val...
ICFP
2003
ACM
14 years 8 months ago
Verifying CPS transformations in Isabelle/HOL
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
Yasuhiko Minamide, Koji Okuma