Sciweavers

4355 search results - page 454 / 871
» From Interpretation to Compilation
Sort
View
RTA
2005
Springer
16 years 10 days ago
Automata and Logics for Unranked and Unordered Trees
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
Iovka Boneva, Jean-Marc Talbot
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
16 years 10 days ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
UML
2005
Springer
16 years 10 days ago
UML Vs. Classical Vs. Rhapsody Statecharts: Not All Models Are Created Equal
Abstract. State machines, represented by statecharts or statechart diagrams, are an important formalism for behavioural modelling. According to the research literature, the most po...
Michelle L. Crane, Jürgen Dingel
VSTTE
2005
Springer
16 years 10 days ago
WYSINWYX: What You See Is Not What You eXecute
What You See Is Not What You eXecute: computers do not execute source-code programs; they execute machine-code programs that are generated from source code. Not only can the WYSINW...
Gogul Balakrishnan, Thomas W. Reps, David Melski, ...
DIS
2004
Springer
16 years 8 days ago
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...