Sciweavers

293 search results - page 55 / 59
» Reasoning About States of Probabilistic Sequential Programs
Sort
View
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 7 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...
CVPR
2010
IEEE
14 years 3 months ago
Efficiently Selecting Regions for Scene Understanding
Recent advances in scene understanding and related tasks have highlighted the importance of using regions to reason about high-level scene structure. Typically, the regions are ...
M. Pawan Kumar, Daphne Koller
KBSE
2003
IEEE
14 years 23 days ago
Model-based Verification of Web Service Compositions
In this paper we discuss a model-based approach to verifying web service compositions for web service implementations. This approach provides verification of properties created fr...
Howard Foster, Sebastián Uchitel, Jeff Mage...
ICSE
2000
IEEE-ACM
13 years 11 months ago
Software economics: a roadmap
The fundamental goal of all good design and engineering is to create maximal value added for any given investment. There are many dimensions in which value can be assessed, from m...
Barry W. Boehm, Kevin J. Sullivan