Sciweavers

WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 5 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
WABI
2005
Springer
14 years 5 months ago
Computing the Quartet Distance Between Trees of Arbitrary Degree
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
Chris Christiansen, Thomas Mailund, Christian N. S...
VLDB
2005
ACM
112views Database» more  VLDB 2005»
14 years 5 months ago
REED: Robust, Efficient Filtering and Event Detection in Sensor Networks
This paper presents a set of algorithms for efficiently evaluating join queries over static data tables in sensor networks. We describe and evaluate three algorithms that take adv...
Daniel J. Abadi, Samuel Madden, Wolfgang Lindner
TACAS
2005
Springer
158views Algorithms» more  TACAS 2005»
14 years 5 months ago
Symstra: A Framework for Generating Object-Oriented Unit Tests Using Symbolic Execution
Object-oriented unit tests consist of sequences of method invocations. Behavior of an invocation depends on the method’s arguments and the state of the receiver at the beginning ...
Tao Xie, Darko Marinov, Wolfram Schulte, David Not...
TACAS
2005
Springer
105views Algorithms» more  TACAS 2005»
14 years 5 months ago
Using Language Inference to Verify Omega-Regular Properties
Abhay Vardhan, Koushik Sen, Mahesh Viswanathan, Gu...
TACAS
2005
Springer
95views Algorithms» more  TACAS 2005»
14 years 5 months ago
jMoped: A Java Bytecode Checker Based on Moped
We present a tool for finding errors in Java programs that translates Java bytecodes into symbolic pushdown systems, which are then checked by the Moped tool [1].
Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier E...
TACAS
2005
Springer
88views Algorithms» more  TACAS 2005»
14 years 5 months ago
Shortest Counterexamples for Symbolic Model Checking of LTL with Past
Shorter counterexamples are typically easier to understand. The length of a counterexample, as reported by a model checker, depends on both the algorithm used for state space explo...
Viktor Schuppan, Armin Biere
TACAS
2005
Springer
155views Algorithms» more  TACAS 2005»
14 years 5 months ago
Context-Bounded Model Checking of Concurrent Software
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...
Shaz Qadeer, Jakob Rehof
TACAS
2005
Springer
78views Algorithms» more  TACAS 2005»
14 years 5 months ago
Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
Fair discrete systems (FDSs) are a computational model of concurrent programs where fairness assumptions are specified in terms of sets of states. The analysis of fair discrete sy...
Amir Pnueli, Andreas Podelski, Andrey Rybalchenko
TACAS
2005
Springer
113views Algorithms» more  TACAS 2005»
14 years 5 months ago
Applications of Craig Interpolants in Model Checking
Abstract. A Craig interpolant for a mutually inconsistent pair of formulas (A, B) is a formula that is (1) implied by A, (2) inconsistent with B, and (3) expressed over the common ...
Kenneth L. McMillan