Sciweavers

804 search results - page 85 / 161
» Algorithms for Programmers
Sort
View
POPL
2010
ACM
15 years 5 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
137
Voted
ICSE
2010
IEEE-ACM
15 years 4 months ago
DETERMIN: inferring likely deterministic specifications of multithreaded programs
The trend towards multicore processors and graphic processing units is increasing the need for software that can take advantage of parallelism. Writing correct parallel programs u...
Jacob Burnim, Koushik Sen
139
Voted
DLS
2008
149views Languages» more  DLS 2008»
15 years 4 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
142
Voted
AC
1998
Springer
15 years 2 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
EACL
2010
ACL Anthology
15 years 15 days ago
Generating Referring Expressions in Context: The GREC Task Evaluation Challenges
Until recently, referring expression generation (reg) research focused on the task of selecting the semantic content of definite mentions of listener-familiar discourse entities. I...
Anja Belz, Eric Kow, Jette Viethen, Albert Gatt