Sciweavers

661 search results - page 62 / 133
» What Can We Expect from Program Verification
Sort
View
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
AMAST
2008
Springer
13 years 10 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
KBSE
2002
IEEE
14 years 1 months ago
Generating Product-Lines of Product-Families
GenVoca is a methodology and technology for generating product-lines, i.e. building variants of a program. The primitive components from which applications are constructed are ref...
Don S. Batory, Roberto E. Lopez-Herrejon, Jean-Phi...
ASE
2005
91views more  ASE 2005»
13 years 8 months ago
Deviation Analysis: A New Use of Model Checking
Inaccuracies, or deviations, in the measurements of monitored variables in a control system are facts of life that control software must accommodate. Deviation analysis can be used...
Mats Per Erik Heimdahl, Yunja Choi, Michael W. Wha...
IFIP
2005
Springer
14 years 2 months ago
Relative Trustworthiness
We present a method for trust scenarios with more than one trustee, where sets of trustees are ordered in a relation of relative trustworthiness. We show how a priority structure i...
Johan W. Klüwer, Arild Waaler