Sciweavers

597 search results - page 74 / 120
» Formal Techniques for Java-Like Programs
Sort
View
ESOP
2004
Springer
14 years 1 months ago
Resources, Concurrency, and Local Reasoning (Abstract)
t) Peter W. O’Hearn Queen Mary, University of London In the 1960s Dijkstra suggested that, in order to limit the complexity of potential process interactions, concurrent programs...
Peter W. O'Hearn
POPL
2005
ACM
14 years 8 months ago
A simple typed intermediate language for object-oriented languages
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
Juan Chen, David Tarditi
CAV
2007
Springer
173views Hardware» more  CAV 2007»
14 years 1 months ago
Array Abstractions from Proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Ranjit Jhala, Kenneth L. McMillan
AUSDM
2008
Springer
229views Data Mining» more  AUSDM 2008»
13 years 9 months ago
Minors as Miners - Modelling and Evaluating Ontological and Linguistic Learning
Growing up is in large measure learning about the world and our social and linguistic environment. We might call this data mining, although it is far more multimodal and immersive...
David M. W. Powers
SYNASC
2008
IEEE
300views Algorithms» more  SYNASC 2008»
14 years 2 months ago
A Theory of Adaptable Contract-Based Service Composition
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...