Sciweavers

4224 search results - page 101 / 845
» Reasoning about Choice
Sort
View
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 5 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
SOCO
2010
Springer
15 years 3 months ago
Managing Variability in Workflow with Feature Model Composition Operators
Abstract. In grid-based scientific applications, building a workflow essentially involves composing parameterized services describing families of services and then configuring the ...
Mathieu Acher, Philippe Collet, Philippe Lahire, R...
141
Voted
UTP
2010
15 years 3 months ago
Unifying Theories of Confidentiality
Abstract. This paper presents a framework for reasoning about the security of confidential data within software systems. A novelty is that we use Hoare and He's Unifying Theor...
Michael J. Banks, Jeremy L. Jacob
SP
2010
IEEE
182views Security Privacy» more  SP 2010»
15 years 9 months ago
All You Ever Wanted to Know about Dynamic Taint Analysis and Forward Symbolic Execution (but Might Have Been Afraid to Ask)
—Dynamic taint analysis and forward symbolic execution are quickly becoming staple techniques in security analyses. Example applications of dynamic taint analysis and forward sym...
Edward J. Schwartz, Thanassis Avgerinos, David Bru...
AIPS
2000
15 years 6 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...