d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
We present a formalism for specifying component interfaces that expose component requirements on limited resources. The formalism permits an algorithmic check if two or more compon...
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Hen...
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...