Sciweavers

386 search results - page 52 / 78
» Model Classifications and Automated Verification
Sort
View
237
Voted
POPL
2008
ACM
16 years 2 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
115
Voted
QSIC
2007
IEEE
15 years 8 months ago
Automatic Quality Assessment of SRS Text by Means of a Decision-Tree-Based Text Classifier
The success of a software project is largely dependent upon the quality of the Software Requirements Specification (SRS) document, which serves as a medium to communicate user req...
Ishrar Hussain, Olga Ormandjieva, Leila Kosseim
172
Voted
KI
2010
Springer
14 years 9 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
135
Voted
DAC
2007
ACM
16 years 3 months ago
PV-PPV: Parameter Variability Aware, Automatically Extracted, Nonlinear Time-Shifted Oscillator Macromodels
Abstract-- The PPV is a robust phase domain macromodel for oscillators. It has been proven to predict oscillators' responses correctly under small signal perturbations, and ca...
Zhichun Wang, Xiaolue Lai, Jaijeet S. Roychowdhury
113
Voted
CADE
2006
Springer
16 years 2 months ago
Solving Sparse Linear Constraints
Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dom...
Shuvendu K. Lahiri, Madanlal Musuvathi