Sciweavers

161 search results - page 2 / 33
» A Complete Method for the Synthesis of Linear Ranking Functi...
Sort
View
PLDI
2010
ACM
14 years 3 months ago
Complete Functional Synthesis
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
Viktor Kuncak, Mika l Mayer, Ruzica Piskac, Philip...
ICASSP
2011
IEEE
12 years 10 months ago
SRF: Matrix completion based on smoothed rank function
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
ACSD
2010
IEEE
239views Hardware» more  ACSD 2010»
13 years 4 months ago
A Complete Synthesis Method for Block-Level Relaxation in Self-Timed Datapaths
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
W. B. Toms, David A. Edwards
CONCUR
2005
Springer
13 years 11 months ago
Termination Analysis of Integer Linear Loops
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...
Aaron R. Bradley, Zohar Manna, Henny B. Sipma
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 4 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...