Sciweavers

1712 search results - page 3 / 343
» A Computational Approach to Binding Theory
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
13 years 6 months ago
Nominal Reasoning Techniques in Coq: (Extended Abstract)
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
Brian E. Aydemir, Aaron Bohannon, Stephanie Weiric...
ICNP
2006
IEEE
14 years 5 days ago
Vault: A Secure Binding Service
— Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain Name System (DNS)) maps certain information, namely, bi...
Guor-Huar Lu, Changho Choi, Zhi-Li Zhang
CODES
2010
IEEE
13 years 4 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...
FAC
2002
79views more  FAC 2002»
13 years 5 months ago
A New Approach to Abstract Syntax with Variable Binding
proach to Abstract Syntax with Variable Binding1 Murdoch J. Gabbay and Andrew M. Pitts Cambridge University Computer Laboratory, Cambridge, UK
Murdoch Gabbay, Andrew M. Pitts
PERCOM
2006
ACM
14 years 5 months ago
Composition Trust Bindings in Pervasive Computing Service Composition
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition t...
John Buford, Rakesh Kumar, Greg Perkins