Sciweavers

5084 search results - page 165 / 1017
» Proving Possibility Properties
Sort
View
SRDS
1996
IEEE
15 years 10 months ago
Minimizing Timestamp Size for Completely Asynchronous Optimistic Recovery with Minimal Rollback
Basing rollback recovery on optimistic message logging and replay avoids the need for synchronization between processes during failure-free execution. Some previous research has a...
Sean W. Smith, David B. Johnson
ATAL
2007
Springer
15 years 10 months ago
A grounded specification language for agent programs
This paper studies the relation between agent specification and agent programming languages. In particular, it shows that an agent programming language obeys some desirable proper...
Mehdi Dastani, M. Birna van Riemsdijk, John-Jules ...
FMCAD
2008
Springer
15 years 8 months ago
Mechanized Information Flow Analysis through Inductive Assertions
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...
FBT
2000
167views Formal Methods» more  FBT 2000»
15 years 7 months ago
Diagrams for Dataflow
The behavior of reactive systems can be described by their black box properties as a relation between input and output streams. More operational is the behavior's description...
Max Breitling, Jan Philipps
JGT
2006
60views more  JGT 2006»
15 years 6 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato