Sciweavers

913 search results - page 52 / 183
» Toward Formalizing Structured Analysis
Sort
View
DAC
2010
ACM
14 years 1 months ago
Theoretical analysis of gate level information flow tracking
Understanding the flow of information is an important aspect in computer security. There has been a recent move towards tracking information in hardware and understanding the flow...
Jason Oberg, Wei Hu, Ali Irturk, Mohit Tiwari, Tim...
IANDC
2011
127views more  IANDC 2011»
13 years 4 months ago
On the consistency, expressiveness, and precision of partial modeling formalisms
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...
Ou Wei, Arie Gurfinkel, Marsha Chechik
FM
2001
Springer
108views Formal Methods» more  FM 2001»
14 years 1 months ago
Improvements in BDD-Based Reachability Analysis of Timed Automata
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
Dirk Beyer
AAAI
2010
13 years 10 months ago
Multi-Agent Plan Recognition: Formalization and Algorithms
Multi-Agent Plan Recognition (MAPR) seeks to identify the dynamic team structures and team behaviors from the observations of the activity-sequences of a set of intelligent agents...
Bikramjit Banerjee, Landon Kraemer, Jeremy Lyle
ESOP
2007
Springer
14 years 3 months ago
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts
The goal of our research project is to establish a type-based method for verification of certain critical properties (such as deadlockand race-freedom) of operating system kernels...
Kohei Suenaga, Naoki Kobayashi