Using the HOL theorem prover, we proved the correctness of a translation from a subset of Accellera’s property specification language PSL to linear temporal logic LTL. Moreover,...
This paper describes a sound technique that combines the precision em proving with the loop-invariant inference of abstract interpretation. The loop-invariant computations are invo...
Ensuring that specifications are consistent is an important part of specification development and testing. In this paper we introduce the ConsVISor tool for consistency checking o...
Kenneth Baclawski, Mieczyslaw M. Kokar, Jeffrey E....
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
-Preserving Atomicity Abstraction Alexey Gotsman1 and Hongseok Yang2 1 IMDEA Software Institute 2 University of Oxford Modern concurrent algorithms are usually encapsulated in libr...