Sciweavers

100 search results - page 17 / 20
» Universal Designated-Verifier Signatures
Sort
View
63
Voted
CORR
2007
Springer
162views Education» more  CORR 2007»
14 years 9 months ago
Order-Invariant MSO is Stronger than Counting MSO in the Finite
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
Tobias Ganzow, Sasha Rubin
ENTCS
2007
126views more  ENTCS 2007»
14 years 9 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...
CIKM
2004
Springer
15 years 3 months ago
CiteSeer-API: towards seamless resource location and interlinking for digital libraries
We introduce CiteSeer-API, a public API to CiteSeer-like services. CiteSeer-API is SOAP/WSDL based and allows for easy programmatical access to all the specific functionalities of...
Yves Petinot, C. Lee Giles, Vivek Bhatnagar, Prade...
ISER
1995
Springer
100views Robotics» more  ISER 1995»
15 years 1 months ago
Distributed Robotic Manipulation: Experiments in Minimalism
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
Karl-Friedrich Böhringer, Russell Brown, Bruc...
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 10 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon