649 search results - page 110 / 130 » Formalizing Rework in Software Processes |
147
click to vote
SIGSOFT
2003
ACM
16 years 3 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
155
click to vote
HASKELL
2009
ACM
15 years 9 months ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
115
Voted
AVI
2008
15 years 4 months ago
2008
The development of intelligent assistants has largely benefited from the adoption of decision-theoretic (DT) approaches that enable an agent to reason and account for the uncertai...
128
click to vote
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
m, modules, types and operations), different kinds of abstractions (functional/data, types/objects etc.) without falling into a loose collection of diagram languages. Considering a...
101
Voted
CICLING
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...