Sciweavers

2540 search results - page 106 / 508
» Abstract Logics as Dialgebras
Sort
View
FCSC
2010
170views more  FCSC 2010»
15 years 3 months ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
CORR
2011
Springer
165views Education» more  CORR 2011»
15 years 1 months ago
From IF to BI: a tale of dependence and separation
We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and V¨a¨an¨anen, and their compositional semantics due to Hodges. We show h...
Samson Abramsky, Jouko A. Väänänen
DLOG
2011
14 years 10 months ago
On the Problem of Weighted Max-DL-SAT and its Application to Image Labeling
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
Stefan Scheglmann, Carsten Saathoff, Steffen Staab
IWFM
1998
136views Formal Methods» more  IWFM 1998»
15 years 7 months ago
Translating Structured Database Schemas into Abstract Machines
ing Structured Database Schemas into Abstract Machines Brian Matthews Rutherford Appleton Laboratory, Didcot, OXON, OX11 OQX, U.K. Elvira Locuratolo Istituto di Elaborazione dell&#...
Brian Matthews, Elvira Locuratolo
ENTCS
2008
104views more  ENTCS 2008»
15 years 6 months ago
A Logic for Virtual Memory
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
Rafal Kolanski