949 search results - page 85 / 190 » Programmed Mutagenesis Is Universal |
222
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
150
click to vote
ICSM
2006
IEEE
15 years 10 months ago
2006
IEEE
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
149
click to vote
IJFCS
2007
15 years 4 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
132
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
136
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...