Sciweavers

738 search results - page 137 / 148
» Formal Methods: for All or for Chosen
Sort
View
TSE
2008
107views more  TSE 2008»
13 years 6 months ago
Interface Grammars for Modular Software Model Checking
We propose an interface specification language based on grammars for modular software model checking. In our interface specification language, component interfaces are specified a...
Graham Hughes, Tevfik Bultan
CBSE
2011
Springer
12 years 6 months ago
Towards incremental component compatibility testing
Software components are increasingly assembled from other components. Each component may further depend on others, and each may have multiple active versions. The total number of ...
Il-Chul Yoon, Alan Sussman, Atif M. Memon, Adam A....
PLDI
2012
ACM
11 years 9 months ago
Design and implementation of sparse global analyses for C-like languages
In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques...
Hakjoo Oh, Kihong Heo, Wonchan Lee, Woosuk Lee, Kw...
IJCAI
1989
13 years 7 months ago
A Theorem Prover for Prioritized Circumscription
In a recent paper, Ginsberg shows how a backward-chaining ATMS can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized cir...
Andrew B. Baker, Matthew L. Ginsberg
ECCV
2004
Springer
14 years 8 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...