134 search results - page 1 / 27 » Finiteness Conditions for Strictness Analysis |
SAS
1993
Springer
13 years 9 months ago
1993
Springer
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
JSYML
2008
13 years 4 months ago
2008
We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a ...
RTCSA
2008
IEEE
13 years 11 months ago
2008
IEEE
Real-time systems are often designed using preemptive scheduling to guarantee the execution of high priority tasks. For multiple reasons there is a great interest in exploring non...
TCIAIG
2010
12 years 11 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
CDC
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...