By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
We implement the extension of the logical consequence relation to a partial order ā¤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deļ...
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
Program analysis and veriļ¬cation tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...