Sciweavers

367 search results - page 59 / 74
» A Rewriting Logic Sampler
Sort
View
JOT
2007
169views more  JOT 2007»
13 years 7 months ago
Translating AUML Diagrams into Maude Specifications: A Formal Verification of Agents Interaction Protocols
Agents Interaction Protocols (AIPs) play a crucial role in multi-agents systems development. They allow specifying sequences of messages between agents. Major proposed protocols s...
Farid Mokhati, Noura Boudiaf, Mourad Badri, Linda ...
CCS
2011
ACM
12 years 7 months ago
Automatically optimizing secure computation
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
Florian Kerschbaum
SIGMOD
2009
ACM
201views Database» more  SIGMOD 2009»
14 years 8 months ago
Cost based plan selection for xpath
We present a complete XPath cost-based optimization and execution framework and demonstrate its effectiveness and efficiency for a variety of queries and datasets. The framework i...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
ICCAD
2007
IEEE
102views Hardware» more  ICCAD 2007»
14 years 4 months ago
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
Chih-Chun Lee, Jie-Hong Roland Jiang, Chung-Yang H...
CORR
2010
Springer
194views Education» more  CORR 2010»
13 years 5 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...