Sciweavers

198 search results - page 28 / 40
» Lightweight reasoning about program correctness
Sort
View
SIGSOFT
2004
ACM
14 years 10 months ago
Efficient incremental algorithms for dynamic detection of likely invariants
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
Jeff H. Perkins, Michael D. Ernst
POPL
2005
ACM
14 years 10 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
ERSHOV
2009
Springer
14 years 4 months ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...
ESOP
2010
Springer
14 years 4 months ago
A Universal Calculus for Stream Processing Languages
Stream processing applications such as algorithmic trading, MPEG processing, and web content analysis are ubiquitous and essential to business and entertainment. Language designers...
Robert Soulé, Martin Hirzel, Robert Grimm, ...
POPL
2006
ACM
14 years 10 months ago
Verifying properties of well-founded linked lists
We describe a novel method for verifying programs that manipulate linked lists, based on two new predicates that characterize reachability of heap cells. These predicates allow re...
Shuvendu K. Lahiri, Shaz Qadeer