109 search results - page 11 / 22 » Invariants and state in testing and formal methods |
TLDI
2009
ACM
15 years 7 months ago
2009
ACM
We propose a dependent type theory that integrates programming, specifications, and reasoning about higher-order concurrent programs with shared transactional memory. The design ...
PE
2002
Springer
14 years 10 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
86
Voted
SAS
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
CICLING
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Language software applications encounter new words, e.g., acronyms, technical terminology, names or compounds of such words. In order to add new words to a lexicon, we ne...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
Encapsulation of states in object-oriented programs hinders the search for test data using evolutionary testing. As client code is oblivious to the internal state of a server obje...