Sciweavers

1054 search results - page 127 / 211
» A Formalization of the Turing Test
Sort
View
SACMAT
2010
ACM
15 years 11 months ago
Monitoring security policies with metric first-order temporal logic
We show the practical feasibility of monitoring complex security properties using a runtime monitoring approach for metric first-order temporal logic. In particular, we show how ...
David A. Basin, Felix Klaedtke, Samuel Müller
RE
1999
Springer
15 years 10 months ago
Bridging the Gap Between Past and Future in RE: A Scenario-Based Approach
Requirements Engineering (RE) investigates the impact of a future-oriented change vision, but the move towards this vision must consider a context heavily shaped by the past. As R...
Peter Haumer, Matthias Jarke, Klaus Pohl, Patrick ...
FMCAD
2004
Springer
15 years 10 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
FM
2006
Springer
161views Formal Methods» more  FM 2006»
15 years 10 months ago
Changing Programs Correctly: Refactoring with Specifications
Refactorings change the internal structure of code without changing its external behavior. For non-trivial refactorings, the preservation of external behavior depends on semantic p...
Fabian Bannwart, Peter Müller
FORMATS
2008
Springer
15 years 8 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...