Sciweavers

360 search results - page 52 / 72
» Explanations and Proof Trees
Sort
View
JUCS
2006
104views more  JUCS 2006»
15 years 4 months ago
Introducing the ITP Tool: a Tutorial
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Manuel Clavel, Miguel Palomino, Adrián Ries...
DCC
2007
IEEE
16 years 4 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
15 years 11 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
CALCO
2009
Springer
176views Mathematics» more  CALCO 2009»
15 years 11 months ago
Complementation of Coalgebra Automata
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
Christian Kissig, Yde Venema
LOPSTR
2009
Springer
15 years 11 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...