1226 search results - page 2 / 246 » Proofs, Programs and Abstract Complexity |
ESOP
2007
Springer
13 years 11 months ago
2007
Springer
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
APLAS
2006
ACM
13 years 10 months ago
2006
ACM
straction for Imperative Languages William L. Harrison Dept. of Computer Science, University of Missouri, Columbia, Missouri, USA. ty in programming language semantics derives fro...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
In recent years researchers have developed a wide range of powerful automated reasoning systems. We have leveraged these systems to build Jahob, a program specification, analysis, ...
ESOP
2004
Springer
13 years 10 months ago
2004
Springer
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...