442 search results - page 67 / 89 » Proof Abstraction for Imperative Languages |
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
POPL
2003
ACM
14 years 9 months ago
2003
ACM
We introduce a new framework of algebraic pure type systems in which we consider rewrite rules as lambda terms with patterns and rewrite rule application as abstraction applicatio...
IFL
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper considers the use of dependent types to capture information about dynamic resource usage in a static type system. Dependent types allow us to give (explicit) p...
POPL
2008
ACM
14 years 9 months ago
2008
ACM
alyses are concerned with precise abstractions of the heap to capture detailed structural properties. To do so, they need to build and decompose summaries of disjoint memory regio...
KBSE
2000
IEEE
14 years 6 days ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...