Sciweavers

Share
FOCM
2011
80views more  FOCM 2011»
8 years 10 months ago
The Serendipity Family of Finite Elements
Douglas N. Arnold, Gerard Awanou
FOCM
2011
107views more  FOCM 2011»
8 years 10 months ago
Quantifying Transversality by Measuring the Robustness of Intersections
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbatio...
Herbert Edelsbrunner, Dmitriy Morozov, Amit K. Pat...
FMSD
2011
236views Formal Methods» more  FMSD 2011»
8 years 10 months ago
Automatic analysis of DMA races using model checking and k-induction
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
FM
2011
Springer
357views Formal Methods» more  FM 2011»
8 years 10 months ago
TraceContract: A Scala DSL for Trace Analysis
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
Howard Barringer, Klaus Havelund
NFM
2011
335views Formal Methods» more  NFM 2011»
9 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
NFM
2011
303views Formal Methods» more  NFM 2011»
9 years 1 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
SBMF
2010
Springer
149views Formal Methods» more  SBMF 2010»
9 years 1 months ago
Reasoning about Assignments in Recursive Data Structures
This paper presents a framework to reason about the eects of assignments in recursive data structures. We dene an operational semantics for a core language based on Meyer's id...
Alejandro Tamalet, Ken Madlener
SBMF
2010
Springer
164views Formal Methods» more  SBMF 2010»
9 years 1 months ago
A Decision Procedure for Bisimilarity of Generalized Regular Expressions
A notion of generalized regular expressions for a large class of systems modeled as coalgebras, and an analogue of Kleene's theorem and Kleene algebra, were recently proposed ...
Marcello M. Bonsangue, Georgiana Caltais, Eugen-Io...
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
9 years 1 months ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson
SBMF
2010
Springer
129views Formal Methods» more  SBMF 2010»
9 years 1 months ago
Directed Model Checking for B: An Evaluation and New Techniques
ProB is a model checker for high-level formalisms such as B, Event-B, CSP and Z. ProB uses a mixed depth-first/breadth-first search strategy, and in previous work we have argued th...
Michael Leuschel, Jens Bendisposto
books