Sciweavers

529 search results - page 39 / 106
» Simple Random Logic Programs
Sort
View
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 2 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
CADE
2006
Springer
14 years 10 months ago
Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
Robert L. Constable, Wojciech Moczydlowski
FSTTCS
2005
Springer
14 years 3 months ago
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...
Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saras...
RANDOM
2001
Springer
14 years 2 months ago
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
Reuven Bar-Yehuda, Dror Rawitz
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 4 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...