This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
R FOR TAME ABSTRACT ELEMENTARY CLASSES RAMI GROSSBERG AND MONICA VANDIEREN We prove a categoricity transfer theorem for tame abstract elementary classes.
Tame is a new event-based system for managing concurrency in network applications. Code written with Tame abstractions does not suffer from the “stackripping” problem associat...