Sciweavers

1120 search results - page 172 / 224
» A Formal Framework for Interactive Agents
Sort
View
CSFW
2008
IEEE
15 years 4 months ago
An Authorization Logic With Explicit Time
We present an authorization logic that permits reasoning with explicit time. Following a proof-theoretic approach, we study the meta-theory of the logic, including cut elimination...
Henry DeYoung, Deepak Garg, Frank Pfenning
SYNASC
2008
IEEE
300views Algorithms» more  SYNASC 2008»
15 years 4 months ago
A Theory of Adaptable Contract-Based Service Composition
Service Oriented Architectures draw heavily on techniques for reusing and assembling off-the-shelf software components. While powerful, this programming practice is not without a ...
Giovanni Bernardi, Michele Bugliesi, Damiano Maced...
ARTS
1999
Springer
15 years 2 months ago
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and...
Annabelle McIver
BIRTHDAY
2010
Springer
14 years 11 months ago
Three Paths to Effectiveness
Over the past two decades, Gurevich and his colleagues have developed axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized t...
Udi Boker, Nachum Dershowitz
ANSOFT
1999
85views more  ANSOFT 1999»
14 years 9 months ago
Modeling Concurrent Real-Time Processes Using Discrete Events
We give a formal framework for studying real-time discrete-event systems. It describes concurrent processes as sets of possible behaviors. Compositions of processes are processes ...
Edward A. Lee