Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
This paper investigates the properties of argumentation-based dialogues between agents. It takes a previously defined system by which agents can trade arguments, and examines how ...