Sciweavers

3742 search results - page 228 / 749
» On the Use of Formal Techniques for Validation
Sort
View
JFP
2006
103views more  JFP 2006»
15 years 6 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
KR
1992
Springer
15 years 10 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
FM
2009
Springer
134views Formal Methods» more  FM 2009»
15 years 4 months ago
Partial Order Reductions Using Compositional Confluence Detection
Abstract. Explicit state methods have proven useful in verifying safetycritical systems containing concurrent processes that run asynchronously and communicate. Such methods consis...
Frédéric Lang, Radu Mateescu
PEPM
2010
ACM
16 years 3 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
FM
2003
Springer
115views Formal Methods» more  FM 2003»
15 years 11 months ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn