899 search results - page 95 / 180 » A CTL-Based Logic for Program Abstractions |
154
click to vote
ENTCS
2008
15 years 4 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
106
click to vote
TCS
2002
15 years 3 months ago
2002
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...
144
click to vote
LFCS
2009
Springer
15 years 11 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
146
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
153
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus...