Sciweavers

35 search results - page 4 / 7
» Program Analysis via Satisfiability Modulo Path Programs
Sort
View
SEFM
2007
IEEE
14 years 29 days ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
POPL
1994
ACM
13 years 10 months ago
Formally Optimal Boxing
An important implementation decision in polymorphically typed functional programming languages is whether to represent data in boxed or unboxed form and when to transform them fro...
Fritz Henglein, Jesper Jørgensen
SIGSOFT
2010
ACM
13 years 4 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan
ICALP
2010
Springer
13 years 11 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
SCAM
2008
IEEE
14 years 1 months ago
User-Input Dependence Analysis via Graph Reachability
Bug-checking tools have been used with some success in recent years to find bugs in software. For finding bugs that can cause security vulnerabilities, bug checking tools requir...
Bernhard Scholz, Chenyi Zhang, Cristina Cifuentes