Sciweavers

284 search results - page 2 / 57
» Recursive Abstractions for Parameterized Systems
Sort
View
GECCO
2004
Springer
116views Optimization» more  GECCO 2004»
13 years 10 months ago
Using Genetic Programming to Obtain a Closed-Form Approximation to a Recursive Function
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
Evan Kirshenbaum, Henri Jacques Suermondt
SOFSEM
2010
Springer
13 years 3 months ago
Forcing Monotonicity in Parameterized Verification: From Multisets to Words
We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of...
Parosh Aziz Abdulla
GLOBECOM
2006
IEEE
13 years 11 months ago
Low-Complexity Adaptive High-Resolution Channel Prediction for OFDM Systems
Abstract— We propose a low-complexity adaptive highresolution channel prediction algorithm for pilot symbol assisted orthogonal frequency division multiplexing (OFDM) systems. Th...
Ian C. Wong, Brian L. Evans
CONCUR
2007
Springer
13 years 9 months ago
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
ECOOP
2006
Springer
13 years 8 months ago
Parameterized Modules for Classes and Extensible Functions
Abstract. We present F(Eml), a language that combines classes, extensible functions, symmetric multiple dispatching, and a practical system for parameterized modules. Parameterized...
Keunwoo Lee, Craig Chambers