We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
XML is the underlying representation formalism of much web-data. Thus to reason about web-data essentially boils down to reasoning about data in XML format. In this course the stud...
MAVE (Multinet-based Answer Verification) is a system for answer validation which combines logic-based techniques and aggregation for identifying the correct answers in given sets...
We study the following problem: Given a transition system T and its quotient T/∼ under an equivalence ∼, which are the sets L, L′ of Hennessy-Milner formulae such that: if ...