Sciweavers

3307 search results - page 371 / 662
» The meaning of concurrent programs
Sort
View
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
16 years 1 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko
ML
2006
ACM
113views Machine Learning» more  ML 2006»
16 years 24 days ago
A separate compilation extension to standard ML
We present an extension to Standard ML, called SMLSC, to support separate compilation. The system gives meaning to individual program fragments, called units. Units may depend on ...
David Swasey, Tom Murphy VII, Karl Crary, Robert H...
PLDI
2004
ACM
16 years 8 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
SIGSOFT
2004
ACM
16 years 8 days ago
Verifying aspect advice modularly
Aspect-oriented programming has become an increasingly important means of expressing cross-cutting program abstractions. Despite this, aspects lack support for computeraided veriï...
Shriram Krishnamurthi, Kathi Fisler, Michael Green...
LCPC
1995
Springer
15 years 10 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...