Sciweavers

946 search results - page 170 / 190
» Process Algebra and Non-Interference
Sort
View
KR
2004
Springer
14 years 2 months ago
Knowledge Discovery by Reversing Inductive Knowledge Representation
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...
Gabriele Kern-Isberner, Jens Fisseler
MEMOCODE
2003
IEEE
14 years 1 months ago
Bridging CSP and C++ with Selective Formalism and Executable Specifications
CSP (Communicating Sequential Processes) is a useful algebraic notation for creating a hierarchical behavioural specification for concurrent systems, due to its formal interproces...
William B. Gardner
TPHOL
2003
IEEE
14 years 1 months ago
Program Extraction from Large Proof Developments
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
Luís Cruz-Filipe, Bas Spitters
ISSTA
2009
ACM
14 years 1 months ago
Run-time conformance checking of mobile and distributed systems using executable models
This paper describes an approach for conformance testing of mobile and distributed systems. The approach is based on kiltera — a novel, high-level language supporting the descri...
Ahmad A. Saifan, Ernesto Posse, Jürgen Dingel
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
14 years 29 days ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...