1226 search results - page 20 / 246 » Proofs, Programs and Abstract Complexity |
103
click to vote
INFSOF
1998
15 years 1 months ago
1998
Slices as an Abstraction for Cohesion Measurement Linda M. Ott Michigan Technological University James M. Bieman Colorado State University The basis for measuring many attributes ...
CORR
2007
Springer
15 years 1 months ago
2007
Springer
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....
117
click to vote
CIE
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
111
click to vote
SAS
2010
Springer
15 years 9 days ago
2010
Springer
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...
115
click to vote
POPL
1994
ACM
15 years 6 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...