Sciweavers

949 search results - page 42 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
ICAC
2005
IEEE
14 years 1 months ago
Decentralised Autonomic Computing: Analysing Self-Organising Emergent Behaviour using Advanced Numerical Methods
When designing decentralised autonomic computing systems, a fundamental engineering issue is to assess systemwide behaviour. Such decentralised systems are characterised by the la...
Tom De Wolf, Giovanni Samaey, Tom Holvoet, Dirk Ro...
ICCAD
2007
IEEE
107views Hardware» more  ICCAD 2007»
14 years 4 months ago
Computation of minimal counterexamples by using black box techniques and symbolic methods
— Computing counterexamples is a crucial task for error diagnosis and debugging of sequential systems. If an implementation does not fulfill its specification, counterexamples ...
Tobias Nopper, Christoph Scholl, Bernd Becker
ESORICS
2010
Springer
13 years 8 months ago
Verifying Security Property of Peer-to-Peer Systems Using CSP
Due to their nature, Peer-to-Peer (P2P) systems are subject to a wide range of security issues. In this paper, we focus on a specific security property, called the root authenticit...
Tien Tuan Anh Dinh, Mark Ryan
SAC
2005
ACM
14 years 1 months ago
Formal modeling and quantitative analysis of KLAIM-based mobile systems
KLAIM is an experimental language designed for modeling and programming distributed systems composed of mobile components where distribution awareness and dynamic system architect...
Rocco De Nicola, Diego Latella, Mieke Massink
VLSID
1999
IEEE
101views VLSI» more  VLSID 1999»
13 years 12 months ago
Formal System Design Based on the Synchrony Hypothesis, Functional Models and Skeletons
Formal approaches to HW and system design have not been generally adopted, because designers often view the modelling concepts in these approaches as unsuitable for their problems...
Ingo Sander, Axel Jantsch