Sciweavers

565 search results - page 12 / 113
» A logic for authorization provenance
Sort
View
SAS
2009
Springer
175views Formal Methods» more  SAS 2009»
14 years 8 months ago
Automatic Parallelization and Optimization of Programs by Proof Rewriting
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
Clément Hurlin
VL
2007
IEEE
104views Visual Languages» more  VL 2007»
14 years 1 months ago
A Peirce Style Calculus for ALC
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
Frithjof Dau, Peter W. Eklund
ENTCS
2008
101views more  ENTCS 2008»
13 years 7 months ago
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
Andreas Abel
IGPL
2006
134views more  IGPL 2006»
13 years 7 months ago
Coherent Conditional Probability in a Fuzzy Logic Setting
Very recently, a (fuzzy modal) logic to reason about coherent conditional probability, in the sense of de Finetti, has been introduced by the authors. Under this approach, a condi...
Lluis Godo, Enrico Marchioni
EATCS
2000
108views more  EATCS 2000»
13 years 7 months ago
The Underlying Logic of Hoare Logic
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
Andreas Blass, Yuri Gurevich