Sciweavers

949 search results - page 47 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
MEMOCODE
2008
IEEE
14 years 2 months ago
Virtual prototyping AADL architectures in a polychronous model of computation
While synchrony and asynchrony are two distinct concepts of concurrency theory, effective and formally defined embedded system design methodologies usually mix the best from both...
Ma Yue, Jean-Pierre Talpin, Thierry Gautier
EDCC
2005
Springer
14 years 1 months ago
Formal Safety Analysis of a Radio-Based Railroad Crossing Using Deductive Cause-Consequence Analysis (DCCA)
Abstract. In this paper we present the formal safety analysis of a radiobased railroad crossing. We use deductive cause-consequence analysis (DCCA) as analysis method. DCCA is a no...
Frank Ortmeier, Wolfgang Reif, Gerhard Schellhorn
RTA
2009
Springer
14 years 2 months ago
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
Sergiu Bursuc, Hubert Comon-Lundh
SC
1994
ACM
13 years 11 months ago
Adaptive load migration systems for PVM
Adaptive load distribution is necessary for parallel applications to co-exist e ectively with other jobs in a network of shared, heterogeneous workstations. We present three metho...
Jeremy Casas, Ravi B. Konuru, Steve W. Otto, Rober...
IPPS
1998
IEEE
13 years 12 months ago
The Implicit Pipeline Method
We present a novel scheme for the solution of linear differential equation systems on parallel computers. The Implicit Pipeline (ImP) method uses an implicit timeintegration schem...
John B. Pormann