Sciweavers

1422 search results - page 105 / 285
» Complementation in Abstract Interpretation
Sort
View
FM
2008
Springer
77views Formal Methods» more  FM 2008»
15 years 6 months ago
A Rigorous Approach to Networking: TCP, from Implementation to Protocol to Service
Abstract. Despite more then 30 years of research on protocol specification, the major protocols deployed in the Internet, such as TCP, are described only in informal prose RFCs and...
Tom Ridge, Michael Norrish, Peter Sewell
FOIS
2001
15 years 5 months ago
Type-syntax and token-syntax in diagrammatic systems
The uptake in the software industry of notations for designing systems visually has been accelerated with the standardization of the Unified Modeling Language (UML). The formaliza...
John Howse, Fernando Molina, John Taylor, Sun-Joo ...
COMBINATORICS
2000
96views more  COMBINATORICS 2000»
15 years 4 months ago
Automorphisms and Enumeration of Switching Classes of Tournaments
Two tournaments T1 and T2 on the same vertex set X are said to be switching equivalent if X has a subset Y such that T2 arises from T1 by switching all arcs between Y and its comp...
László Babai, Peter J. Cameron
ICFP
2006
ACM
16 years 4 months ago
Towards an automatic complexity analysis for generic programs
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
Kyle D. Ross
IFL
2004
Springer
138views Formal Methods» more  IFL 2004»
15 years 9 months ago
A Rational Deconstruction of Landin's SECD Machine
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
Olivier Danvy