827 search results - page 164 / 166 » Proof-Theoretic Soundness and Completeness |
ACTA
1998
13 years 6 months ago
1998
The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
TCS
2002
13 years 6 months ago
2002
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
MSCS
2007
13 years 6 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
DLOG
2010
13 years 4 months ago
2010
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
SP
2010
IEEE
13 years 4 months ago
2010
IEEE
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...