Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Program schemes, arrays, Lindström quantifiers and zero-one laws
Theoretical Computer Science
The evaluation of first-order substitution is monadic second-order compatible
Theoretical Computer Science
Generating Model Checkers from Algebraic Specifications
Formal Methods in System Design
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Transfinite Rewriting Semantics for Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Cooperation of Formal Methods in an Engineering Based Software Development Process
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Predicting operational behaviour of abstract programs during formal developments
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The conflict-free reduction geometry
Theoretical Computer Science
A context-free superset approximation of unification-based grammars
New developments in parsing technology
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Totally correct logic program transformations via well-founded annotations
Higher-Order and Symbolic Computation
Cones and foci for protocol verification revisited
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
The modular decomposition of countable graphs: constructions in monadic second-order logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Decidability of DPDA Language Equivalence via First-Order Grammars
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Simple models for recursive schemes
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Infinite Unfolding and Transformations of Nondeterministic Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
The ζ-Semantics: A Comprehensive Semantics for Functional Programs
Fundamenta Informaticae
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
Hi-index | 0.00 |