Sciweavers

4036 search results - page 302 / 808
» Formal Methods
Sort
View
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
FUIN
2008
107views more  FUIN 2008»
15 years 6 months ago
Modelling and Simulation of Quantum Teleportation and Dense Coding Using Predicate/Transition-Nets
Reachability analysis is one of the most successful methods used in design and validation of protocols for classical communication, whereas the predicate/transition-net formalism i...
Kimmo Varpaaniemi, Leo Ojala
COMPSAC
2007
IEEE
16 years 1 months ago
Automated Testing EJB Components Based on Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It has the advantages of highly automated testing process and independence of t...
Liang Kong, Hong Zhu, Bin Zhou
ASAP
1997
IEEE
106views Hardware» more  ASAP 1997»
15 years 11 months ago
Libraries of schedule-free operators in Alpha
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
Florent de Dinechin
CASES
2010
ACM
15 years 3 months ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...