Sciweavers

2432 search results - page 290 / 487
» Cryptographic logical relations
Sort
View
CADE
2007
Springer
16 years 7 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
PODS
2010
ACM
205views Database» more  PODS 2010»
15 years 11 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
DAC
1994
ACM
15 years 10 months ago
Automatic Verification of Pipelined Microprocessors
Abstract - We address the problem of automatically verifying large digital designs at the logic level, against high-level specifications. In this paper, we present a methodology wh...
Vishal Bhagwati, Srinivas Devadas
FGCS
2006
68views more  FGCS 2006»
15 years 6 months ago
The first functional demonstration of optical virtual concatenation as a technique for achieving Terabit networking
The optical virtual concatenation (OVC) function of The Terabit LAN was demonstrated for the first time at the iGrid 2005 workshop in San Diego, California. The TERAbit-LAN establ...
Akira Hirano, Luc Renambot, Byungil Jeong, Jason L...
AI
2010
Springer
15 years 6 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...