Sciweavers

617 search results - page 69 / 124
» Using Formal Methods in a Retrospective Safety Case
Sort
View
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
13 years 7 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
PPDP
2005
Springer
14 years 1 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
FORTE
2011
12 years 11 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
CVPR
2009
IEEE
15 years 2 months ago
Pedestrian Detection: A Benchmark
Pedestrian detection is a key problem in computer vision, with several applications including robotics, surveillance and automotive safety. Much of the progress of the past few ...
Bernt Schiele, Christian Wojek, Pietro Perona, Pio...
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
13 years 6 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers