Sciweavers

547 search results - page 27 / 110
» On Automated Program Construction and Verification
Sort
View
POPL
2004
ACM
15 years 10 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
SAC
2008
ACM
14 years 9 months ago
Preserving coordination properties when transforming concurrent system components
Complexity in concurrent or distributed systems can be managed by dividing component into smaller components. However, such transformations change the coordination behaviour betwe...
Gudmund Grov, Robert F. Pointon, Greg Michaelson, ...
POPL
2008
ACM
15 years 10 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
SIGSOFT
2007
ACM
15 years 10 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
SIGPLAN
2008
14 years 9 months ago
Some thoughts on teaching programming and programming languages
It is argued that the teaching of programming is central to the education of skilled computer professionals, that the teaching of programming languages is central to the teaching ...
John C. Reynolds