Sciweavers

254 search results - page 37 / 51
» An abstract framework for reasoning about trust
Sort
View
AISC
2008
Springer
13 years 9 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
PODC
2003
ACM
14 years 17 days ago
A lattice-theoretic characterization of safety and liveness
The distinction between safety and liveness properties is due to Lamport who gave the following informal characterization. Safety properties assert that nothing bad ever happens w...
Panagiotis Manolios, Richard J. Trefler
ESAW
2009
Springer
14 years 1 months ago
Incorporating BDI Agents into Human-Agent Decision Making Research
Artificial agents, people, institutes and societies all have the ability to make decisions. Decision making as a research area therefore involves a broad spectrum of sciences, ran...
Bart Kamphorst, Arlette van Wissen, Virginia Dignu...
CAV
2006
Springer
95views Hardware» more  CAV 2006»
13 years 11 months ago
Yasm: A Software Model-Checker for Verification and Refutation
Example Guided Abstraction Refinement (CEGAR) [6] framework. A number of wellengineered software model-checkers are available, e.g., SLAM [1] and BLAST [12]. Why build another one?...
Arie Gurfinkel, Ou Wei, Marsha Chechik
POPL
2009
ACM
14 years 8 months ago
Lazy evaluation and delimited control
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
Ronald Garcia, Andrew Lumsdaine, Amr Sabry