- PRESIDNCIA DA REPBLICA CONTROLADORIA-GERAL DA UNIO
- SUBSEXPL: A tool for Simulating and Comparing Explicit Substitutions Calculi
- Describility Matsushigue
- UNIVERSIDADE DE BRASLIA RELATRIO DE
- Aplicao de Arquiteturas Reconfigurveis para Algoritmos de
- UnB/Universidade de Braslia Relatrio de Gesto
- VIII Seminrio Informal(, mas Formal!) do Grupo de Teoria da Computao da UnB -GTC/UnB
- Uni cation Modulo Presburger Arithmetic and Other Decidable Theories
- Geometrical Specification using Dependent Types in PVS Mauricio AyalaRinc on # , Valnei A. Fernandes and Andr e L. Galdino
- Modeling a Reconfigurable System for Computing the FFT in Place via RewritingLogic #
- Second and ThirdOrder Matching via Explicit Substitutions
- Electronic Notes in Theoretical Computer Science 70 No. 6 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages
- Kamareddine Heriot-Watt
- Intersection Synchronous Logic Elaine Gouv^ea Pimentel
- Normal Forms for Modal Logics Claudia Nalon
- A Formalization of the Theorem of Existence of First-Order Most General Unifiers
- Models and Abstraction Validation and Formal Analysis
- Reconfigurable Systems for Sequence Alignment and for General Dynamic Programming
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
- Explicit Substitutions Calculi with Explicit Eta rules which Preserve Subject Reduction #
- SUBSEXPL: A Framework for Simulating and Comparing Explicit Substitutions Calculi
- Verification of Rewrite Based Specifications using Proof Thomas Mailleux Sant'Ana 1# and Mauricio AyalaRinc on 1
- Comparing Calculi of Explicit Substitutions with Eta-reduction Mauricio Ayala-Rinc on ?1 , Flavio L. C. de Moura ??1 , and Fairouz Kamareddine 2
- Unidade rea Objetivo Meta Global Meta Anual Execuo AEF Pesquisa O2/ D1
- Universidade de Braslia Relatrio Anual de Gesto
- Animation of Relations between Computational Models and Their Language Representations
- An Efficient Strategy for WordCycle Completion in Finitely Presented Groups Luiz M. R. Gadelha Jr
- The Prover for Synchronous Systems with No Learning
- Comparing and Implementing Calculi of Explicit Substitutions with Eta-Reduction ?
- Soft Time and Soft Space Soft Linear Logic and Polynomial-bound Complexity
- Simply-Typed Ayala-Rinc on
- Visualizing Execution Histories on Release Consistency and Scope Consistency Memory Models
- Dpartement d'Informatique
- Electronic Notes in Theoretical Computer Science 67 (2002) URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
- Defining Uniform and Hybrid Memory Consistency Models on a Unified Framework
- SUBSEXPL: A tool for Simulating and Comparing Explicit Substitutions Calculi
- SUBSEXPL: A Tool for Simulating and Comparing Explicit Substitutions Calculi
- Geometrical Specification using Dependent Types in PVS Mauricio Ayala-Rincon
- Formalization of Security Proofs Using PVS in the Dolev-Yao Model
- Intersection Type System with de Bruijn Indices Daniel Lima Ventura1
- A Theory for Abstract Reduction Systems in PVS Andre Luiz Galdino
- Principal Typings for Explicit Substitutions Calculi Daniel Lima Ventura , Mauricio Ayala-Rincon , and Fairouz Kamareddine2
- Explicit Substitutions Calculi with Explicit Eta rules which Preserve Subject Reduction
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi1
- Second-Order Matching via Explicit Substitutions
- Modeling a Reconfigurable System for Computing the FFT in Place via Rewriting-Logic
- The Correctness of the AKS Primality Test in Coq Flavio L. C. de Moura1
- SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi1
- VII Seminrio Informal(, mas Formal!) do Grupo de Teoria da Computao da UnB -GTC/UnB
- Tipos e Provas Matematicas Mauricio Ayala-Rincon
- Rewriting, Explicit Substitutions and Normalisation XXXVI Escola de Ver~ao do MAT
- Rewriting, Explicit Substitutions and Normalisation XXXVI Escola de Ver~ao do MAT
- Rewriting, Explicit Substitutions and Normalisation XXXVI Escola de Ver~ao do MAT
- Verificac ~ao de Sistemas de Tempo Real com Aut^omatos Temporizados: Teoria e Pratica
- MathLang, a framework for computerising mathematics
- Explaining Concepts in Compositional Type-Based Program
- Anlise Formal de SistemasUma abordagem orientada a linguagem
- Motivac~ao O -Calculus
- Language-oriented Software Development and Rewriting Logic
- Introduction Explicit Substitutions
- Tipando Calculos de Substituic~oes Explicitas Mauricio Ayala-Rincon
- C. Nalon Seminrio Informal (,mas formal) UnB/IE/MAT 29/10/04 -slide #1 Prova Automtica de Teoremas para Lgicas
- PRESIDNCIA DA REPBLICA CONTROLADORIA-GERAL DA UNIO
- PRESIDNCIA DA REPBLICA CONTROLADORIA-GERAL DA UNIO
- Relatrio de Gesto Universidade de Braslia
- TRIBUNAL DE CONTAS DA UNIO Pgina: 1 SISAC -SISTEMA DE APRECIAO E REGISTRO DE ATOS DE ADMISSO E CONCESSES Data/Hora: 28/03/2008 16:15:52
- PRESIDNCIA DA REPBLICA CONTROLADORIA-GERAL DA UNIO
- Relatrio Detalhado do Planejamento do Planejamento Anual em 2006, por rea Objetivo 1: Desenvolvimento do Ensino
- Relatrio de Gesto 2003UnB/Universidade de Braslia UnB: Relatrio Detalhado do Planejamento Anual em 200315
- UnB/Universidade de Braslia Relatrio de Gesto 2004 ANEXO 1 Demonstrativo dos recursos de convnios e outros crditos
- UnB/Universidade de Braslia Relatrio de Gesto 2004 ANEXO 4 UnB: Relatrio Detalhado do Planejamento Anual em 2004, por
- UnB/Universidade de Braslia Relatrio de Gesto
- Comisso de Gerenciamento, Tratamento e Destinao de
- Principal Typings for Explicit Substitutions Daniel Lima Ventura1
- Intersection Type System with de Bruijn Indices Daniel Lima Ventura1
- Computerising Mathematical Texts with A project started in 1999
- Modal Expressiveness of Graph Mario Benevides
- Sequent Calculus for `Generally' Leonardo B. Vana
- Introduction Maude MSOS Tool
- Interval Valued R-Implications and Automorphisms
- Second-and Third-Order Matching via Explicit Substitutions
- Seminario Informal (mas Formal!) 2006 Estrategias da Teoria de Reescrita em PVS
- ISSN 1980-3397 Universidade de Braslia UnB
- Relatrio Detalhado do Planejamento do Planejamento Anual em 2006, por Unidade Assessoria de Comunicao Social
- A Modification of the Landau-Vishkin Algorithm Computing Longest Common
- Introduction Unification Tree Notation
- Ordenao por Block-Interchanges e Reverses com Sinais
- RESOLUTION FOR SYNCHRONY AND NO LEARNING C. NALON, C. DIXON, AND M. FISHER
- PRESIDNCIA DA REPBLICA CONTROLADORIA-GERAL DA UNIO
- Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting.
- SUBSEXPL: A Framework for Simulating and Comparing Explicit Substitutions Calculi
- Universidade Departamento
- Third-Order Matching via Explicit Substitutions Flavio L. C. de Moura 1
- Verification of Newman's and Yokouchi's Lemmas in PVS Andre Luiz Galdino1,2
- Principal Typings for Explicit Substitutions Daniel Lima Ventura1
- The Problem History DPLL Resolution WatchLit Conclusion SAT Solvers
- RELATRIO DE AUDITORIA ANUAL DE CONTAS N 243896 -2 PARTE
- Motivation -Bohm Trees From Matching to Interpolation Problems Conclusions and Future Work Third-Order Matching via Explicit
- Real Number Calculations and
- Designing Arithmetic Digital Circuits via RewritingLogic # Mauricio AyalaRincon + Reiner W. Hartenstein # Ricardo P. Jacobi
- rea Unidade Objetivo Meta Global Meta Anual Execuo Ensino de Graduao O1/ D1 DEG
- Efficient Computation of Algebraic Operations over Dynamically Reconfigurable Systems Specified by Rewriting-Logic Environments
- Complexity of Cayley Distance and other General Metrics on Permutation Groups
- Electronic Notes in Theoretical Computer Science 67 (2002) URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
- FixedPoint alexandre@lia.ufc.br
- Principais reas Temticas de Aes de Extenso estabelecidas pelo Grupo Tcnico de Sistema de Dados e Informaes e RENEX
- UnB/Universidade de Braslia Relatrio de Gesto 2004 ANEXO 3 UnB: Relatrio Detalhado do Planejamento Anual em 2004, por
- Verification of the Completeness of Unification Algorithms `a la Andreia B. Avelar1
- An Operational Characterization of (lazy) Strong Normalization UnB 2006 -p. 1/16 An Operational Characterization
- Seminario Informal (mas Formal!) 2005 Verificac ~ao Formal em PVS do Sistema KB2D
- Ayala-Rinc Computac ~
- A Flexible Framework for Visualisation of Computational Properties of General Explicit
- reiner@hartenstein.de 26 September 2008
- On automating the extraction of programs from termination proofs
- Introduction Les syst`emes types modernes
- Architectural Speci cation, Exploration and Simulation Through Rewriting-Logic
- SecondOrder Matching via Explicit Substitutions #
- Under consideration for publication in J. Functional Programming 1 Typed -calculi with one binder
- LP P = {p, q, r, p, q, r, . . .}
- CALENDRIO UNIVERSITRIO DE GRADUAO (Por Atividades)
- Logics for Approximate Reasoning Marcelo Finger Renata Wassermann
- II Seminario Informal (mas Formal) Sem^antica do PVS: Tipos Dependentes e Aplicac~oes
- C. Nalon Seminario IME/USP 08/05/06 -slide #1 Prova Automtica de Teoremas
- Formal Verification of an Optimal Air Traffic Conflict Resolution and Recovery Algorithm
- Substitui c AyalaRinc on
- convergence reduction-based
- C. Nalon Seminrio Informal (, mas formal!) UnB/IE/MAT 02/12/05 -slide #1 Formas Normais para Lgicas Modais
- Modifications of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix
- Verification of Rewrite Based Specifications using Proof Thomas Mailleux Sant'Ana1
- Submetido para TEMA Visualizing Relations between Computational
- Similitud de Secuencias: de un Par a Todas contra Todas
- UNIVERSIDADE DE BRASLIA PROGRAMA DE PS-GRADUAO EM INFORMTICA
- Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for
- Approximating Classical Logic "From Marcelo Finger Renata Wassermann
- Using Rewriting-Logic Notation for Funcional Verification in Data-Stream Based Reconfigurable Computing
- A Relational Theorem on the Correctness of General Recursive Programs A Relational Theorem on the Correctness of
- VisualMCM: Visualising Execution Histories on Multiple Memory Consistency Models
- Universidade de Brasilia Instituto de Ci^encias Exatas
- Approximated Theorem Proving Marcelo Finger Renata Wassermann
- dB : the -calculus in de Bruijn Notation The intersection type system for dB
- Submitted to: c A.B. Avelar, A.L. Galdino, F.L.C. de Moura and M. Ayala-Rincon
- Matrcula Prova 1 Prova 2 Mdia Meno 07/30262 9,6 1 5,3 MM
- Clculo Lambda e Aplicaes Flavio L. C. de Moura
- Formalization in PVS of Balancing Properties Necessary for the Security of the Dolev-Yao
