National HCSS Conference 2015


Visible to the public  2015 HCSS Conference
May 05, 2015 9:00 am - May 08, 2015 4:30 pm EDT

A world class community of researchers will gather in Annapolis, MD for a full week of High Confidence Software and Systems Conference activities that are structured to focus on new scientific and technological foundations that can enable entirely new generations of engineered designs that are becoming essential for effectively operating life-, safety-, security-, and mission-critical systems.


Visible to the public HCSS 2016 Poster Session

Poster sessions were held between 2:30 p.m. and 3:30 p.m. on Tuesday, May 10 and Wednesday, May 11 in the atrium of the Governor Calvert House.

An Assessment Methodology, Models For National Security Systems
Jennifer Guild
US Navy


Visible to the public The End-to-End Verifiable Internet Voting Project


Voting systems have strict security and privacy requirements, which are different from those in many other domains. They must not expose information that connects voters and their votes; moreover, to prevent voter coercion, individual voters must not themselves be able to expose information that proves how they voted. These requirements are fundamentally in tension with exposing enough information to determine that the counted votes match the cast votes, and are difficult to fulfill even in purely physical voting systems.


Visible to the public Bringing Roots of Trust to Reality


One of the key themes in the security community over the last few years has been how to create a strong root of trust, particularly in the mobile space. After all, a strong root of trust enables a wide variety of capabilities across a number of industries. Some researchers have responded to this call with various solutions across the mobile and traditional computing worlds, while other researchers have shown how we can use these technologies in various protocols and system designs.


Visible to the public CoqPIE: A Coq IDE Aimed at Improving Proof Development Productivity

Any Coq user who as attempted a non-trivial proof has found that the process is extremely tedious. The author after analyzing some of his own workflow in developing proofs identified a number of areas in which the proof development process could be improved. One key finding is that of developing a large proof (with many lemmas) often requires many iterations of revisions on the statement of the proof. Developing the proof script often reveals errors in the statement of the proof. Changing the statement then requires the proof to be replayed which is very tedious.