Sciweavers

845 search results - page 149 / 169
» A Formal Model of the Software Test Process
Sort
View
FASE
2011
Springer
13 years 24 days ago
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
Probabilistic verification techniques have been applied to the formal modelling and analysis of a wide range of systems, from communication protocols such as Bluetooth, to nanosca...
Lu Feng, Marta Z. Kwiatkowska, David Parker
POPL
2010
ACM
14 years 6 months ago
Toward a Verified Relational Database Management System
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...
KI
2002
Springer
13 years 9 months ago
Advantages, Opportunities and Limits of Empirical Evaluations: Evaluating Adaptive Systems
While empirical evaluations are a common research method in some areas of Artificial Intelligence (AI), others still neglect this approach. This article outlines both the opportun...
Stephan Weibelzahl, Gerhard Weber
HASKELL
2009
ACM
14 years 3 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...
IANDC
2011
129views more  IANDC 2011»
13 years 4 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher