Sciweavers

217 search results - page 34 / 44
» Automatic Termination
Sort
View
ECCV
2004
Springer
16 years 1 months ago
An Information-Based Measure for Grouping Quality
We propose a method for measuring the quality of a grouping result, based on the following observation: a better grouping result provides more information about the true, unknown g...
Erik A. Engbers, Michael Lindenbaum, Arnold W. M. ...
POPL
2009
ACM
16 years 13 days ago
Proving that non-blocking algorithms don't block
A concurrent data-structure implementation is considered nonblocking if it meets one of three following liveness criteria: waitfreedom, lock-freedom, or obstruction-freedom. Devel...
Alexey Gotsman, Byron Cook, Matthew J. Parkinson, ...
POPL
2002
ACM
16 years 3 days ago
Composing dataflow analyses and transformations
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
Sorin Lerner, David Grove, Craig Chambers
CADE
2008
Springer
16 years 3 days ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
FASE
2009
Springer
15 years 6 months ago
Logical Testing
Abstract. Software is often tested with unit tests, in which each procedure is executed in isolation, and its result compared with an expected value. Individual tests correspond to...
Kathryn E. Gray, Alan Mycroft