Sciweavers

949 search results - page 71 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
CONCUR
2000
Springer
14 years 1 days ago
Process Spaces
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
Radu Negulescu
RTSS
2008
IEEE
14 years 2 months ago
A Multi-mode Real-Time Calculus
The Real-Time Calculus (RTC) framework proposed in [Chakraborty et al., DATE 2003] and subsequently extended in [Wandeler et al., Real-Time Systems 29(2-3), 2005] and a number of ...
Linh T. X. Phan, Samarjit Chakraborty, P. S. Thiag...
ISSAC
1997
Springer
105views Mathematics» more  ISSAC 1997»
13 years 12 months ago
Guarded Expressions in Practice
Computer algebra systems typically drop some degenerate cases when evaluating expressions, e.g., x=x becomes 1 dropping the case x = 0. We claim that it is feasible in practice to...
Andreas Dolzmann, Thomas Sturm
MSR
2006
ACM
14 years 1 months ago
Mining eclipse for cross-cutting concerns
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
Silvia Breu, Thomas Zimmermann, Christian Lindig
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 2 months ago
Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs
This paper studies left invertibility of discrete-time linear output-quantized systems. Quantized outputs are generated according to a given partition of the state-space, while inp...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi