Sciweavers

328 search results - page 26 / 66
» Simple Termination Revisited
Sort
View
DAC
1994
ACM
13 years 11 months ago
New Techniques for Efficient Verification with Implicitly Conjoined BDDs
-- In previous work, Hu and Dill identified a common cause of BDD-size blowup in high-level design verification and proposed the method of implicitly conjoined invariants to addres...
Alan J. Hu, Gary York, David L. Dill
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 7 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
FMICS
2006
Springer
13 years 11 months ago
"To Store or Not To Store" Reloaded: Reclaiming Memory on Demand
Behrmann et al. posed the question whether "To Store or Not To Store" [1] states during reachability analysis, in order to counter the effects of the well-known state spa...
Moritz Hammer, Michael Weber
ICLP
1993
Springer
13 years 11 months ago
Control Generation for Logic Programs
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
Stefan Lüttringhaus-Kappel
ICWN
2003
13 years 9 months ago
Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
James Gross, Holger Karl, Frank H. P. Fitzek, Adam...