Sciweavers

66 search results - page 4 / 14
» Bounded Model Construction for Monadic Second-Order Logics
Sort
View
CONCUR
2004
Springer
14 years 1 months ago
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
Paolo Baldan, Andrea Corradini, Barbara König
FSTTCS
2009
Springer
14 years 3 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 8 months ago
Interactive learning of node selecting tree transducer
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
Julien Carme, Rémi Gilleron, Aurélie...
KBSE
1995
IEEE
14 years 2 days ago
Towards an Epistemology for Software Representations
The KBSE community is actively engaged in finding ways to represent software and the activities that relate to various stages in its lifecycle. While the wealth of modeling activ...
Christopher A. Welty
CONCUR
2006
Springer
13 years 10 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink