Sciweavers

195 search results - page 17 / 39
» Process Algebra with Nonstandard Timing
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 6 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
TIME
1994
IEEE
15 years 6 months ago
An Algebraic Formulation of Temporal Knowledge for Reasoning about Recurring Events
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
Robert A. Morris, William D. Shoaff, Lina Khatib
SC
2009
ACM
15 years 9 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
Fengguang Song, Asim YarKhan, Jack Dongarra
110
Voted
ERSHOV
2006
Springer
15 years 6 months ago
Information-Flow Attacks Based on Limited Observations
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
Damas P. Gruska
CORR
2011
Springer
127views Education» more  CORR 2011»
14 years 9 months ago
Is a probabilistic modeling
— A new standpoint on financial time series, without the use of any mathematical model and of probabilistic tools, yields not only a rigorous approach of trends and volatility, ...
Michel Fliess, Cédric Join, Fréd&eac...