581 search results - page 98 / 117 » On the Verifiability of Programs Written in the Feature Lang... |
POPL
2005
ACM
14 years 8 months ago
2005
ACM
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
OOPSLA
2010
Springer
13 years 6 months ago
2010
Springer
Modern IDEs for object-oriented languages like Java provide support for a basic set of simple automated refactorings whose behaviour is easy to describe intuitively. It is, howeve...
ASWEC
2009
IEEE
14 years 2 months ago
2009
IEEE
Incorporating components from a number of different sources into a given application is generally considered to be a non-trivial activity. Over the years, various coordination mec...
FPL
2008
Springer
13 years 9 months ago
2008
Springer
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...