Sciweavers

2138 search results - page 346 / 428
» Logics for the Relational Syllogistic
Sort
View
SIGMOD
2008
ACM
95views Database» more  SIGMOD 2008»
14 years 9 months ago
Interactive generation of integrated schemas
Schema integration is the problem of creating a unified target schema based on a set of existing source schemas that relate to each other via specified correspondences. The unifie...
Laura Chiticariu, Phokion G. Kolaitis, Lucian Popa
ICFP
2005
ACM
14 years 9 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
ICFP
2004
ACM
14 years 9 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
POPL
2010
ACM
14 years 6 months ago
Counterexample-Guided Focus
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
Andreas Podelski, Thomas Wies
ICCAD
2008
IEEE
133views Hardware» more  ICCAD 2008»
14 years 6 months ago
Module locking in biochemical synthesis
—We are developing a framework for computation with biochemical reactions with a focus on synthesizing specific logical functionality, a task analogous to technology-independent...
Brian Fett, Marc D. Riedel