Sciweavers

3552 search results - page 240 / 711
» Proof theory in the abstract
Sort
View
COMBINATORICS
1998
130views more  COMBINATORICS 1998»
15 years 6 months ago
Codes and Projective Multisets
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the BrouwerVan Eupen construction that t...
Stefan M. Dodunekov, Juriaan Simonis
JOLLI
2002
92views more  JOLLI 2002»
15 years 6 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
Ani Nenkova
FM
2008
Springer
77views Formal Methods» more  FM 2008»
15 years 8 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
TVLSI
2008
124views more  TVLSI 2008»
15 years 6 months ago
A Refinement-Based Compositional Reasoning Framework for Pipelined Machine Verification
Abstract--We present a refinement-based compositional framework for showing that pipelined machines satisfy the same safety and liveness properties as their non-pipelined specifica...
Panagiotis Manolios, Sudarshan K. Srinivasan
JSC
2002
84views more  JSC 2002»
15 years 6 months ago
A Constructive Algebraic Hierarchy in Coq
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan ...