Sciweavers

105 search results - page 8 / 21
» On the formal points of the formal topology of the binary tr...
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
13 years 12 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
WABI
2004
Springer
14 years 25 days ago
Reconstructing Ancestral Gene Orders Using Conserved Intervals
Conserved intervals were recently introduced as a measure of similarity between genomes whose genes have been shuffled during evolution by genomic rearrangements. Phylogenetic reco...
Anne Bergeron, Mathieu Blanchette, Annie Chateau, ...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 1 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...
APAL
2010
141views more  APAL 2010»
13 years 7 months ago
Locatedness and overt sublocales
Locatedness is one of the fundamental notions in constructive mathematics. The existence of a positivity predicate on a locale, i.e. the locale being overt, or open, has proved to ...
Bas Spitters
TARK
1992
Springer
13 years 11 months ago
Topological Reasoning and The Logic of Knowledge
We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logi...
Lawrence S. Moss, Rohit Parikh