Sciweavers

1016 search results - page 118 / 204
» Automatic Analysis of Programming Assignments
Sort
View
ESOP
2005
Springer
15 years 9 months ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers
SAC
2011
ACM
14 years 6 months ago
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages
Dynamically typed programming languages are powerful tools for rapid software development. However, there are scenarios that would benefit from actual type information being avai...
Michael Haupt, Michael Perscheid, Robert Hirschfel...
POPL
2011
ACM
14 years 6 months ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
IOR
2006
177views more  IOR 2006»
15 years 3 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
146
Voted
SOSP
2007
ACM
16 years 9 days ago
/*icomment: bugs or bad comments?*/
Commenting source code has long been a common practice in software development. Compared to source code, comments are more direct, descriptive and easy-to-understand. Comments and...
Lin Tan, Ding Yuan, Gopal Krishna, Yuanyuan Zhou