Sciweavers

566 search results - page 89 / 114
» Array Abstractions from Proofs
Sort
View
FMCO
2009
Springer
134views Formal Methods» more  FMCO 2009»
13 years 5 months ago
Verification of Context-Dependent Channel-Based Service Models
Abstract. The paradigms of service-oriented computing and modeldriven development are becoming of increasing importance in the field of software engineering. According to these par...
Natallia Kokash, Christian Krause, Erik P. de Vink
HCI
2009
13 years 5 months ago
Statistics-Based Cognitive Human-Robot Interfaces for Board Games - Let's Play!
Abstract. The archetype of many novel research activities is called cognition. Although separate definitions exist to define a technical cognitive system, it is typically character...
Frank Wallhoff, Alexander Bannat, Jürgen Gast...
IFIP
2010
Springer
13 years 2 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
POPL
2009
ACM
14 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
FOCS
2009
IEEE
14 years 2 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu