Sciweavers

3658 search results - page 682 / 732
» The logic of proofs, semantically
Sort
View
PLDI
2004
ACM
14 years 1 months ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
CCS
2004
ACM
14 years 1 months ago
Verifying policy-based security for web services
WS-SecurityPolicy is a declarative configuration language for driving web services security mechanisms. We describe a formal sefor WS-SecurityPolicy, and propose a more abstract ...
Karthikeyan Bhargavan, Cédric Fournet, Andr...
EKAW
2004
Springer
14 years 1 months ago
Graph-Based Acquisition of Expressive Knowledge
Capturing and exploiting knowledge is at the heart of several important problems such as decision making, the semantic web, and intelligent agents. The captured knowledge must be a...
Vinay K. Chaudhri, Kenneth S. Murray, John Pacheco...
IFIP
2004
Springer
14 years 1 months ago
Static program transformations for efficient software model checking
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
Shobha Vasudevan, Jacob A. Abraham
JELIA
2004
Springer
14 years 1 months ago
Hierarchical Decision Making by Autonomous Agents
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir