Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
Abstract -- Software architectures enable large-scale software development. Component reuse and substitutability, two key aspects of large-scale development, must be planned for du...
Nenad Medvidovic, Peyman Oreizy, Jason E. Robbins,...
Abstract. In previous work, we described a new approach to supporting userdefined type qualifiers, which augment existing types to specify and check additional properties of intere...
Brian Chin, Shane Markstrum, Todd D. Millstein, Je...
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...