62 search results - page 4 / 13 » Model Transformations in Decidability Proofs for Monadic The... |
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
STACS
2001
Springer
14 years 4 days ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
DBPL
1999
Springer
14 years 3 hour ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...