Sciweavers

272 search results - page 38 / 55
» Programming languages capturing complexity classes
Sort
View
POPL
2008
ACM
14 years 10 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
ASPLOS
2011
ACM
13 years 1 months ago
Improving the performance of trace-based systems by false loop filtering
Trace-based compilation is a promising technique for language compilers and binary translators. It offers the potential to expand the compilation scopes that have traditionally be...
Hiroshige Hayashizaki, Peng Wu, Hiroshi Inoue, Mau...
ESWS
2007
Springer
14 years 4 months ago
Minimal Deductive Systems for RDF
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
Sergio Muñoz, Jorge Pérez, Claudio G...
ICALP
2005
Springer
14 years 3 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
Allan Borodin, David Cashman, Avner Magen
FORMATS
2010
Springer
13 years 7 months ago
A Framework for Verification of Software with Time and Probabilities
Abstract. Quantitative verification techniques are able to establish system properties such as "the probability of an airbag failing to deploy on demand" or "the exp...
Marta Z. Kwiatkowska, Gethin Norman, David Parker