Sciweavers

1321 search results - page 159 / 265
» Subtyping in Logical Form
Sort
View
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 10 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
DAC
2005
ACM
15 years 8 months ago
Design methodology for IC manufacturability based on regular logic-bricks
Implementing logic blocks in an integrated circuit in terms of repeating or regular geometry patterns [6,7] can provide significant advantages in terms of manufacturability and de...
V. Kheterpal, V. Rovner, T. G. Hersan, D. Motiani,...
APLAS
2010
ACM
15 years 6 months ago
Typechecking Higher-Order Security Libraries
Abstract. We propose a flexible method for verifying the security of ML programs that use cryptography and recursive data structures. Our main applications are X.509 certificate ch...
Karthikeyan Bhargavan, Cédric Fournet, Nata...
ICDE
2012
IEEE
199views Database» more  ICDE 2012»
13 years 8 months ago
Physically Independent Stream Merging
—A facility for merging equivalent data streams can support multiple capabilities in a data stream management system (DSMS), such as query-plan switching and high availability. O...
Badrish Chandramouli, David Maier, Jonathan Goldst...
CADE
2007
Springer
16 years 6 months ago
Barendregt's Variable Convention in Rule Inductions
Abstract. Inductive definitions and rule inductions are two fundamental reasoning tools in logic and computer science. When inductive definitions involve binders, then Barendregt&#...
Christian Urban, Stefan Berghofer, Michael Norrish