- LSCs: Breathing Life into Message Sequence Charts W. Damm D. Harel Fri 22 February 2013
- An analyzer for message sequence charts Rajeev Alur Gerard Holzmann Doron Peled Fri 22 February 2013
- Time supervision of concurrent systems using symbolic unfoldings of time petri nets Thomas Chatain Claude Jard Fri 22 February 2013
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm S. Akshay Benedikt Bollig Paul Gastin Fri 22 February 2013
- A Logical Characterisation of Event Clock Automata Deepak D'souza Fri 22 February 2013
- Mathematical Writing Donald Knuth Tracy Larrabee Paul M. Roberts Fri 22 February 2013
- Types as abstract interpretations Patrick Cousot Thu 21 February 2013
- Temporal abstract interpretation Patrick Cousot Radhia Cousot Thu 21 February 2013
- A Kleene theorem for infinite trace languages Paul Gastin Antoine Petit Wieslaw Zielonka Thu 21 February 2013
- Deterministic asynchronous automata for infinite traces Volker Diekert Anca Muscholl Thu 21 February 2013
- On the complementation of Buchi asynchronous cellular automata Anca Muscholl Thu 21 February 2013
- Deterministic asynchronous automata for infinite traces Volker Diekert Anca Muscholl Thu 21 February 2013
- On the complementation of asynchronous cellular Btextasciitilde Achi automata Anca Muscholl Thu 21 February 2013
- Event structures Glynn Winskel Thu 21 February 2013
- An introduction to event structures Glynn Winskel Thu 21 February 2013
- Concurrent Program Schemes and Their Interpretation Antoni Mazurkiewicz Wed 20 February 2013
- Uniqueness Theorems for Periodic Functions N. J. Fine H. S. Wilf Tue 19 February 2013
- A unification algorithm for typed ^I-calculus G.P. Huet Tue 19 February 2013
- Unification of Simply Typed Lambda-Terms as Logic Programming Dale Miller Tue 19 February 2013
- Third order matching is decidable G. Dowek Tue 19 February 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
