Sciweavers

2138 search results - page 391 / 428
» Logics for the Relational Syllogistic
Sort
View
TCS
2002
13 years 7 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
ICTAC
2010
Springer
13 years 6 months ago
A Modality for Safe Resource Sharing and Code Reentrancy
Abstract. The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are ...
Rui Shi, Dengping Zhu, Hongwei Xi
KBSE
2010
IEEE
13 years 6 months ago
Analyzing security architectures
We present a semi-automated approach, Secoria, for analyzing a security runtime architecture for security and for conformance to an object-oriented implementation. Typecheckable a...
Marwan Abi-Antoun, Jeffrey M. Barnes
LICS
2010
IEEE
13 years 6 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...