Sciweavers

1912 search results - page 288 / 383
» On the evaluation of argumentation formalisms
Sort
View
ICFP
2002
ACM
16 years 6 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy
ICFP
2001
ACM
16 years 6 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
MOBIHOC
2008
ACM
16 years 6 months ago
Self-monitoring for sensor networks
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
Dezun Dong, Yunhao Liu, Xiangke Liao
ESOP
2010
Springer
16 years 3 months ago
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
Keiko Nakata and Tarmo Uustalu
ICWS
2009
IEEE
16 years 3 months ago
Integrating Behavioral Trust in Web Service Compositions
Algorithms for composing Web services (WS) traditionally utilize the functional and quality-of-service parameters of candidate services to decide which services to include in the ...
Sharon Paradesi, Prashant Doshi, Sonu Swaika