Sciweavers

502 search results - page 30 / 101
» Verifying Balanced Trees
Sort
View
ICSE
2007
IEEE-ACM
14 years 11 months ago
DECIMAL and PLFaultCAT: From Product-Line Requirements to Product-Line Member Software Fault Trees
PLFaultCAT is a tool for software fault tree analysis (SFTA) during product-line engineering. When linked with DECIMAL, a product-line requirements verification tool, the enhanced...
Josh Dehlinger, Meredith Humphrey, Lada Suvorov, P...
ENTCS
2007
81views more  ENTCS 2007»
13 years 11 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan
TALG
2008
69views more  TALG 2008»
13 years 11 months ago
Testing Euclidean minimum spanning trees in the plane
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
Artur Czumaj, Christian Sohler
COCOON
2003
Springer
14 years 4 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...
LOPSTR
2009
Springer
14 years 5 months ago
Deciding Full Branching Time Logic by Program Transformation
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...