Sciweavers

1076 search results - page 66 / 216
» Operations on proofs and labels
Sort
View
WOSP
2010
ACM
14 years 3 months ago
A general result for deriving product-form solutions in markovian models
In this paper we provide a general method to derive productform solutions for stochastic models. We take inspiration from the Reversed Compound Agent Theorem [14] and we provide a...
Andrea Marin, Maria Grazia Vigliotti
FCT
2005
Springer
14 years 2 months ago
Deterministic Automata on Unranked Trees
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
Julien Cristau, Christof Löding, Wolfgang Tho...
ENTCS
2006
133views more  ENTCS 2006»
13 years 9 months ago
A Compositional Natural Semantics and Hoare Logic for Low-Level Languages
The advent of proof-carrying code has generated significant interest in reasoning about low-level languages. It is widely believed that low-level languages with jumps must be diff...
Ando Saabas, Tarmo Uustalu
IANDC
2010
128views more  IANDC 2010»
13 years 7 months ago
A coinductive calculus of binary trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
Alexandra Silva, Jan J. M. M. Rutten
CSFW
2004
IEEE
14 years 19 days ago
Using Active Learning in Intrusion Detection
Intrusion Detection Systems (IDSs) have become an important part of operational computer security. They are the last line of defense against malicious hackers and help detect ongo...
Magnus Almgren, Erland Jonsson