Journal of the ACM (JACM)
Toward a complete transformational toolkit for compilers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Abstract computability and algebraic specification
ACM Transactions on Computational Logic (TOCL)
The Functions Provable by First Order Abstraction
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Towards an Algebraic Specification of the Java Virtual Machine
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Hierarchies of Spatially Extended Systems and Synchronous Concurrent Algorithms
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Presentations for Abstract Context Institutions
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Equivariant Syntax and Semantics
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Universal Algebra in Type Theory
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Axiomatization of Finite Algebras
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Formalising Ontologies and Their Relations
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Verifying a Simple Pipelined Microprocessor Using Maude
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
Modal operators and the formal dual of Birkhoff's completeness theorem
Mathematical Structures in Computer Science
On the relationship between compact regularity and Gentzen's cut rule
Theoretical Computer Science - Logic, semantics and theory of programming
The rational numbers as an abstract data type
Journal of the ACM (JACM)
A logical approach to stable domains
Theoretical Computer Science
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
Electronic Notes in Theoretical Computer Science (ENTCS)
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Symbolic protocol analysis for monoidal equational theories
Information and Computation
Meadows and the equational specification of division
Theoretical Computer Science
Rough Set Algebras as Description Domains
Fundamenta Informaticae
Vivid: A framework for heterogeneous problem solving
Artificial Intelligence
Refinement by Interpretation in a General Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate and Relation Lifting for Parametric Algebraic Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving state-based implementations of interactive components with history abstractions
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
A unifying approach to recursive and co-recursive definitions
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
On equality predicates in algebraic specification languages
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Fields, meadows and abstract data types
Pillars of computer science
CGE: a sequential learning algorithm for mealy automata
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Incremental learning-based testing for reactive systems
TAP'11 Proceedings of the 5th international conference on Tests and proofs
Learning-based testing for reactive systems using term rewriting technology
ICTSS'11 Proceedings of the 23rd IFIP WG 6.1 international conference on Testing software and systems
Elementary algebraic specifications of the rational function field
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Primitive recursive selection functions over abstract algebras
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Rough Set Algebras as Description Domains
Fundamenta Informaticae
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
Multi Lingual Sequent Calculus and Coherent Spaces
Fundamenta Informaticae
CARTESIAN STREAM TRANSFORMER COMPOSITION
Fundamenta Informaticae
A timed mobility semantics based on rewriting strategies
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
An incremental learning algorithm for extended mealy automata
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
Algebraic Specifications of Computing as a Service with Applications to Cost Analysis
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
An incremental verification framework for component-based software systems
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
A Coalgebraic Perspective on Logical Interpretations
Studia Logica
A Process Calculus with Finitary Comprehended Terms
Theory of Computing Systems
| Hi-index | 0.00 |