Sciweavers

20017 search results - page 3626 / 4004
» Using personas effectively
Sort
View
CHI
2003
ACM
16 years 7 months ago
Phrase sets for evaluating text entry techniques
In evaluations of text entry methods, participants enter phrases of text using a technique of interest while performance data are collected. This paper describes and publishes (vi...
I. Scott MacKenzie, R. William Soukoreff
POPL
2008
ACM
16 years 7 months ago
Boomerang: resourceful lenses for string data
A lens is a bidirectional program. When read from left to right, it denotes an ordinary function that maps inputs to outputs. When read from right to left, it denotes an "upd...
Aaron Bohannon, J. Nathan Foster, Benjamin C. Pier...
POPL
2008
ACM
16 years 7 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
203
Voted
RECOMB
2005
Springer
16 years 7 months ago
Comparative Systems Biology of the Sporulation Initiation Network in Prokaryotes
Many years of experimental and computational molecular biology of model organisms such as Escherichia coli and Saccharomyces cerevisiae has elucidated the gene regulatory network i...
Michiel J. L. de Hoon, Dennis Vitkup
CADE
2007
Springer
16 years 7 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard
« Prev « First page 3626 / 4004 Last » Next »