Sciweavers

949 search results - page 94 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
ENTCS
2007
168views more  ENTCS 2007»
13 years 8 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
INFOCOM
2012
IEEE
11 years 11 months ago
DEOS: Dynamic energy-oriented scheduling for sustainable wireless sensor networks
Abstract—Energy is the most precious resource in wireless sensor networks. To ensure sustainable operations, wireless sensor systems need to harvest energy from environments. The...
Ting Zhu, Abedelaziz Mohaisen, Yi Ping, Don Towsle...
WCRE
1999
IEEE
14 years 1 months ago
Experiments with Clustering as a Software Remodularization Method
As valuable software systems get old, reverse engineering becomes more and more important to the companies that have to maintain the code. Clustering is a key activity in reverse ...
Nicolas Anquetil, Timothy Lethbridge
COMCOM
1998
117views more  COMCOM 1998»
13 years 8 months ago
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
Shiuh-Pyng Shieh, Jun-Nan Chen
AAAI
1993
13 years 10 months ago
Numeric Reasoning with Relative Orders of Magnitude
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...
Philippe Dague