4340 search results - page 499 / 868 » Formal Methods and Cryptography |
192
Voted
CAV
2005
Springer
16 years 8 days ago
2005
Springer
Automaton-based static program analysis has proved to be an effective tool for bug finding. Current tools generally re-analyze a program from scratch in response to a change in t...
183
click to vote
CAV
2005
Springer
16 years 8 days ago
2005
Springer
Recent work on weighted-pushdown systems shows how to generalize interprocedural-dataflow analysis to answer “stack-qualified queries”, which answer the question “what data...
196
click to vote
FMCO
2005
Springer
16 years 8 days ago
2005
Springer
Control of modular and distributed discrete-event systems appears as an approach to handle computational complexity of synthesizing supervisory controllers for large scale systems....
169
click to vote
FORMATS
2005
Springer
16 years 7 days ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...
156
click to vote
IFIP
2005
Springer
16 years 7 days ago
2005
Springer
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...